./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6522688b75eabd4613afff43fc24a072ce425cbb7b76f809d7e56aded5f14999
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:01:55,956 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:01:55,957 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:01:55,984 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:01:55,984 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:01:55,985 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:01:55,987 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:01:55,988 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:01:55,989 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:01:55,990 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:01:55,991 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:01:55,992 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:01:55,992 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:01:55,993 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:01:55,994 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:01:55,995 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:01:55,996 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:01:55,996 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:01:55,997 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:01:55,999 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:01:56,000 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:01:56,002 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:01:56,003 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:01:56,004 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:01:56,007 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:01:56,007 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:01:56,007 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:01:56,008 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:01:56,008 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:01:56,009 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:01:56,009 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:01:56,010 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:01:56,010 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:01:56,011 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:01:56,011 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:01:56,012 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:01:56,012 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:01:56,012 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:01:56,012 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:01:56,013 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:01:56,013 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:01:56,014 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:01:56,032 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:01:56,032 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:01:56,032 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:01:56,032 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:01:56,033 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:01:56,033 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:01:56,033 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:01:56,034 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:01:56,034 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:01:56,035 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:01:56,035 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:01:56,036 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:01:56,036 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:01:56,037 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:01:56,037 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6522688b75eabd4613afff43fc24a072ce425cbb7b76f809d7e56aded5f14999
[2023-11-03 13:01:56,220 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:01:56,242 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:01:56,244 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:01:56,245 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:01:56,246 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:01:56,247 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2023-11-03 13:01:57,376 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:01:57,542 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:01:57,543 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-array-const-race-2.i
[2023-11-03 13:01:57,552 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f71dba0c0/606a4305e920482c8c1715d96f9ee3fc/FLAGb0b904f6c
[2023-11-03 13:01:57,924 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/f71dba0c0/606a4305e920482c8c1715d96f9ee3fc
[2023-11-03 13:01:57,926 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:01:57,928 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:01:57,929 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:01:57,929 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:01:57,933 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:01:57,933 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:01:57" (1/1) ...
[2023-11-03 13:01:57,934 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3adb1d18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:57, skipping insertion in model container
[2023-11-03 13:01:57,934 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:01:57" (1/1) ...
[2023-11-03 13:01:57,940 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:01:57,966 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:01:58,164 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:01:58,173 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:01:58,205 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:01:58,230 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:01:58,231 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58 WrapperNode
[2023-11-03 13:01:58,231 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:01:58,232 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:01:58,232 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:01:58,232 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:01:58,238 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,250 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,265 INFO  L138                Inliner]: procedures = 157, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51
[2023-11-03 13:01:58,265 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:01:58,266 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:01:58,266 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:01:58,266 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:01:58,274 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,274 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,278 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,278 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,283 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,285 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,286 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,287 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,289 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:01:58,289 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:01:58,290 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:01:58,290 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:01:58,290 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (1/1) ...
[2023-11-03 13:01:58,296 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:01:58,303 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:01:58,315 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 13:01:58,318 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:01:58,341 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:01:58,342 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:01:58,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:01:58,342 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:01:58,342 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:01:58,343 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:01:58,452 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:01:58,454 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:01:58,624 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:01:58,631 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:01:58,631 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:01:58,633 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:01:58 BoogieIcfgContainer
[2023-11-03 13:01:58,633 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:01:58,635 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:01:58,635 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:01:58,637 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:01:58,637 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:01:57" (1/3) ...
[2023-11-03 13:01:58,638 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f121247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:01:58, skipping insertion in model container
[2023-11-03 13:01:58,638 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:01:58" (2/3) ...
[2023-11-03 13:01:58,638 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f121247 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:01:58, skipping insertion in model container
[2023-11-03 13:01:58,638 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:01:58" (3/3) ...
[2023-11-03 13:01:58,639 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-array-const-race-2.i
[2023-11-03 13:01:58,646 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:01:58,654 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:01:58,654 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations.
[2023-11-03 13:01:58,654 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:01:58,700 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2023-11-03 13:01:58,728 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,764 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2023-11-03 13:01:58,764 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:01:58,768 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 95 events. 5/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-11-03 13:01:58,768 INFO  L82        GeneralOperation]: Start removeDead. Operand has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,772 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,775 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:01:58,784 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,786 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 69 places, 69 transitions, 146 flow
[2023-11-03 13:01:58,807 INFO  L130       PetriNetUnfolder]: 5/95 cut-off events.
[2023-11-03 13:01:58,808 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:01:58,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 101 conditions, 95 events. 5/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 45. Up to 4 conditions per place. 
[2023-11-03 13:01:58,809 INFO  L119        LiptonReduction]: Number of co-enabled transitions 896
[2023-11-03 13:02:00,264 INFO  L134        LiptonReduction]: Checked pairs total: 1515
[2023-11-03 13:02:00,264 INFO  L136        LiptonReduction]: Total number of compositions: 54
[2023-11-03 13:02:00,277 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:02:00,283 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3d4a22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:02:00,283 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2023-11-03 13:02:00,285 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-11-03 13:02:00,285 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:02:00,286 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:00,286 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 13:02:00,286 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-03 13:02:00,290 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:00,290 INFO  L85        PathProgramCache]: Analyzing trace with hash 253400, now seen corresponding path program 1 times
[2023-11-03 13:02:00,296 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:00,297 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632413947]
[2023-11-03 13:02:00,297 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:00,297 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:00,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:00,465 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:00,466 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:00,466 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632413947]
[2023-11-03 13:02:00,467 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632413947] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:00,467 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:00,467 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:00,469 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35352814]
[2023-11-03 13:02:00,469 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:00,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:00,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:00,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:00,493 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:00,521 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 123
[2023-11-03 13:02:00,523 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 44 flow. Second operand  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,523 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:00,523 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 123
[2023-11-03 13:02:00,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:00,579 INFO  L130       PetriNetUnfolder]: 12/52 cut-off events.
[2023-11-03 13:02:00,580 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:02:00,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100 conditions, 52 events. 12/52 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 144 event pairs, 5 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 72. Up to 36 conditions per place. 
[2023-11-03 13:02:00,582 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 13 selfloop transitions, 2 changer transitions 0/20 dead transitions.
[2023-11-03 13:02:00,582 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 20 transitions, 78 flow
[2023-11-03 13:02:00,584 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:00,587 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:00,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions.
[2023-11-03 13:02:00,594 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5501355013550135
[2023-11-03 13:02:00,594 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 203 transitions.
[2023-11-03 13:02:00,594 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 203 transitions.
[2023-11-03 13:02:00,595 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:00,597 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 203 transitions.
[2023-11-03 13:02:00,599 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,602 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,603 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,604 INFO  L175             Difference]: Start difference. First operand has 20 places, 18 transitions, 44 flow. Second operand 3 states and 203 transitions.
[2023-11-03 13:02:00,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 20 transitions, 78 flow
[2023-11-03 13:02:00,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 21 places, 20 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:02:00,608 INFO  L231             Difference]: Finished difference. Result has 22 places, 17 transitions, 50 flow
[2023-11-03 13:02:00,609 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=22, PETRI_TRANSITIONS=17}
[2023-11-03 13:02:00,612 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 2 predicate places.
[2023-11-03 13:02:00,612 INFO  L495      AbstractCegarLoop]: Abstraction has has 22 places, 17 transitions, 50 flow
[2023-11-03 13:02:00,612 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 63.0) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,612 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:00,612 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:00,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:02:00,613 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-03 13:02:00,613 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:00,613 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030225790, now seen corresponding path program 1 times
[2023-11-03 13:02:00,613 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:00,614 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643039993]
[2023-11-03 13:02:00,614 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:00,614 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:00,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:00,656 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:00,657 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:00,657 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643039993]
[2023-11-03 13:02:00,657 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643039993] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:00,657 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:00,657 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:00,657 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793083720]
[2023-11-03 13:02:00,657 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:00,658 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:00,659 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:00,659 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:00,659 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:00,673 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 123
[2023-11-03 13:02:00,673 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 17 transitions, 50 flow. Second operand  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,673 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:00,673 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 123
[2023-11-03 13:02:00,673 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:00,731 INFO  L130       PetriNetUnfolder]: 20/71 cut-off events.
[2023-11-03 13:02:00,731 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:02:00,731 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153 conditions, 71 events. 20/71 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 223 event pairs, 13 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 122. Up to 48 conditions per place. 
[2023-11-03 13:02:00,732 INFO  L137   encePairwiseOnDemand]: 119/123 looper letters, 17 selfloop transitions, 3 changer transitions 1/24 dead transitions.
[2023-11-03 13:02:00,732 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 24 transitions, 111 flow
[2023-11-03 13:02:00,732 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:00,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:00,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 199 transitions.
[2023-11-03 13:02:00,734 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5392953929539296
[2023-11-03 13:02:00,734 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 199 transitions.
[2023-11-03 13:02:00,734 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 199 transitions.
[2023-11-03 13:02:00,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:00,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 199 transitions.
[2023-11-03 13:02:00,736 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,737 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,737 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,737 INFO  L175             Difference]: Start difference. First operand has 22 places, 17 transitions, 50 flow. Second operand 3 states and 199 transitions.
[2023-11-03 13:02:00,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 24 transitions, 111 flow
[2023-11-03 13:02:00,738 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 24 transitions, 105 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:00,739 INFO  L231             Difference]: Finished difference. Result has 23 places, 19 transitions, 65 flow
[2023-11-03 13:02:00,739 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=123, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=23, PETRI_TRANSITIONS=19}
[2023-11-03 13:02:00,739 INFO  L288   CegarLoopForPetriNet]: 20 programPoint places, 3 predicate places.
[2023-11-03 13:02:00,740 INFO  L495      AbstractCegarLoop]: Abstraction has has 23 places, 19 transitions, 65 flow
[2023-11-03 13:02:00,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:00,740 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:00,740 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1]
[2023-11-03 13:02:00,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:02:00,740 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] ===
[2023-11-03 13:02:00,741 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:00,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1030223241, now seen corresponding path program 1 times
[2023-11-03 13:02:00,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:00,741 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295991569]
[2023-11-03 13:02:00,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:00,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:00,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:00,760 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:02:00,769 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:00,784 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:02:00,784 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:02:00,785 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 5 remaining)
[2023-11-03 13:02:00,787 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 5 remaining)
[2023-11-03 13:02:00,787 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 5 remaining)
[2023-11-03 13:02:00,787 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 5 remaining)
[2023-11-03 13:02:00,787 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 5 remaining)
[2023-11-03 13:02:00,788 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:02:00,788 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1]
[2023-11-03 13:02:00,790 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:02:00,790 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:02:00,804 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-11-03 13:02:00,807 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,853 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2023-11-03 13:02:00,854 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:02:00,854 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 167 events. 10/167 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 403 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. 
[2023-11-03 13:02:00,854 INFO  L82        GeneralOperation]: Start removeDead. Operand has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,855 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,855 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:02:00,855 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,855 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,856 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 86 places, 85 transitions, 188 flow
[2023-11-03 13:02:00,875 INFO  L130       PetriNetUnfolder]: 10/167 cut-off events.
[2023-11-03 13:02:00,875 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2023-11-03 13:02:00,876 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181 conditions, 167 events. 10/167 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 403 event pairs, 0 based on Foata normal form. 0/143 useless extension candidates. Maximal degree in co-relation 97. Up to 8 conditions per place. 
[2023-11-03 13:02:00,878 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2380
[2023-11-03 13:02:01,984 INFO  L134        LiptonReduction]: Checked pairs total: 5120
[2023-11-03 13:02:01,985 INFO  L136        LiptonReduction]: Total number of compositions: 58
[2023-11-03 13:02:01,987 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:02:01,990 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3d4a22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:02:01,990 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-11-03 13:02:01,993 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-11-03 13:02:01,993 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:02:01,994 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:01,994 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 13:02:01,995 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-03 13:02:01,995 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:01,996 INFO  L85        PathProgramCache]: Analyzing trace with hash 411287, now seen corresponding path program 1 times
[2023-11-03 13:02:01,996 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:01,997 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145377105]
[2023-11-03 13:02:01,997 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:01,997 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:02,008 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:02,037 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:02,037 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:02,037 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145377105]
[2023-11-03 13:02:02,037 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145377105] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:02,037 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:02,038 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:02,038 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121457250]
[2023-11-03 13:02:02,038 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:02,038 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:02,038 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:02,039 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:02,039 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:02,053 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 76 out of 143
[2023-11-03 13:02:02,053 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 30 transitions, 78 flow. Second operand  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,053 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:02,053 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 143
[2023-11-03 13:02:02,053 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:02,153 INFO  L130       PetriNetUnfolder]: 372/753 cut-off events.
[2023-11-03 13:02:02,153 INFO  L131       PetriNetUnfolder]: For 33/33 co-relation queries the response was YES.
[2023-11-03 13:02:02,155 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 753 events. 372/753 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3870 event pairs, 170 based on Foata normal form. 0/658 useless extension candidates. Maximal degree in co-relation 270. Up to 641 conditions per place. 
[2023-11-03 13:02:02,157 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 24 selfloop transitions, 2 changer transitions 0/35 dead transitions.
[2023-11-03 13:02:02,158 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 140 flow
[2023-11-03 13:02:02,158 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:02,158 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:02,159 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 256 transitions.
[2023-11-03 13:02:02,160 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5967365967365967
[2023-11-03 13:02:02,160 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 256 transitions.
[2023-11-03 13:02:02,160 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 256 transitions.
[2023-11-03 13:02:02,160 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:02,160 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 256 transitions.
[2023-11-03 13:02:02,161 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,163 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,163 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,163 INFO  L175             Difference]: Start difference. First operand has 33 places, 30 transitions, 78 flow. Second operand 3 states and 256 transitions.
[2023-11-03 13:02:02,163 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 140 flow
[2023-11-03 13:02:02,164 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:02:02,164 INFO  L231             Difference]: Finished difference. Result has 35 places, 30 transitions, 88 flow
[2023-11-03 13:02:02,165 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=35, PETRI_TRANSITIONS=30}
[2023-11-03 13:02:02,165 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places.
[2023-11-03 13:02:02,165 INFO  L495      AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 88 flow
[2023-11-03 13:02:02,166 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 77.0) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,166 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:02,166 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:02,166 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:02:02,166 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-03 13:02:02,166 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:02,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -2032684283, now seen corresponding path program 1 times
[2023-11-03 13:02:02,167 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:02,167 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956963226]
[2023-11-03 13:02:02,167 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:02,167 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:02,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:02,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:02,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:02,194 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956963226]
[2023-11-03 13:02:02,194 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956963226] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:02,194 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:02,194 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:02,194 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932303558]
[2023-11-03 13:02:02,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:02,195 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:02,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:02,195 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:02,195 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:02,208 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 143
[2023-11-03 13:02:02,208 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 88 flow. Second operand  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,208 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:02,209 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 143
[2023-11-03 13:02:02,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:02,343 INFO  L130       PetriNetUnfolder]: 505/980 cut-off events.
[2023-11-03 13:02:02,343 INFO  L131       PetriNetUnfolder]: For 130/130 co-relation queries the response was YES.
[2023-11-03 13:02:02,345 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1994 conditions, 980 events. 505/980 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5242 event pairs, 294 based on Foata normal form. 0/872 useless extension candidates. Maximal degree in co-relation 1949. Up to 615 conditions per place. 
[2023-11-03 13:02:02,348 INFO  L137   encePairwiseOnDemand]: 137/143 looper letters, 33 selfloop transitions, 5 changer transitions 0/46 dead transitions.
[2023-11-03 13:02:02,348 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 46 transitions, 211 flow
[2023-11-03 13:02:02,349 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:02,349 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:02,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions.
[2023-11-03 13:02:02,350 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5897435897435898
[2023-11-03 13:02:02,350 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 253 transitions.
[2023-11-03 13:02:02,350 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions.
[2023-11-03 13:02:02,350 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:02,351 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions.
[2023-11-03 13:02:02,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,353 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,353 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 143.0) internal successors, (572), 4 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,353 INFO  L175             Difference]: Start difference. First operand has 35 places, 30 transitions, 88 flow. Second operand 3 states and 253 transitions.
[2023-11-03 13:02:02,353 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 46 transitions, 211 flow
[2023-11-03 13:02:02,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 46 transitions, 208 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:02,355 INFO  L231             Difference]: Finished difference. Result has 38 places, 34 transitions, 124 flow
[2023-11-03 13:02:02,355 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=38, PETRI_TRANSITIONS=34}
[2023-11-03 13:02:02,355 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places.
[2023-11-03 13:02:02,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 124 flow
[2023-11-03 13:02:02,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,356 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:02,356 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:02,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:02:02,356 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-03 13:02:02,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:02,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 1288850991, now seen corresponding path program 1 times
[2023-11-03 13:02:02,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:02,357 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684233983]
[2023-11-03 13:02:02,357 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:02,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:02,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:02,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:02,403 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:02,403 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684233983]
[2023-11-03 13:02:02,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684233983] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:02,404 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:02,404 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:02:02,404 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102934296]
[2023-11-03 13:02:02,404 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:02,405 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 13:02:02,405 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:02,405 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 13:02:02,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-03 13:02:02,436 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 74 out of 143
[2023-11-03 13:02:02,436 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 124 flow. Second operand  has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,436 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:02,436 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 143
[2023-11-03 13:02:02,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:02,529 INFO  L130       PetriNetUnfolder]: 338/685 cut-off events.
[2023-11-03 13:02:02,529 INFO  L131       PetriNetUnfolder]: For 464/478 co-relation queries the response was YES.
[2023-11-03 13:02:02,530 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1751 conditions, 685 events. 338/685 cut-off events. For 464/478 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3346 event pairs, 170 based on Foata normal form. 43/714 useless extension candidates. Maximal degree in co-relation 727. Up to 383 conditions per place. 
[2023-11-03 13:02:02,532 INFO  L137   encePairwiseOnDemand]: 139/143 looper letters, 39 selfloop transitions, 3 changer transitions 0/50 dead transitions.
[2023-11-03 13:02:02,532 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 268 flow
[2023-11-03 13:02:02,533 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:02:02,533 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:02:02,534 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions.
[2023-11-03 13:02:02,534 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5786713286713286
[2023-11-03 13:02:02,534 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 331 transitions.
[2023-11-03 13:02:02,535 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 331 transitions.
[2023-11-03 13:02:02,535 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:02,535 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 331 transitions.
[2023-11-03 13:02:02,537 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 82.75) internal successors, (331), 4 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,539 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,539 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,540 INFO  L175             Difference]: Start difference. First operand has 38 places, 34 transitions, 124 flow. Second operand 4 states and 331 transitions.
[2023-11-03 13:02:02,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 268 flow
[2023-11-03 13:02:02,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:02,544 INFO  L231             Difference]: Finished difference. Result has 40 places, 35 transitions, 130 flow
[2023-11-03 13:02:02,544 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=143, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=35}
[2023-11-03 13:02:02,544 INFO  L288   CegarLoopForPetriNet]: 33 programPoint places, 7 predicate places.
[2023-11-03 13:02:02,545 INFO  L495      AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 130 flow
[2023-11-03 13:02:02,545 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 75.5) internal successors, (302), 4 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:02,545 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:02,545 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:02:02,545 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:02:02,545 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-03 13:02:02,545 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:02,546 INFO  L85        PathProgramCache]: Analyzing trace with hash -451073316, now seen corresponding path program 1 times
[2023-11-03 13:02:02,546 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:02,546 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363075623]
[2023-11-03 13:02:02,546 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:02,546 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:02,557 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:02,557 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:02:02,564 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:02,568 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:02:02,568 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining)
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining)
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining)
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining)
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining)
[2023-11-03 13:02:02,569 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining)
[2023-11-03 13:02:02,569 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 13:02:02,569 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-03 13:02:02,570 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:02:02,571 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:02:02,584 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 13:02:02,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,603 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2023-11-03 13:02:02,603 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:02:02,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 314 conditions, 286 events. 20/286 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 855 event pairs, 1 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. 
[2023-11-03 13:02:02,604 INFO  L82        GeneralOperation]: Start removeDead. Operand has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,605 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,605 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:02:02,605 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,605 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 103 places, 101 transitions, 232 flow
[2023-11-03 13:02:02,621 INFO  L130       PetriNetUnfolder]: 20/286 cut-off events.
[2023-11-03 13:02:02,622 INFO  L131       PetriNetUnfolder]: For 19/19 co-relation queries the response was YES.
[2023-11-03 13:02:02,622 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 314 conditions, 286 events. 20/286 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 855 event pairs, 1 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 175. Up to 16 conditions per place. 
[2023-11-03 13:02:02,626 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4284
[2023-11-03 13:02:03,875 INFO  L134        LiptonReduction]: Checked pairs total: 10005
[2023-11-03 13:02:03,875 INFO  L136        LiptonReduction]: Total number of compositions: 67
[2023-11-03 13:02:03,877 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:02:03,877 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3d4a22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:02:03,877 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-03 13:02:03,879 INFO  L130       PetriNetUnfolder]: 0/4 cut-off events.
[2023-11-03 13:02:03,879 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:02:03,879 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:03,879 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 13:02:03,879 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:03,879 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:03,879 INFO  L85        PathProgramCache]: Analyzing trace with hash 593873, now seen corresponding path program 1 times
[2023-11-03 13:02:03,880 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:03,880 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96682102]
[2023-11-03 13:02:03,880 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:03,880 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:03,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:03,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:03,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:03,907 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96682102]
[2023-11-03 13:02:03,908 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96682102] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:03,908 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:03,908 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:03,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250458228]
[2023-11-03 13:02:03,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:03,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:03,908 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:03,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:03,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:03,925 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 90 out of 168
[2023-11-03 13:02:03,926 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 106 flow. Second operand  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:03,926 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:03,926 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 168
[2023-11-03 13:02:03,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:04,292 INFO  L130       PetriNetUnfolder]: 2727/4870 cut-off events.
[2023-11-03 13:02:04,292 INFO  L131       PetriNetUnfolder]: For 394/394 co-relation queries the response was YES.
[2023-11-03 13:02:04,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9218 conditions, 4870 events. 2727/4870 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 32396 event pairs, 1717 based on Foata normal form. 0/4412 useless extension candidates. Maximal degree in co-relation 1279. Up to 4052 conditions per place. 
[2023-11-03 13:02:04,313 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 29 selfloop transitions, 2 changer transitions 0/43 dead transitions.
[2023-11-03 13:02:04,313 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 178 flow
[2023-11-03 13:02:04,314 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:04,314 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:04,314 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions.
[2023-11-03 13:02:04,315 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6011904761904762
[2023-11-03 13:02:04,315 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 303 transitions.
[2023-11-03 13:02:04,315 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions.
[2023-11-03 13:02:04,315 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:04,315 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions.
[2023-11-03 13:02:04,316 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,317 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,317 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,317 INFO  L175             Difference]: Start difference. First operand has 42 places, 38 transitions, 106 flow. Second operand 3 states and 303 transitions.
[2023-11-03 13:02:04,317 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 178 flow
[2023-11-03 13:02:04,318 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 43 transitions, 178 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:02:04,319 INFO  L231             Difference]: Finished difference. Result has 44 places, 38 transitions, 116 flow
[2023-11-03 13:02:04,319 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=44, PETRI_TRANSITIONS=38}
[2023-11-03 13:02:04,320 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-11-03 13:02:04,320 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 116 flow
[2023-11-03 13:02:04,320 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,320 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:04,320 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:04,320 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:02:04,320 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:04,321 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:04,321 INFO  L85        PathProgramCache]: Analyzing trace with hash -688259915, now seen corresponding path program 1 times
[2023-11-03 13:02:04,321 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:04,321 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944228122]
[2023-11-03 13:02:04,321 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:04,321 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:04,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:04,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:04,342 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:04,342 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944228122]
[2023-11-03 13:02:04,342 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944228122] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:04,342 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:04,342 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:04,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387695101]
[2023-11-03 13:02:04,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:04,343 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:04,343 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:04,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:04,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:04,362 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2023-11-03 13:02:04,363 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 116 flow. Second operand  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,363 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:04,363 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2023-11-03 13:02:04,363 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:04,873 INFO  L130       PetriNetUnfolder]: 5894/9408 cut-off events.
[2023-11-03 13:02:04,873 INFO  L131       PetriNetUnfolder]: For 1266/1266 co-relation queries the response was YES.
[2023-11-03 13:02:04,883 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19069 conditions, 9408 events. 5894/9408 cut-off events. For 1266/1266 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 59256 event pairs, 4789 based on Foata normal form. 0/8587 useless extension candidates. Maximal degree in co-relation 19018. Up to 7622 conditions per place. 
[2023-11-03 13:02:04,916 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 47 selfloop transitions, 5 changer transitions 0/60 dead transitions.
[2023-11-03 13:02:04,916 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 60 transitions, 289 flow
[2023-11-03 13:02:04,917 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:04,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:04,917 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2023-11-03 13:02:04,918 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2023-11-03 13:02:04,918 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2023-11-03 13:02:04,918 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2023-11-03 13:02:04,918 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:04,918 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2023-11-03 13:02:04,919 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,920 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,920 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,920 INFO  L175             Difference]: Start difference. First operand has 44 places, 38 transitions, 116 flow. Second operand 3 states and 306 transitions.
[2023-11-03 13:02:04,920 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 60 transitions, 289 flow
[2023-11-03 13:02:04,921 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 60 transitions, 286 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:04,922 INFO  L231             Difference]: Finished difference. Result has 46 places, 42 transitions, 147 flow
[2023-11-03 13:02:04,922 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=42}
[2023-11-03 13:02:04,923 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 4 predicate places.
[2023-11-03 13:02:04,923 INFO  L495      AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 147 flow
[2023-11-03 13:02:04,923 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,923 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:04,923 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:04,923 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-03 13:02:04,923 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:04,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:04,924 INFO  L85        PathProgramCache]: Analyzing trace with hash 748844, now seen corresponding path program 1 times
[2023-11-03 13:02:04,924 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:04,924 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10348613]
[2023-11-03 13:02:04,924 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:04,924 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:04,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:04,966 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:04,966 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:04,966 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10348613]
[2023-11-03 13:02:04,966 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10348613] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:04,966 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:04,966 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:02:04,966 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804247496]
[2023-11-03 13:02:04,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:04,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 13:02:04,967 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:04,967 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 13:02:04,967 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-03 13:02:04,993 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 168
[2023-11-03 13:02:04,994 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 147 flow. Second operand  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:04,994 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:04,994 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 168
[2023-11-03 13:02:04,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:05,321 INFO  L130       PetriNetUnfolder]: 3162/5514 cut-off events.
[2023-11-03 13:02:05,322 INFO  L131       PetriNetUnfolder]: For 1355/2003 co-relation queries the response was YES.
[2023-11-03 13:02:05,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12182 conditions, 5514 events. 3162/5514 cut-off events. For 1355/2003 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 36320 event pairs, 1811 based on Foata normal form. 532/5797 useless extension candidates. Maximal degree in co-relation 4425. Up to 2993 conditions per place. 
[2023-11-03 13:02:05,346 INFO  L137   encePairwiseOnDemand]: 164/168 looper letters, 44 selfloop transitions, 3 changer transitions 0/60 dead transitions.
[2023-11-03 13:02:05,346 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 60 transitions, 291 flow
[2023-11-03 13:02:05,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:02:05,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:02:05,348 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions.
[2023-11-03 13:02:05,348 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2023-11-03 13:02:05,348 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 396 transitions.
[2023-11-03 13:02:05,348 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions.
[2023-11-03 13:02:05,348 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:05,349 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions.
[2023-11-03 13:02:05,349 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:05,350 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:05,351 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 168.0) internal successors, (840), 5 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:05,351 INFO  L175             Difference]: Start difference. First operand has 46 places, 42 transitions, 147 flow. Second operand 4 states and 396 transitions.
[2023-11-03 13:02:05,351 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 60 transitions, 291 flow
[2023-11-03 13:02:05,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:05,355 INFO  L231             Difference]: Finished difference. Result has 49 places, 43 transitions, 158 flow
[2023-11-03 13:02:05,355 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=158, PETRI_PLACES=49, PETRI_TRANSITIONS=43}
[2023-11-03 13:02:05,355 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 7 predicate places.
[2023-11-03 13:02:05,355 INFO  L495      AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 158 flow
[2023-11-03 13:02:05,356 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:05,356 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:05,356 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:05,356 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:02:05,356 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:05,356 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:05,356 INFO  L85        PathProgramCache]: Analyzing trace with hash 1458128080, now seen corresponding path program 1 times
[2023-11-03 13:02:05,356 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:05,356 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935176152]
[2023-11-03 13:02:05,356 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:05,357 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:05,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:05,379 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:02:05,379 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:05,379 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935176152]
[2023-11-03 13:02:05,379 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935176152] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:05,379 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:05,379 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:05,379 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687601784]
[2023-11-03 13:02:05,379 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:05,380 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:05,380 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:05,380 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:05,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:05,396 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 168
[2023-11-03 13:02:05,396 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 158 flow. Second operand  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:05,396 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:05,396 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 168
[2023-11-03 13:02:05,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:05,976 INFO  L130       PetriNetUnfolder]: 5570/9148 cut-off events.
[2023-11-03 13:02:05,976 INFO  L131       PetriNetUnfolder]: For 4659/4832 co-relation queries the response was YES.
[2023-11-03 13:02:05,986 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21462 conditions, 9148 events. 5570/9148 cut-off events. For 4659/4832 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 58817 event pairs, 3584 based on Foata normal form. 0/8675 useless extension candidates. Maximal degree in co-relation 8932. Up to 6345 conditions per place. 
[2023-11-03 13:02:06,011 INFO  L137   encePairwiseOnDemand]: 161/168 looper letters, 49 selfloop transitions, 9 changer transitions 0/67 dead transitions.
[2023-11-03 13:02:06,012 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 360 flow
[2023-11-03 13:02:06,012 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:06,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:06,013 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions.
[2023-11-03 13:02:06,013 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6071428571428571
[2023-11-03 13:02:06,013 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 306 transitions.
[2023-11-03 13:02:06,013 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions.
[2023-11-03 13:02:06,014 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:06,014 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions.
[2023-11-03 13:02:06,014 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,015 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,016 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,016 INFO  L175             Difference]: Start difference. First operand has 49 places, 43 transitions, 158 flow. Second operand 3 states and 306 transitions.
[2023-11-03 13:02:06,016 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 360 flow
[2023-11-03 13:02:06,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 355 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:06,024 INFO  L231             Difference]: Finished difference. Result has 51 places, 50 transitions, 234 flow
[2023-11-03 13:02:06,024 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=51, PETRI_TRANSITIONS=50}
[2023-11-03 13:02:06,024 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-11-03 13:02:06,024 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 234 flow
[2023-11-03 13:02:06,025 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,025 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:06,025 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:06,025 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 13:02:06,025 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:06,025 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:06,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 758787877, now seen corresponding path program 1 times
[2023-11-03 13:02:06,026 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:06,026 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950731812]
[2023-11-03 13:02:06,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:06,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:06,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:06,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:06,085 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:06,085 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950731812]
[2023-11-03 13:02:06,085 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950731812] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:06,086 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:06,086 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:02:06,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104305878]
[2023-11-03 13:02:06,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:06,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:06,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:06,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:06,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:06,103 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 168
[2023-11-03 13:02:06,103 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 234 flow. Second operand  has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,103 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:06,103 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 168
[2023-11-03 13:02:06,103 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:06,263 INFO  L130       PetriNetUnfolder]: 597/1538 cut-off events.
[2023-11-03 13:02:06,263 INFO  L131       PetriNetUnfolder]: For 1066/1084 co-relation queries the response was YES.
[2023-11-03 13:02:06,265 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4020 conditions, 1538 events. 597/1538 cut-off events. For 1066/1084 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 10684 event pairs, 59 based on Foata normal form. 300/1765 useless extension candidates. Maximal degree in co-relation 1509. Up to 905 conditions per place. 
[2023-11-03 13:02:06,268 INFO  L137   encePairwiseOnDemand]: 162/168 looper letters, 36 selfloop transitions, 7 changer transitions 0/56 dead transitions.
[2023-11-03 13:02:06,268 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 331 flow
[2023-11-03 13:02:06,269 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:06,269 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:06,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions.
[2023-11-03 13:02:06,270 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5892857142857143
[2023-11-03 13:02:06,270 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 297 transitions.
[2023-11-03 13:02:06,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions.
[2023-11-03 13:02:06,270 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:06,270 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions.
[2023-11-03 13:02:06,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,271 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,272 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 168.0) internal successors, (672), 4 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,272 INFO  L175             Difference]: Start difference. First operand has 51 places, 50 transitions, 234 flow. Second operand 3 states and 297 transitions.
[2023-11-03 13:02:06,272 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 331 flow
[2023-11-03 13:02:06,275 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 56 transitions, 319 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:06,276 INFO  L231             Difference]: Finished difference. Result has 51 places, 44 transitions, 188 flow
[2023-11-03 13:02:06,276 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=168, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=51, PETRI_TRANSITIONS=44}
[2023-11-03 13:02:06,277 INFO  L288   CegarLoopForPetriNet]: 42 programPoint places, 9 predicate places.
[2023-11-03 13:02:06,277 INFO  L495      AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 188 flow
[2023-11-03 13:02:06,277 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:06,277 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:06,277 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:02:06,277 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 13:02:06,277 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-03 13:02:06,277 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:06,277 INFO  L85        PathProgramCache]: Analyzing trace with hash 1193880284, now seen corresponding path program 1 times
[2023-11-03 13:02:06,278 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:06,278 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465496992]
[2023-11-03 13:02:06,278 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:06,278 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:06,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:06,288 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:02:06,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:06,298 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:02:06,298 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2023-11-03 13:02:06,298 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2023-11-03 13:02:06,299 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 13:02:06,299 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:06,299 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:02:06,299 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:02:06,312 INFO  L144    ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions.
[2023-11-03 13:02:06,314 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,353 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2023-11-03 13:02:06,353 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:02:06,354 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 556 conditions, 501 events. 42/501 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1935 event pairs, 6 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 306. Up to 32 conditions per place. 
[2023-11-03 13:02:06,354 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,356 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,356 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:02:06,356 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,356 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,356 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 117 transitions, 278 flow
[2023-11-03 13:02:06,387 INFO  L130       PetriNetUnfolder]: 42/501 cut-off events.
[2023-11-03 13:02:06,387 INFO  L131       PetriNetUnfolder]: For 48/48 co-relation queries the response was YES.
[2023-11-03 13:02:06,388 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 556 conditions, 501 events. 42/501 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1935 event pairs, 6 based on Foata normal form. 0/423 useless extension candidates. Maximal degree in co-relation 306. Up to 32 conditions per place. 
[2023-11-03 13:02:06,397 INFO  L119        LiptonReduction]: Number of co-enabled transitions 6664
[2023-11-03 13:02:07,684 INFO  L134        LiptonReduction]: Checked pairs total: 16804
[2023-11-03 13:02:07,684 INFO  L136        LiptonReduction]: Total number of compositions: 75
[2023-11-03 13:02:07,686 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:02:07,687 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3d4a22, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:02:07,687 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2023-11-03 13:02:07,688 INFO  L130       PetriNetUnfolder]: 0/5 cut-off events.
[2023-11-03 13:02:07,688 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:02:07,688 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:07,688 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1]
[2023-11-03 13:02:07,689 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:07,689 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:07,689 INFO  L85        PathProgramCache]: Analyzing trace with hash 800324, now seen corresponding path program 1 times
[2023-11-03 13:02:07,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:07,689 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819786073]
[2023-11-03 13:02:07,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:07,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:07,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:07,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:07,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:07,712 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819786073]
[2023-11-03 13:02:07,712 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819786073] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:07,712 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:07,712 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:07,713 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964975384]
[2023-11-03 13:02:07,713 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:07,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:07,714 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:07,714 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:07,714 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:07,732 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 192
[2023-11-03 13:02:07,732 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 136 flow. Second operand  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:07,732 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:07,732 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 192
[2023-11-03 13:02:07,732 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:09,704 INFO  L130       PetriNetUnfolder]: 24683/37289 cut-off events.
[2023-11-03 13:02:09,704 INFO  L131       PetriNetUnfolder]: For 3846/3846 co-relation queries the response was YES.
[2023-11-03 13:02:09,748 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 72857 conditions, 37289 events. 24683/37289 cut-off events. For 3846/3846 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 266543 event pairs, 18101 based on Foata normal form. 0/34309 useless extension candidates. Maximal degree in co-relation 10581. Up to 33442 conditions per place. 
[2023-11-03 13:02:09,857 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 36 selfloop transitions, 2 changer transitions 0/51 dead transitions.
[2023-11-03 13:02:09,857 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 222 flow
[2023-11-03 13:02:09,858 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:09,858 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:09,859 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 352 transitions.
[2023-11-03 13:02:09,859 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6111111111111112
[2023-11-03 13:02:09,859 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 352 transitions.
[2023-11-03 13:02:09,859 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 352 transitions.
[2023-11-03 13:02:09,860 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:09,860 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 352 transitions.
[2023-11-03 13:02:09,860 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:09,861 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:09,862 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:09,862 INFO  L175             Difference]: Start difference. First operand has 51 places, 46 transitions, 136 flow. Second operand 3 states and 352 transitions.
[2023-11-03 13:02:09,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 222 flow
[2023-11-03 13:02:09,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:02:09,864 INFO  L231             Difference]: Finished difference. Result has 53 places, 46 transitions, 146 flow
[2023-11-03 13:02:09,864 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=53, PETRI_TRANSITIONS=46}
[2023-11-03 13:02:09,864 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 2 predicate places.
[2023-11-03 13:02:09,865 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 146 flow
[2023-11-03 13:02:09,865 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:09,865 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:09,865 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:09,865 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:02:09,865 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:09,866 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:09,866 INFO  L85        PathProgramCache]: Analyzing trace with hash 1106516575, now seen corresponding path program 1 times
[2023-11-03 13:02:09,866 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:09,866 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780034982]
[2023-11-03 13:02:09,866 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:09,866 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:09,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:09,886 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:09,886 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:09,886 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780034982]
[2023-11-03 13:02:09,886 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780034982] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:09,886 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:09,886 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:09,886 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478739128]
[2023-11-03 13:02:09,887 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:09,887 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:09,887 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:09,887 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:09,887 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:09,908 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:09,908 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 146 flow. Second operand  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:09,908 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:09,908 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:09,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:14,713 INFO  L130       PetriNetUnfolder]: 60474/86524 cut-off events.
[2023-11-03 13:02:14,714 INFO  L131       PetriNetUnfolder]: For 12171/12171 co-relation queries the response was YES.
[2023-11-03 13:02:14,837 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 175776 conditions, 86524 events. 60474/86524 cut-off events. For 12171/12171 co-relation queries the response was YES. Maximal size of possible extension queue 2442. Compared 607233 event pairs, 42366 based on Foata normal form. 0/80211 useless extension candidates. Maximal degree in co-relation 175724. Up to 63347 conditions per place. 
[2023-11-03 13:02:15,097 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 60 selfloop transitions, 7 changer transitions 0/76 dead transitions.
[2023-11-03 13:02:15,098 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 377 flow
[2023-11-03 13:02:15,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:15,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:15,099 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2023-11-03 13:02:15,099 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2023-11-03 13:02:15,099 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2023-11-03 13:02:15,099 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2023-11-03 13:02:15,100 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:15,100 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2023-11-03 13:02:15,100 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:15,101 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:15,101 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:15,101 INFO  L175             Difference]: Start difference. First operand has 53 places, 46 transitions, 146 flow. Second operand 3 states and 360 transitions.
[2023-11-03 13:02:15,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 377 flow
[2023-11-03 13:02:15,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:15,105 INFO  L231             Difference]: Finished difference. Result has 56 places, 52 transitions, 198 flow
[2023-11-03 13:02:15,105 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=56, PETRI_TRANSITIONS=52}
[2023-11-03 13:02:15,105 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 5 predicate places.
[2023-11-03 13:02:15,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 198 flow
[2023-11-03 13:02:15,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:15,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:15,106 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:15,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 13:02:15,106 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:15,106 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:15,106 INFO  L85        PathProgramCache]: Analyzing trace with hash -212253915, now seen corresponding path program 1 times
[2023-11-03 13:02:15,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:15,106 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192763660]
[2023-11-03 13:02:15,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:15,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:15,111 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:15,140 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:15,140 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:15,141 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192763660]
[2023-11-03 13:02:15,141 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192763660] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:15,141 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:15,141 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:02:15,141 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291949926]
[2023-11-03 13:02:15,141 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:15,142 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-03 13:02:15,142 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:15,142 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-03 13:02:15,142 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-03 13:02:15,172 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 102 out of 192
[2023-11-03 13:02:15,173 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 198 flow. Second operand  has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:15,173 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:15,173 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 192
[2023-11-03 13:02:15,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:18,306 INFO  L130       PetriNetUnfolder]: 38334/57310 cut-off events.
[2023-11-03 13:02:18,307 INFO  L131       PetriNetUnfolder]: For 26058/31476 co-relation queries the response was YES.
[2023-11-03 13:02:18,402 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 133333 conditions, 57310 events. 38334/57310 cut-off events. For 26058/31476 co-relation queries the response was YES. Maximal size of possible extension queue 1672. Compared 426369 event pairs, 21787 based on Foata normal form. 3440/57900 useless extension candidates. Maximal degree in co-relation 40685. Up to 34292 conditions per place. 
[2023-11-03 13:02:18,602 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions.
[2023-11-03 13:02:18,602 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 408 flow
[2023-11-03 13:02:18,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-03 13:02:18,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-03 13:02:18,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions.
[2023-11-03 13:02:18,605 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.60546875
[2023-11-03 13:02:18,605 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 465 transitions.
[2023-11-03 13:02:18,605 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 465 transitions.
[2023-11-03 13:02:18,605 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:18,605 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 465 transitions.
[2023-11-03 13:02:18,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:18,607 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:18,607 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:18,607 INFO  L175             Difference]: Start difference. First operand has 56 places, 52 transitions, 198 flow. Second operand 4 states and 465 transitions.
[2023-11-03 13:02:18,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 408 flow
[2023-11-03 13:02:18,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:18,665 INFO  L231             Difference]: Finished difference. Result has 58 places, 53 transitions, 200 flow
[2023-11-03 13:02:18,666 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=58, PETRI_TRANSITIONS=53}
[2023-11-03 13:02:18,666 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places.
[2023-11-03 13:02:18,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 200 flow
[2023-11-03 13:02:18,666 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:18,667 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:18,667 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:18,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 13:02:18,667 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:18,667 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:18,667 INFO  L85        PathProgramCache]: Analyzing trace with hash -331384400, now seen corresponding path program 1 times
[2023-11-03 13:02:18,667 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:18,667 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962724648]
[2023-11-03 13:02:18,667 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:18,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:18,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:18,688 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:02:18,688 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:18,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962724648]
[2023-11-03 13:02:18,689 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962724648] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:18,689 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:18,689 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:18,689 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240848775]
[2023-11-03 13:02:18,689 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:18,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:18,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:18,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:18,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:18,715 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:18,716 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 200 flow. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:18,716 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:18,716 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:18,716 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:23,960 INFO  L130       PetriNetUnfolder]: 57579/84704 cut-off events.
[2023-11-03 13:02:23,960 INFO  L131       PetriNetUnfolder]: For 41510/43076 co-relation queries the response was YES.
[2023-11-03 13:02:24,080 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 200941 conditions, 84704 events. 57579/84704 cut-off events. For 41510/43076 co-relation queries the response was YES. Maximal size of possible extension queue 2210. Compared 616654 event pairs, 43300 based on Foata normal form. 13/80715 useless extension candidates. Maximal degree in co-relation 77115. Up to 69982 conditions per place. 
[2023-11-03 13:02:24,334 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 64 selfloop transitions, 10 changer transitions 0/84 dead transitions.
[2023-11-03 13:02:24,334 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 84 transitions, 466 flow
[2023-11-03 13:02:24,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:24,335 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:24,336 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions.
[2023-11-03 13:02:24,336 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6215277777777778
[2023-11-03 13:02:24,336 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 358 transitions.
[2023-11-03 13:02:24,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 358 transitions.
[2023-11-03 13:02:24,336 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:24,336 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 358 transitions.
[2023-11-03 13:02:24,337 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:24,338 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:24,338 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:24,338 INFO  L175             Difference]: Start difference. First operand has 58 places, 53 transitions, 200 flow. Second operand 3 states and 358 transitions.
[2023-11-03 13:02:24,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 84 transitions, 466 flow
[2023-11-03 13:02:24,548 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 84 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:24,549 INFO  L231             Difference]: Finished difference. Result has 59 places, 61 transitions, 278 flow
[2023-11-03 13:02:24,549 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=278, PETRI_PLACES=59, PETRI_TRANSITIONS=61}
[2023-11-03 13:02:24,549 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2023-11-03 13:02:24,550 INFO  L495      AbstractCegarLoop]: Abstraction has has 59 places, 61 transitions, 278 flow
[2023-11-03 13:02:24,550 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:24,550 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:24,550 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:24,550 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-11-03 13:02:24,550 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:24,550 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:24,550 INFO  L85        PathProgramCache]: Analyzing trace with hash -1115597400, now seen corresponding path program 1 times
[2023-11-03 13:02:24,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:24,551 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845156904]
[2023-11-03 13:02:24,551 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:24,551 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:24,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:24,592 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:24,592 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:24,593 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845156904]
[2023-11-03 13:02:24,593 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845156904] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:24,593 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:24,593 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:02:24,593 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31194014]
[2023-11-03 13:02:24,593 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:24,594 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:24,594 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:24,595 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:24,595 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:24,616 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:24,617 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 61 transitions, 278 flow. Second operand  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:24,617 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:24,617 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:24,617 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:25,092 INFO  L130       PetriNetUnfolder]: 2527/6028 cut-off events.
[2023-11-03 13:02:25,092 INFO  L131       PetriNetUnfolder]: For 4664/4747 co-relation queries the response was YES.
[2023-11-03 13:02:25,102 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15416 conditions, 6028 events. 2527/6028 cut-off events. For 4664/4747 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 53051 event pairs, 222 based on Foata normal form. 1888/7602 useless extension candidates. Maximal degree in co-relation 5671. Up to 3800 conditions per place. 
[2023-11-03 13:02:25,114 INFO  L137   encePairwiseOnDemand]: 184/192 looper letters, 43 selfloop transitions, 9 changer transitions 0/66 dead transitions.
[2023-11-03 13:02:25,114 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 394 flow
[2023-11-03 13:02:25,115 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:25,115 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:25,116 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions.
[2023-11-03 13:02:25,116 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5954861111111112
[2023-11-03 13:02:25,116 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 343 transitions.
[2023-11-03 13:02:25,116 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions.
[2023-11-03 13:02:25,116 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:25,117 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions.
[2023-11-03 13:02:25,117 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,118 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,118 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,118 INFO  L175             Difference]: Start difference. First operand has 59 places, 61 transitions, 278 flow. Second operand 3 states and 343 transitions.
[2023-11-03 13:02:25,118 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 394 flow
[2023-11-03 13:02:25,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 66 transitions, 387 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:25,129 INFO  L231             Difference]: Finished difference. Result has 60 places, 52 transitions, 226 flow
[2023-11-03 13:02:25,129 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=60, PETRI_TRANSITIONS=52}
[2023-11-03 13:02:25,130 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places.
[2023-11-03 13:02:25,130 INFO  L495      AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 226 flow
[2023-11-03 13:02:25,130 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,130 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:25,130 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:25,130 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:02:25,131 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:25,131 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:25,131 INFO  L85        PathProgramCache]: Analyzing trace with hash 1876298133, now seen corresponding path program 1 times
[2023-11-03 13:02:25,131 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:25,131 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301040148]
[2023-11-03 13:02:25,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:25,131 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:25,139 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:25,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-11-03 13:02:25,153 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:25,153 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301040148]
[2023-11-03 13:02:25,153 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301040148] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:25,153 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:25,153 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:25,153 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348942906]
[2023-11-03 13:02:25,154 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:25,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:25,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:25,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:25,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:25,193 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:25,194 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 226 flow. Second operand  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,194 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:25,194 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:25,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:25,725 INFO  L130       PetriNetUnfolder]: 3015/7284 cut-off events.
[2023-11-03 13:02:25,725 INFO  L131       PetriNetUnfolder]: For 6022/6152 co-relation queries the response was YES.
[2023-11-03 13:02:25,738 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19234 conditions, 7284 events. 3015/7284 cut-off events. For 6022/6152 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 63661 event pairs, 2646 based on Foata normal form. 0/6889 useless extension candidates. Maximal degree in co-relation 4922. Up to 5565 conditions per place. 
[2023-11-03 13:02:25,755 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 50 selfloop transitions, 3 changer transitions 0/63 dead transitions.
[2023-11-03 13:02:25,756 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 384 flow
[2023-11-03 13:02:25,756 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:25,756 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:25,757 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions.
[2023-11-03 13:02:25,757 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.59375
[2023-11-03 13:02:25,757 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 342 transitions.
[2023-11-03 13:02:25,757 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 342 transitions.
[2023-11-03 13:02:25,757 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:25,757 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 342 transitions.
[2023-11-03 13:02:25,758 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,759 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,759 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,759 INFO  L175             Difference]: Start difference. First operand has 60 places, 52 transitions, 226 flow. Second operand 3 states and 342 transitions.
[2023-11-03 13:02:25,759 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 384 flow
[2023-11-03 13:02:25,766 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 63 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:25,767 INFO  L231             Difference]: Finished difference. Result has 62 places, 54 transitions, 242 flow
[2023-11-03 13:02:25,767 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=62, PETRI_TRANSITIONS=54}
[2023-11-03 13:02:25,767 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places.
[2023-11-03 13:02:25,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 242 flow
[2023-11-03 13:02:25,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,767 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:25,768 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:25,768 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-03 13:02:25,768 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:25,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:25,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -80043298, now seen corresponding path program 1 times
[2023-11-03 13:02:25,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:25,768 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042248568]
[2023-11-03 13:02:25,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:25,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:25,779 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:25,800 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2023-11-03 13:02:25,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:25,800 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042248568]
[2023-11-03 13:02:25,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042248568] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:25,800 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:25,800 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:25,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468927357]
[2023-11-03 13:02:25,801 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:25,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:25,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:25,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:25,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:25,827 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 192
[2023-11-03 13:02:25,827 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 242 flow. Second operand  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:25,827 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:25,827 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 192
[2023-11-03 13:02:25,827 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:26,645 INFO  L130       PetriNetUnfolder]: 4287/9592 cut-off events.
[2023-11-03 13:02:26,645 INFO  L131       PetriNetUnfolder]: For 8855/8972 co-relation queries the response was YES.
[2023-11-03 13:02:26,662 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26109 conditions, 9592 events. 4287/9592 cut-off events. For 8855/8972 co-relation queries the response was YES. Maximal size of possible extension queue 379. Compared 82167 event pairs, 2429 based on Foata normal form. 0/9269 useless extension candidates. Maximal degree in co-relation 9272. Up to 6045 conditions per place. 
[2023-11-03 13:02:26,681 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 58 selfloop transitions, 9 changer transitions 0/76 dead transitions.
[2023-11-03 13:02:26,681 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 76 transitions, 456 flow
[2023-11-03 13:02:26,682 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:26,682 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:26,683 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions.
[2023-11-03 13:02:26,683 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.625
[2023-11-03 13:02:26,683 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 360 transitions.
[2023-11-03 13:02:26,683 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions.
[2023-11-03 13:02:26,683 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:26,683 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions.
[2023-11-03 13:02:26,684 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:26,685 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:26,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:26,685 INFO  L175             Difference]: Start difference. First operand has 62 places, 54 transitions, 242 flow. Second operand 3 states and 360 transitions.
[2023-11-03 13:02:26,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 76 transitions, 456 flow
[2023-11-03 13:02:26,694 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 447 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:26,695 INFO  L231             Difference]: Finished difference. Result has 65 places, 59 transitions, 311 flow
[2023-11-03 13:02:26,696 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=65, PETRI_TRANSITIONS=59}
[2023-11-03 13:02:26,696 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places.
[2023-11-03 13:02:26,696 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 311 flow
[2023-11-03 13:02:26,696 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:26,696 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:26,696 INFO  L209   CegarLoopForPetriNet]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:26,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-11-03 13:02:26,697 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:26,697 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:26,697 INFO  L85        PathProgramCache]: Analyzing trace with hash -578804479, now seen corresponding path program 1 times
[2023-11-03 13:02:26,697 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:26,697 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046651034]
[2023-11-03 13:02:26,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:26,698 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:26,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:26,776 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:26,777 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:26,777 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046651034]
[2023-11-03 13:02:26,777 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046651034] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:02:26,777 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550935185]
[2023-11-03 13:02:26,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:26,777 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:26,778 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:02:26,779 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:02:26,782 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 13:02:26,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:26,866 INFO  L263         TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core
[2023-11-03 13:02:26,868 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:02:27,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:27,064 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:02:27,064 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [550935185] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:27,064 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-11-03 13:02:27,064 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 11
[2023-11-03 13:02:27,064 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902475795]
[2023-11-03 13:02:27,064 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:27,064 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-03 13:02:27,065 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:27,065 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-03 13:02:27,065 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132
[2023-11-03 13:02:27,107 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192
[2023-11-03 13:02:27,108 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 311 flow. Second operand  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:27,108 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:27,108 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192
[2023-11-03 13:02:27,108 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:28,061 INFO  L130       PetriNetUnfolder]: 3360/8640 cut-off events.
[2023-11-03 13:02:28,061 INFO  L131       PetriNetUnfolder]: For 11492/12199 co-relation queries the response was YES.
[2023-11-03 13:02:28,086 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24433 conditions, 8640 events. 3360/8640 cut-off events. For 11492/12199 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 79798 event pairs, 496 based on Foata normal form. 482/8986 useless extension candidates. Maximal degree in co-relation 10397. Up to 4963 conditions per place. 
[2023-11-03 13:02:28,104 INFO  L137   encePairwiseOnDemand]: 189/192 looper letters, 104 selfloop transitions, 5 changer transitions 8/134 dead transitions.
[2023-11-03 13:02:28,104 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 865 flow
[2023-11-03 13:02:28,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-03 13:02:28,105 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-03 13:02:28,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 819 transitions.
[2023-11-03 13:02:28,107 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.609375
[2023-11-03 13:02:28,107 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 819 transitions.
[2023-11-03 13:02:28,107 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 819 transitions.
[2023-11-03 13:02:28,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:28,107 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 819 transitions.
[2023-11-03 13:02:28,109 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 117.0) internal successors, (819), 7 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:28,110 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:28,111 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 192.0) internal successors, (1536), 8 states have internal predecessors, (1536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:28,111 INFO  L175             Difference]: Start difference. First operand has 65 places, 59 transitions, 311 flow. Second operand 7 states and 819 transitions.
[2023-11-03 13:02:28,111 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 865 flow
[2023-11-03 13:02:28,188 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 827 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-03 13:02:28,189 INFO  L231             Difference]: Finished difference. Result has 67 places, 60 transitions, 300 flow
[2023-11-03 13:02:28,189 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=300, PETRI_PLACES=67, PETRI_TRANSITIONS=60}
[2023-11-03 13:02:28,190 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 16 predicate places.
[2023-11-03 13:02:28,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 300 flow
[2023-11-03 13:02:28,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 105.0) internal successors, (735), 7 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:28,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:28,190 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:28,201 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-11-03 13:02:28,391 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2023-11-03 13:02:28,392 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:28,393 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:28,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -573613133, now seen corresponding path program 1 times
[2023-11-03 13:02:28,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:28,393 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55040578]
[2023-11-03 13:02:28,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:28,394 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:28,412 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:28,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked.
[2023-11-03 13:02:28,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:28,428 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55040578]
[2023-11-03 13:02:28,428 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55040578] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:02:28,428 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:02:28,428 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:02:28,428 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748425529]
[2023-11-03 13:02:28,428 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:02:28,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:02:28,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:28,429 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:02:28,429 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:02:28,457 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:28,457 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:28,457 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:28,457 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:28,457 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:29,273 INFO  L130       PetriNetUnfolder]: 3905/9449 cut-off events.
[2023-11-03 13:02:29,273 INFO  L131       PetriNetUnfolder]: For 12716/12924 co-relation queries the response was YES.
[2023-11-03 13:02:29,295 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27511 conditions, 9449 events. 3905/9449 cut-off events. For 12716/12924 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 86695 event pairs, 2981 based on Foata normal form. 0/9159 useless extension candidates. Maximal degree in co-relation 5967. Up to 7702 conditions per place. 
[2023-11-03 13:02:29,314 INFO  L137   encePairwiseOnDemand]: 188/192 looper letters, 54 selfloop transitions, 4 changer transitions 1/69 dead transitions.
[2023-11-03 13:02:29,314 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 464 flow
[2023-11-03 13:02:29,315 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:02:29,315 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:02:29,317 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 340 transitions.
[2023-11-03 13:02:29,317 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5902777777777778
[2023-11-03 13:02:29,318 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 340 transitions.
[2023-11-03 13:02:29,318 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 340 transitions.
[2023-11-03 13:02:29,318 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:29,319 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 340 transitions.
[2023-11-03 13:02:29,320 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:29,321 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:29,322 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 192.0) internal successors, (768), 4 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:29,322 INFO  L175             Difference]: Start difference. First operand has 67 places, 60 transitions, 300 flow. Second operand 3 states and 340 transitions.
[2023-11-03 13:02:29,322 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 464 flow
[2023-11-03 13:02:29,332 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 69 transitions, 461 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:02:29,333 INFO  L231             Difference]: Finished difference. Result has 68 places, 62 transitions, 329 flow
[2023-11-03 13:02:29,333 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=68, PETRI_TRANSITIONS=62}
[2023-11-03 13:02:29,333 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places.
[2023-11-03 13:02:29,333 INFO  L495      AbstractCegarLoop]: Abstraction has has 68 places, 62 transitions, 329 flow
[2023-11-03 13:02:29,333 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:29,334 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:29,334 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:29,334 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 13:02:29,334 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:29,334 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:29,334 INFO  L85        PathProgramCache]: Analyzing trace with hash -1073911570, now seen corresponding path program 1 times
[2023-11-03 13:02:29,334 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:29,334 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254162339]
[2023-11-03 13:02:29,334 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:29,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:29,346 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:29,403 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked.
[2023-11-03 13:02:29,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:29,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254162339]
[2023-11-03 13:02:29,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254162339] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:02:29,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306876573]
[2023-11-03 13:02:29,404 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:29,405 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:29,405 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:02:29,406 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:02:29,408 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 13:02:29,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:29,494 INFO  L263         TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core
[2023-11-03 13:02:29,495 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:02:29,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:29,608 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:02:29,671 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-11-03 13:02:29,671 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [306876573] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:02:29,671 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:02:29,671 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10
[2023-11-03 13:02:29,672 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331572936]
[2023-11-03 13:02:29,672 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:02:29,672 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-03 13:02:29,673 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:29,673 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-03 13:02:29,673 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110
[2023-11-03 13:02:29,751 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 98 out of 192
[2023-11-03 13:02:29,752 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 62 transitions, 329 flow. Second operand  has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:29,752 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:29,752 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 192
[2023-11-03 13:02:29,752 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:30,454 INFO  L130       PetriNetUnfolder]: 2229/5093 cut-off events.
[2023-11-03 13:02:30,454 INFO  L131       PetriNetUnfolder]: For 7932/8466 co-relation queries the response was YES.
[2023-11-03 13:02:30,462 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14371 conditions, 5093 events. 2229/5093 cut-off events. For 7932/8466 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 38021 event pairs, 94 based on Foata normal form. 586/5594 useless extension candidates. Maximal degree in co-relation 5145. Up to 1849 conditions per place. 
[2023-11-03 13:02:30,469 INFO  L137   encePairwiseOnDemand]: 187/192 looper letters, 128 selfloop transitions, 8 changer transitions 0/151 dead transitions.
[2023-11-03 13:02:30,469 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 151 transitions, 921 flow
[2023-11-03 13:02:30,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-03 13:02:30,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-03 13:02:30,471 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1012 transitions.
[2023-11-03 13:02:30,471 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5856481481481481
[2023-11-03 13:02:30,471 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1012 transitions.
[2023-11-03 13:02:30,472 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1012 transitions.
[2023-11-03 13:02:30,472 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:30,472 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1012 transitions.
[2023-11-03 13:02:30,474 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 112.44444444444444) internal successors, (1012), 9 states have internal predecessors, (1012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:30,476 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:30,476 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 192.0) internal successors, (1920), 10 states have internal predecessors, (1920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:30,476 INFO  L175             Difference]: Start difference. First operand has 68 places, 62 transitions, 329 flow. Second operand 9 states and 1012 transitions.
[2023-11-03 13:02:30,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 151 transitions, 921 flow
[2023-11-03 13:02:30,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 151 transitions, 899 flow, removed 6 selfloop flow, removed 1 redundant places.
[2023-11-03 13:02:30,484 INFO  L231             Difference]: Finished difference. Result has 76 places, 63 transitions, 347 flow
[2023-11-03 13:02:30,484 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=347, PETRI_PLACES=76, PETRI_TRANSITIONS=63}
[2023-11-03 13:02:30,485 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 25 predicate places.
[2023-11-03 13:02:30,485 INFO  L495      AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 347 flow
[2023-11-03 13:02:30,485 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 102.0) internal successors, (1122), 11 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:30,485 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:30,485 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:30,492 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 13:02:30,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:30,687 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:30,688 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:30,688 INFO  L85        PathProgramCache]: Analyzing trace with hash 331255352, now seen corresponding path program 1 times
[2023-11-03 13:02:30,688 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:30,689 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901063738]
[2023-11-03 13:02:30,689 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:30,689 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:30,720 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:31,516 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:31,517 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:31,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901063738]
[2023-11-03 13:02:31,517 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901063738] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:02:31,517 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708693261]
[2023-11-03 13:02:31,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:31,517 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:31,517 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:02:31,519 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:02:31,520 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 13:02:31,626 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:31,628 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 31 conjunts are in the unsatisfiable core
[2023-11-03 13:02:31,631 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:02:31,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13
[2023-11-03 13:02:32,015 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 13:02:32,016 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37
[2023-11-03 13:02:32,155 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-11-03 13:02:32,197 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:32,197 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:02:33,219 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2023-11-03 13:02:33,229 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 357
[2023-11-03 13:02:33,384 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2023-11-03 13:02:33,397 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164
[2023-11-03 13:02:34,675 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:34,675 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708693261] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:02:34,675 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:02:34,676 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 31
[2023-11-03 13:02:34,676 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677185035]
[2023-11-03 13:02:34,676 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:02:34,677 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2023-11-03 13:02:34,677 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:34,677 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2023-11-03 13:02:34,677 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=879, Unknown=0, NotChecked=0, Total=992
[2023-11-03 13:02:39,207 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2023-11-03 13:02:39,210 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 347 flow. Second operand  has 32 states, 32 states have (on average 95.96875) internal successors, (3071), 32 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:39,210 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:39,210 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2023-11-03 13:02:39,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:42,218 INFO  L130       PetriNetUnfolder]: 2703/5719 cut-off events.
[2023-11-03 13:02:42,218 INFO  L131       PetriNetUnfolder]: For 6879/7328 co-relation queries the response was YES.
[2023-11-03 13:02:42,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16959 conditions, 5719 events. 2703/5719 cut-off events. For 6879/7328 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 40755 event pairs, 454 based on Foata normal form. 407/6058 useless extension candidates. Maximal degree in co-relation 7406. Up to 1935 conditions per place. 
[2023-11-03 13:02:42,239 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 152 selfloop transitions, 14 changer transitions 23/202 dead transitions.
[2023-11-03 13:02:42,239 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 202 transitions, 1211 flow
[2023-11-03 13:02:42,240 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-03 13:02:42,240 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-03 13:02:42,242 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1383 transitions.
[2023-11-03 13:02:42,243 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5540865384615384
[2023-11-03 13:02:42,243 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1383 transitions.
[2023-11-03 13:02:42,243 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1383 transitions.
[2023-11-03 13:02:42,243 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:42,243 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1383 transitions.
[2023-11-03 13:02:42,245 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 106.38461538461539) internal successors, (1383), 13 states have internal predecessors, (1383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:42,248 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:42,248 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:42,248 INFO  L175             Difference]: Start difference. First operand has 76 places, 63 transitions, 347 flow. Second operand 13 states and 1383 transitions.
[2023-11-03 13:02:42,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 202 transitions, 1211 flow
[2023-11-03 13:02:42,260 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 202 transitions, 1194 flow, removed 2 selfloop flow, removed 7 redundant places.
[2023-11-03 13:02:42,261 INFO  L231             Difference]: Finished difference. Result has 86 places, 68 transitions, 396 flow
[2023-11-03 13:02:42,261 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=396, PETRI_PLACES=86, PETRI_TRANSITIONS=68}
[2023-11-03 13:02:42,262 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 35 predicate places.
[2023-11-03 13:02:42,262 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 68 transitions, 396 flow
[2023-11-03 13:02:42,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 95.96875) internal successors, (3071), 32 states have internal predecessors, (3071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:42,263 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:42,263 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:42,270 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-11-03 13:02:42,463 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2023-11-03 13:02:42,464 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:42,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:42,464 INFO  L85        PathProgramCache]: Analyzing trace with hash 1880617726, now seen corresponding path program 2 times
[2023-11-03 13:02:42,464 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:42,465 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635461541]
[2023-11-03 13:02:42,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:42,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:42,491 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:02:43,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:43,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:02:43,195 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635461541]
[2023-11-03 13:02:43,195 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635461541] provided 0 perfect and 1 imperfect interpolant sequences
[2023-11-03 13:02:43,195 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068624612]
[2023-11-03 13:02:43,195 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-11-03 13:02:43,196 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:43,196 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:02:43,197 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:02:43,199 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-11-03 13:02:43,303 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-11-03 13:02:43,303 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-11-03 13:02:43,305 INFO  L263         TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 35 conjunts are in the unsatisfiable core
[2023-11-03 13:02:43,307 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:02:43,556 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13
[2023-11-03 13:02:43,666 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-11-03 13:02:43,667 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 37
[2023-11-03 13:02:43,803 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14
[2023-11-03 13:02:43,845 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:43,845 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-11-03 13:02:44,717 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2023-11-03 13:02:44,721 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 164
[2023-11-03 13:02:44,879 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93
[2023-11-03 13:02:44,886 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 357
[2023-11-03 13:02:46,666 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:02:46,666 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068624612] provided 0 perfect and 2 imperfect interpolant sequences
[2023-11-03 13:02:46,666 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-11-03 13:02:46,666 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 34
[2023-11-03 13:02:46,666 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670696613]
[2023-11-03 13:02:46,666 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-11-03 13:02:46,667 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2023-11-03 13:02:46,667 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:02:46,667 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2023-11-03 13:02:46,667 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190
[2023-11-03 13:02:52,735 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 192
[2023-11-03 13:02:52,737 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 68 transitions, 396 flow. Second operand  has 35 states, 35 states have (on average 95.71428571428571) internal successors, (3350), 35 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:52,737 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:02:52,737 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 192
[2023-11-03 13:02:52,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:02:56,524 INFO  L130       PetriNetUnfolder]: 2514/5340 cut-off events.
[2023-11-03 13:02:56,524 INFO  L131       PetriNetUnfolder]: For 7683/8114 co-relation queries the response was YES.
[2023-11-03 13:02:56,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17607 conditions, 5340 events. 2514/5340 cut-off events. For 7683/8114 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 37453 event pairs, 426 based on Foata normal form. 397/5679 useless extension candidates. Maximal degree in co-relation 7983. Up to 1784 conditions per place. 
[2023-11-03 13:02:56,547 INFO  L137   encePairwiseOnDemand]: 181/192 looper letters, 142 selfloop transitions, 15 changer transitions 23/193 dead transitions.
[2023-11-03 13:02:56,547 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 193 transitions, 1211 flow
[2023-11-03 13:02:56,548 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-11-03 13:02:56,548 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2023-11-03 13:02:56,550 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1467 transitions.
[2023-11-03 13:02:56,550 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5457589285714286
[2023-11-03 13:02:56,550 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1467 transitions.
[2023-11-03 13:02:56,550 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1467 transitions.
[2023-11-03 13:02:56,551 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:02:56,551 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1467 transitions.
[2023-11-03 13:02:56,553 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 104.78571428571429) internal successors, (1467), 14 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:56,556 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:56,556 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:56,556 INFO  L175             Difference]: Start difference. First operand has 86 places, 68 transitions, 396 flow. Second operand 14 states and 1467 transitions.
[2023-11-03 13:02:56,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 193 transitions, 1211 flow
[2023-11-03 13:02:56,570 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 193 transitions, 1190 flow, removed 3 selfloop flow, removed 7 redundant places.
[2023-11-03 13:02:56,572 INFO  L231             Difference]: Finished difference. Result has 95 places, 70 transitions, 430 flow
[2023-11-03 13:02:56,572 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=430, PETRI_PLACES=95, PETRI_TRANSITIONS=70}
[2023-11-03 13:02:56,572 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 44 predicate places.
[2023-11-03 13:02:56,572 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 70 transitions, 430 flow
[2023-11-03 13:02:56,573 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 95.71428571428571) internal successors, (3350), 35 states have internal predecessors, (3350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:02:56,573 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:02:56,573 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:56,581 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2023-11-03 13:02:56,774 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:02:56,774 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] ===
[2023-11-03 13:02:56,775 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:02:56,775 INFO  L85        PathProgramCache]: Analyzing trace with hash 995416140, now seen corresponding path program 1 times
[2023-11-03 13:02:56,775 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:02:56,775 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46305187]
[2023-11-03 13:02:56,775 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:02:56,776 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:02:56,796 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:56,796 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:02:56,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:02:56,813 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:02:56,813 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining)
[2023-11-03 13:02:56,814 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining)
[2023-11-03 13:02:56,815 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-11-03 13:02:56,815 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:02:56,819 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances
[2023-11-03 13:02:56,819 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-03 13:02:56,873 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 01:02:56 BasicIcfg
[2023-11-03 13:02:56,874 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-03 13:02:56,874 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2023-11-03 13:02:56,874 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2023-11-03 13:02:56,874 INFO  L275        PluginConnector]: Witness Printer initialized
[2023-11-03 13:02:56,875 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:01:58" (3/4) ...
[2023-11-03 13:02:56,878 INFO  L140         WitnessPrinter]: No result that supports witness generation found
[2023-11-03 13:02:56,878 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2023-11-03 13:02:56,879 INFO  L158              Benchmark]: Toolchain (without parser) took 58950.94ms. Allocated memory was 251.7MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 205.7MB in the beginning and 3.8GB in the end (delta: -3.6GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,879 INFO  L158              Benchmark]: CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 13:02:56,879 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 302.68ms. Allocated memory is still 251.7MB. Free memory was 204.8MB in the beginning and 186.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,880 INFO  L158              Benchmark]: Boogie Procedure Inliner took 33.55ms. Allocated memory is still 251.7MB. Free memory was 186.8MB in the beginning and 184.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,880 INFO  L158              Benchmark]: Boogie Preprocessor took 22.97ms. Allocated memory is still 251.7MB. Free memory was 184.6MB in the beginning and 182.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,880 INFO  L158              Benchmark]: RCFGBuilder took 343.47ms. Allocated memory is still 251.7MB. Free memory was 182.6MB in the beginning and 170.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,881 INFO  L158              Benchmark]: TraceAbstraction took 58238.79ms. Allocated memory was 251.7MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 170.0MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB.
[2023-11-03 13:02:56,881 INFO  L158              Benchmark]: Witness Printer took 3.77ms. Allocated memory is still 6.0GB. Free memory is still 3.8GB. There was no memory consumed. Max. memory is 16.1GB.
[2023-11-03 13:02:56,883 INFO  L339   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.13ms. Allocated memory is still 125.8MB. Free memory is still 73.6MB. There was no memory consumed. Max. memory is 16.1GB.
 * CACSL2BoogieTranslator took 302.68ms. Allocated memory is still 251.7MB. Free memory was 204.8MB in the beginning and 186.8MB in the end (delta: 18.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB.
 * Boogie Procedure Inliner took 33.55ms. Allocated memory is still 251.7MB. Free memory was 186.8MB in the beginning and 184.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * Boogie Preprocessor took 22.97ms. Allocated memory is still 251.7MB. Free memory was 184.6MB in the beginning and 182.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
 * RCFGBuilder took 343.47ms. Allocated memory is still 251.7MB. Free memory was 182.6MB in the beginning and 170.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
 * TraceAbstraction took 58238.79ms. Allocated memory was 251.7MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 170.0MB in the beginning and 3.8GB in the end (delta: -3.7GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB.
 * Witness Printer took 3.77ms. Allocated memory is still 6.0GB. Free memory is still 3.8GB. There was no memory consumed. Max. memory is 16.1GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.5s, 69 PlacesBefore, 20 PlacesAfterwards, 69 TransitionsBefore, 18 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 5 FixpointIterations, 19 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 54 TotalNumberOfCompositions, 1515 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 942, independent: 870, independent conditional: 0, independent unconditional: 870, dependent: 72, dependent conditional: 0, dependent unconditional: 72, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 464, independent: 450, independent conditional: 0, independent unconditional: 450, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 942, independent: 420, independent conditional: 0, independent unconditional: 420, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 464, unknown conditional: 0, unknown unconditional: 464] , Statistics on independence cache: Total cache size (in pairs): 24, Positive cache size: 18, Positive conditional cache size: 0, Positive unconditional cache size: 18, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.1s, 86 PlacesBefore, 33 PlacesAfterwards, 85 TransitionsBefore, 30 TransitionsAfterwards, 2380 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 58 TotalNumberOfCompositions, 5120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2985, independent: 2845, independent conditional: 0, independent unconditional: 2845, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1224, independent: 1196, independent conditional: 0, independent unconditional: 1196, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2985, independent: 1649, independent conditional: 0, independent unconditional: 1649, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 1224, unknown conditional: 0, unknown unconditional: 1224] , Statistics on independence cache: Total cache size (in pairs): 131, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.3s, 103 PlacesBefore, 42 PlacesAfterwards, 101 TransitionsBefore, 38 TransitionsAfterwards, 4284 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 67 TotalNumberOfCompositions, 10005 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5229, independent: 5030, independent conditional: 0, independent unconditional: 5030, dependent: 199, dependent conditional: 0, dependent unconditional: 199, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2187, independent: 2147, independent conditional: 0, independent unconditional: 2147, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5229, independent: 2883, independent conditional: 0, independent unconditional: 2883, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 2187, unknown conditional: 0, unknown unconditional: 2187] , Statistics on independence cache: Total cache size (in pairs): 238, Positive cache size: 216, Positive conditional cache size: 0, Positive unconditional cache size: 216, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.3s, 120 PlacesBefore, 51 PlacesAfterwards, 117 TransitionsBefore, 46 TransitionsAfterwards, 6664 CoEnabledTransitionPairs, 5 FixpointIterations, 18 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 75 TotalNumberOfCompositions, 16804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7996, independent: 7737, independent conditional: 0, independent unconditional: 7737, dependent: 259, dependent conditional: 0, dependent unconditional: 259, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3271, independent: 3222, independent conditional: 0, independent unconditional: 3222, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7996, independent: 4515, independent conditional: 0, independent unconditional: 4515, dependent: 210, dependent conditional: 0, dependent unconditional: 210, unknown: 3271, unknown conditional: 0, unknown unconditional: 3271] , Statistics on independence cache: Total cache size (in pairs): 350, Positive cache size: 320, Positive conditional cache size: 0, Positive unconditional cache size: 320, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - DataRaceFoundResult [Line: 678]: Data race detected
    Data race detected
The following path leads to a data race: 
[L674]               0  int data = 0;
[L675]               0  pthread_mutex_t data_mutex = { { 0, 0, 0, PTHREAD_MUTEX_TIMED_NP, 0, { { 0, 0 } } } };
[L683]               0  int threads_total = 4;
[L684]               0  pthread_t tids[4];
[L685]               0  int i = 0;
        VAL             [data=0, data_mutex={1:0}, i=0, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [arg={0:0}, data=0, data_mutex={1:0}, i=0, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=17, threads_total=4, tids={5:0}]
[L678]               1  data = __VERIFIER_nondet_int()
        VAL             [__VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L678]               1  data = __VERIFIER_nondet_int()
[L680]               1  return ((void *)0);
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=1, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=18, threads_total=4, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=19, threads_total=4, tids={5:0}]
[L678]               3  data = __VERIFIER_nondet_int()
[L680]               3  return ((void *)0);
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}]
[L685]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, threads_total=4, tids={5:0}]
[L685]  COND TRUE    0  i < threads_total
[L686]  FCALL, FORK  0  pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=3, pthread_create(&tids[i], ((void *)0), &thread, ((void *)0))=20, threads_total=4, tids={5:0}]
[L685]               0  i++
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, threads_total=4, tids={5:0}]
[L685]  COND FALSE   0  !(i < threads_total)
[L688]               0  int i = 0;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=0, i=4, threads_total=4, tids={5:0}]
[L688]  COND TRUE    0  i < threads_total
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={5:0}, tids[i]=17]
[L689]  FCALL, JOIN  1  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=0, threads_total=4, tids={5:0}, tids[i]=17]
[L688]               0  i += 2
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=2, threads_total=4, tids={5:0}]
[L688]  COND TRUE    0  i < threads_total
[L689]  EXPR         0  tids[i]
[L689]               0  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, i=4, threads_total=4, tids={5:0}, tids[i]=19]
[L689]  FCALL, JOIN  3  pthread_join(tids[i], ((void *)0))
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=2, i=4, threads_total=4, tids={5:0}, tids[i]=19]
[L688]               0  i += 2
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data_mutex={1:0}, i=4, i=4, threads_total=4, tids={5:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}]
[L688]  COND FALSE   0  !(i < threads_total)
[L691]               0  return data;
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}, i=4, i=4, threads_total=4, tids={5:0}]
[L678]               2  data = __VERIFIER_nondet_int()
        VAL             [\result={0:0}, __VERIFIER_nondet_int()=0, arg={0:0}, arg={0:0}, data=0, data = __VERIFIER_nondet_int()=27, data_mutex={1:0}]

Now there is a data race on ~data~0 between 
	C: return data; [691]
and
	C: data = __VERIFIER_nondet_int() [678]

  - UnprovableResult [Line: 691]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 689]: Unable to prove that there are no data races
    Unable to prove that there are no data races
 Reason: Not analyzed. 
  - UnprovableResult [Line: 686]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
    Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 3 procedures, 82 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 10 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 10 mSDtfsCounter, 82 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 15 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances
    CFG has 4 procedures, 97 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.8s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 142 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 13 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=130occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 29 NumberOfCodeBlocks, 29 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 39 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances
    CFG has 5 procedures, 112 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 47 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 38 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 88 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances
    CFG has 6 procedures, 127 locations, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.5s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 39.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3216 SdHoareTripleChecker+Valid, 16.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2896 mSDsluCounter, 5548 SdHoareTripleChecker+Invalid, 14.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5500 mSDsCounter, 85 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16678 IncrementalHoareTripleChecker+Invalid, 16763 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 85 mSolverCounterUnsat, 48 mSDtfsCounter, 16678 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 182 SyntacticMatches, 6 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 835 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=430occurred in iteration=12, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 385 NumberOfCodeBlocks, 385 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 431 ConstructedInterpolants, 13 QuantifiedInterpolants, 10776 SizeOfPredicates, 29 NumberOfNonLiveVariables, 731 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 19 InterpolantComputations, 9 PerfectInterpolantSequences, 116/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-03 13:02:56,958 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---

Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE
