./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-counter-outer-race-4.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-counter-outer-race-4.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 a24b3d43dc71a81d4a287ba8ab30168c3aa4c6a251c7cdda28c4ba2f9190b483
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-11 23:18:24,477 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-11 23:18:24,479 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-11 23:18:24,502 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-11 23:18:24,502 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-11 23:18:24,503 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-11 23:18:24,505 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-11 23:18:24,506 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-11 23:18:24,507 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-11 23:18:24,508 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-11 23:18:24,509 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-11 23:18:24,509 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-11 23:18:24,510 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-11 23:18:24,510 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-11 23:18:24,511 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-11 23:18:24,512 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-11 23:18:24,513 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-11 23:18:24,513 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-11 23:18:24,515 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-11 23:18:24,516 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-11 23:18:24,517 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-11 23:18:24,518 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-11 23:18:24,519 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-11 23:18:24,519 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-11 23:18:24,522 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-11 23:18:24,522 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-11 23:18:24,523 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-11 23:18:24,523 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-11 23:18:24,524 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-11 23:18:24,525 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-11 23:18:24,525 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-11 23:18:24,526 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-11 23:18:24,526 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-11 23:18:24,527 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-11 23:18:24,528 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-11 23:18:24,528 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-11 23:18:24,528 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-11 23:18:24,529 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-11 23:18:24,529 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-11 23:18:24,529 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-11 23:18:24,530 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-11 23:18:24,531 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-11 23:18:24,546 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-11 23:18:24,546 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-11 23:18:24,547 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-11 23:18:24,547 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-11 23:18:24,547 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-11 23:18:24,547 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-11 23:18:24,548 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-11 23:18:24,548 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-11 23:18:24,548 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-11 23:18:24,548 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-11 23:18:24,548 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-11 23:18:24,548 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-11 23:18:24,549 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-11 23:18:24,550 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:18:24,550 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-11 23:18:24,550 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-11 23:18:24,551 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-11 23:18:24,552 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 -> a24b3d43dc71a81d4a287ba8ab30168c3aa4c6a251c7cdda28c4ba2f9190b483
[2024-03-11 23:18:24,714 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-11 23:18:24,736 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-11 23:18:24,738 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-11 23:18:24,739 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-11 23:18:24,741 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-11 23:18:24,742 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2024-03-11 23:18:25,895 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-11 23:18:26,061 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-11 23:18:26,061 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2024-03-11 23:18:26,069 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/70a6aeed5/72f66092e4e2404e8d216737d5fb1484/FLAG987b86ee5
[2024-03-11 23:18:26,080 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/70a6aeed5/72f66092e4e2404e8d216737d5fb1484
[2024-03-11 23:18:26,082 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-11 23:18:26,083 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-11 23:18:26,084 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-11 23:18:26,084 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-11 23:18:26,087 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-11 23:18:26,087 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,088 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18c54d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26, skipping insertion in model container
[2024-03-11 23:18:26,088 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,093 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-11 23:18:26,118 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-11 23:18:26,315 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2024-03-11 23:18:26,317 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:18:26,329 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-11 23:18:26,354 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2024-03-11 23:18:26,356 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-11 23:18:26,381 INFO  L208         MainTranslator]: Completed translation
[2024-03-11 23:18:26,382 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26 WrapperNode
[2024-03-11 23:18:26,382 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-11 23:18:26,383 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-11 23:18:26,383 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-11 23:18:26,383 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-11 23:18:26,388 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,398 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,415 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2024-03-11 23:18:26,415 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-11 23:18:26,416 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-11 23:18:26,416 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-11 23:18:26,416 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-11 23:18:26,435 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,435 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,440 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,441 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,446 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,449 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,450 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,451 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,453 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-11 23:18:26,454 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-11 23:18:26,454 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-11 23:18:26,454 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-11 23:18:26,455 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (1/1) ...
[2024-03-11 23:18:26,469 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-11 23:18:26,480 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:18:26,495 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)
[2024-03-11 23:18:26,498 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
[2024-03-11 23:18:26,542 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-11 23:18:26,542 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-11 23:18:26,543 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-11 23:18:26,543 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-11 23:18:26,543 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-11 23:18:26,544 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-11 23:18:26,544 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2024-03-11 23:18:26,544 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-11 23:18:26,544 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-11 23:18:26,544 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-11 23:18:26,544 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-11 23:18:26,544 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-11 23:18:26,545 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-11 23:18:26,666 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-11 23:18:26,668 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-11 23:18:26,843 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-11 23:18:26,850 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-11 23:18:26,850 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-11 23:18:26,852 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:18:26 BoogieIcfgContainer
[2024-03-11 23:18:26,852 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-11 23:18:26,854 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-11 23:18:26,854 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-11 23:18:26,856 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-11 23:18:26,856 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.03 11:18:26" (1/3) ...
[2024-03-11 23:18:26,857 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405a052e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:18:26, skipping insertion in model container
[2024-03-11 23:18:26,857 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.03 11:18:26" (2/3) ...
[2024-03-11 23:18:26,857 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@405a052e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.03 11:18:26, skipping insertion in model container
[2024-03-11 23:18:26,857 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.03 11:18:26" (3/3) ...
[2024-03-11 23:18:26,858 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2024-03-11 23:18:26,864 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-11 23:18:26,871 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-11 23:18:26,871 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2024-03-11 23:18:26,871 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-11 23:18:26,911 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-11 23:18:26,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:26,988 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2024-03-11 23:18:26,988 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:26,992 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2024-03-11 23:18:26,992 INFO  L82        GeneralOperation]: Start removeDead. Operand has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:26,996 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:26,998 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:18:27,005 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:27,007 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:27,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2024-03-11 23:18:27,034 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2024-03-11 23:18:27,035 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:27,035 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 179 conditions, 174 events. 7/174 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. 
[2024-03-11 23:18:27,037 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3068
[2024-03-11 23:18:30,075 INFO  L134        LiptonReduction]: Checked pairs total: 11184
[2024-03-11 23:18:30,075 INFO  L136        LiptonReduction]: Total number of compositions: 98
[2024-03-11 23:18:30,086 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:18:30,091 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;@3b31b2e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:18:30,092 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2024-03-11 23:18:30,093 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2024-03-11 23:18:30,094 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:30,094 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:30,094 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:18:30,094 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-11 23:18:30,098 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:30,098 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631503, now seen corresponding path program 1 times
[2024-03-11 23:18:30,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:30,105 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336628530]
[2024-03-11 23:18:30,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:30,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:30,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:30,259 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:30,259 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:30,259 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336628530]
[2024-03-11 23:18:30,260 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336628530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:30,260 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:30,260 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:30,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663715492]
[2024-03-11 23:18:30,262 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:30,267 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:30,267 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:30,282 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:30,284 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:30,316 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 232
[2024-03-11 23:18:30,319 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 93 flow. Second operand  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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)
[2024-03-11 23:18:30,319 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:30,319 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 232
[2024-03-11 23:18:30,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:30,416 INFO  L130       PetriNetUnfolder]: 134/429 cut-off events.
[2024-03-11 23:18:30,416 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:30,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 743 conditions, 429 events. 134/429 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2288 event pairs, 50 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 689. Up to 159 conditions per place. 
[2024-03-11 23:18:30,420 INFO  L137   encePairwiseOnDemand]: 219/232 looper letters, 39 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2024-03-11 23:18:30,420 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 225 flow
[2024-03-11 23:18:30,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:30,423 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:30,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2024-03-11 23:18:30,431 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5905172413793104
[2024-03-11 23:18:30,432 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2024-03-11 23:18:30,432 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2024-03-11 23:18:30,434 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:30,435 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2024-03-11 23:18:30,439 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 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)
[2024-03-11 23:18:30,444 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,446 INFO  L175             Difference]: Start difference. First operand has 45 places, 44 transitions, 93 flow. Second operand 3 states and 411 transitions.
[2024-03-11 23:18:30,447 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 225 flow
[2024-03-11 23:18:30,448 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:18:30,450 INFO  L231             Difference]: Finished difference. Result has 48 places, 50 transitions, 159 flow
[2024-03-11 23:18:30,452 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=159, PETRI_PLACES=48, PETRI_TRANSITIONS=50}
[2024-03-11 23:18:30,454 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2024-03-11 23:18:30,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 159 flow
[2024-03-11 23:18:30,455 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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)
[2024-03-11 23:18:30,455 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:30,455 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:30,455 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-11 23:18:30,456 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-11 23:18:30,456 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:30,456 INFO  L85        PathProgramCache]: Analyzing trace with hash 750408184, now seen corresponding path program 1 times
[2024-03-11 23:18:30,456 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:30,456 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833323391]
[2024-03-11 23:18:30,456 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:30,457 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:30,471 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:30,502 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:30,503 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:30,503 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833323391]
[2024-03-11 23:18:30,503 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833323391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:30,503 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:30,503 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:30,503 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387666131]
[2024-03-11 23:18:30,503 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:30,504 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:30,504 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:30,505 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:30,505 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:30,514 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 232
[2024-03-11 23:18:30,515 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 50 transitions, 159 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-11 23:18:30,515 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:30,515 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 232
[2024-03-11 23:18:30,515 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:30,583 INFO  L130       PetriNetUnfolder]: 121/425 cut-off events.
[2024-03-11 23:18:30,583 INFO  L131       PetriNetUnfolder]: For 122/125 co-relation queries the response was YES.
[2024-03-11 23:18:30,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 863 conditions, 425 events. 121/425 cut-off events. For 122/125 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2388 event pairs, 64 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 802. Up to 205 conditions per place. 
[2024-03-11 23:18:30,585 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 2/59 dead transitions.
[2024-03-11 23:18:30,585 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 249 flow
[2024-03-11 23:18:30,586 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:30,586 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:30,587 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2024-03-11 23:18:30,588 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5876436781609196
[2024-03-11 23:18:30,588 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2024-03-11 23:18:30,588 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2024-03-11 23:18:30,588 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:30,588 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2024-03-11 23:18:30,590 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 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)
[2024-03-11 23:18:30,591 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,592 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,592 INFO  L175             Difference]: Start difference. First operand has 48 places, 50 transitions, 159 flow. Second operand 3 states and 409 transitions.
[2024-03-11 23:18:30,592 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 249 flow
[2024-03-11 23:18:30,594 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:30,595 INFO  L231             Difference]: Finished difference. Result has 50 places, 52 transitions, 165 flow
[2024-03-11 23:18:30,595 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=165, PETRI_PLACES=50, PETRI_TRANSITIONS=52}
[2024-03-11 23:18:30,595 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places.
[2024-03-11 23:18:30,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 165 flow
[2024-03-11 23:18:30,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-11 23:18:30,596 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:30,596 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:30,596 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-11 23:18:30,596 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-11 23:18:30,597 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:30,597 INFO  L85        PathProgramCache]: Analyzing trace with hash 439345902, now seen corresponding path program 1 times
[2024-03-11 23:18:30,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:30,597 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756342636]
[2024-03-11 23:18:30,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:30,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:30,610 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:30,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:30,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:30,641 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756342636]
[2024-03-11 23:18:30,641 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756342636] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:30,641 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:30,642 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:30,642 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164098196]
[2024-03-11 23:18:30,642 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:30,642 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:30,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:30,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:30,643 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:30,671 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 232
[2024-03-11 23:18:30,672 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 52 transitions, 165 flow. Second operand  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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)
[2024-03-11 23:18:30,672 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:30,672 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 232
[2024-03-11 23:18:30,672 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:30,741 INFO  L130       PetriNetUnfolder]: 120/423 cut-off events.
[2024-03-11 23:18:30,741 INFO  L131       PetriNetUnfolder]: For 82/87 co-relation queries the response was YES.
[2024-03-11 23:18:30,742 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 866 conditions, 423 events. 120/423 cut-off events. For 82/87 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2366 event pairs, 71 based on Foata normal form. 4/390 useless extension candidates. Maximal degree in co-relation 804. Up to 238 conditions per place. 
[2024-03-11 23:18:30,743 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2024-03-11 23:18:30,743 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 267 flow
[2024-03-11 23:18:30,743 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:30,743 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:30,744 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions.
[2024-03-11 23:18:30,744 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5617816091954023
[2024-03-11 23:18:30,744 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 391 transitions.
[2024-03-11 23:18:30,744 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions.
[2024-03-11 23:18:30,745 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:30,745 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions.
[2024-03-11 23:18:30,746 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 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)
[2024-03-11 23:18:30,747 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,748 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,748 INFO  L175             Difference]: Start difference. First operand has 50 places, 52 transitions, 165 flow. Second operand 3 states and 391 transitions.
[2024-03-11 23:18:30,748 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 267 flow
[2024-03-11 23:18:30,749 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:30,750 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 215 flow
[2024-03-11 23:18:30,750 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=215, PETRI_PLACES=52, PETRI_TRANSITIONS=57}
[2024-03-11 23:18:30,750 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2024-03-11 23:18:30,750 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 215 flow
[2024-03-11 23:18:30,751 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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)
[2024-03-11 23:18:30,751 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:30,751 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:30,751 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-11 23:18:30,751 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-11 23:18:30,751 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:30,751 INFO  L85        PathProgramCache]: Analyzing trace with hash 969654521, now seen corresponding path program 1 times
[2024-03-11 23:18:30,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:30,752 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727313932]
[2024-03-11 23:18:30,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:30,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:30,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:30,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:30,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:30,789 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727313932]
[2024-03-11 23:18:30,789 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727313932] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:30,789 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:30,789 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:30,790 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998147250]
[2024-03-11 23:18:30,790 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:30,790 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:30,790 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:30,790 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:30,791 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:30,800 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 232
[2024-03-11 23:18:30,800 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 57 transitions, 215 flow. Second operand  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-11 23:18:30,801 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:30,801 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 232
[2024-03-11 23:18:30,801 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:30,862 INFO  L130       PetriNetUnfolder]: 117/389 cut-off events.
[2024-03-11 23:18:30,862 INFO  L131       PetriNetUnfolder]: For 191/207 co-relation queries the response was YES.
[2024-03-11 23:18:30,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 901 conditions, 389 events. 117/389 cut-off events. For 191/207 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2115 event pairs, 67 based on Foata normal form. 5/358 useless extension candidates. Maximal degree in co-relation 834. Up to 236 conditions per place. 
[2024-03-11 23:18:30,864 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 36 selfloop transitions, 4 changer transitions 0/68 dead transitions.
[2024-03-11 23:18:30,864 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow
[2024-03-11 23:18:30,864 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:30,864 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:30,865 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2024-03-11 23:18:30,865 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5804597701149425
[2024-03-11 23:18:30,865 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2024-03-11 23:18:30,865 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2024-03-11 23:18:30,866 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:30,866 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2024-03-11 23:18:30,867 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 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)
[2024-03-11 23:18:30,868 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,868 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 232.0) internal successors, (928), 4 states have internal predecessors, (928), 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)
[2024-03-11 23:18:30,868 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 215 flow. Second operand 3 states and 404 transitions.
[2024-03-11 23:18:30,869 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow
[2024-03-11 23:18:30,870 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:30,871 INFO  L231             Difference]: Finished difference. Result has 53 places, 59 transitions, 225 flow
[2024-03-11 23:18:30,871 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=232, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=53, PETRI_TRANSITIONS=59}
[2024-03-11 23:18:30,872 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2024-03-11 23:18:30,872 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 225 flow
[2024-03-11 23:18:30,872 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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)
[2024-03-11 23:18:30,872 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:30,873 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:18:30,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-11 23:18:30,873 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2024-03-11 23:18:30,873 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:30,873 INFO  L85        PathProgramCache]: Analyzing trace with hash 598293283, now seen corresponding path program 1 times
[2024-03-11 23:18:30,873 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:30,873 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217675567]
[2024-03-11 23:18:30,873 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:30,874 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:30,902 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:18:30,902 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:18:30,917 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:18:30,936 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:18:30,936 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:18:30,936 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2024-03-11 23:18:30,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2024-03-11 23:18:30,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2024-03-11 23:18:30,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2024-03-11 23:18:30,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2024-03-11 23:18:30,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2024-03-11 23:18:30,939 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2024-03-11 23:18:30,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-11 23:18:30,939 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2024-03-11 23:18:30,941 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:18:30,942 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-11 23:18:30,956 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-11 23:18:30,959 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:30,977 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2024-03-11 23:18:30,978 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-11 23:18:30,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2024-03-11 23:18:30,978 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:30,979 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:30,979 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:18:30,980 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:30,980 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:30,980 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2024-03-11 23:18:31,005 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2024-03-11 23:18:31,005 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2024-03-11 23:18:31,006 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 269 conditions, 259 events. 10/259 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 351 event pairs, 0 based on Foata normal form. 0/226 useless extension candidates. Maximal degree in co-relation 175. Up to 6 conditions per place. 
[2024-03-11 23:18:31,010 INFO  L119        LiptonReduction]: Number of co-enabled transitions 7540
[2024-03-11 23:18:33,891 INFO  L134        LiptonReduction]: Checked pairs total: 34782
[2024-03-11 23:18:33,891 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2024-03-11 23:18:33,893 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:18:33,894 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;@3b31b2e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:18:33,894 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2024-03-11 23:18:33,895 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2024-03-11 23:18:33,895 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:33,895 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:33,895 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:18:33,895 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:33,896 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:33,896 INFO  L85        PathProgramCache]: Analyzing trace with hash 22736524, now seen corresponding path program 1 times
[2024-03-11 23:18:33,896 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:33,896 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952802677]
[2024-03-11 23:18:33,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:33,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:33,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:33,920 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:33,920 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:33,920 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952802677]
[2024-03-11 23:18:33,920 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952802677] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:33,920 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:33,920 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:33,920 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88234675]
[2024-03-11 23:18:33,921 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:33,921 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:33,921 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:33,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:33,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:33,944 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2024-03-11 23:18:33,944 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 134 flow. Second operand  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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)
[2024-03-11 23:18:33,945 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:33,945 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2024-03-11 23:18:33,945 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:34,526 INFO  L130       PetriNetUnfolder]: 4106/7967 cut-off events.
[2024-03-11 23:18:34,526 INFO  L131       PetriNetUnfolder]: For 57/57 co-relation queries the response was YES.
[2024-03-11 23:18:34,532 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14665 conditions, 7967 events. 4106/7967 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 317. Compared 62182 event pairs, 1764 based on Foata normal form. 0/7275 useless extension candidates. Maximal degree in co-relation 5743. Up to 3425 conditions per place. 
[2024-03-11 23:18:34,558 INFO  L137   encePairwiseOnDemand]: 252/269 looper letters, 61 selfloop transitions, 11 changer transitions 0/92 dead transitions.
[2024-03-11 23:18:34,559 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 345 flow
[2024-03-11 23:18:34,560 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:34,560 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:34,561 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2024-03-11 23:18:34,562 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2024-03-11 23:18:34,562 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2024-03-11 23:18:34,562 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2024-03-11 23:18:34,563 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:34,563 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2024-03-11 23:18:34,577 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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)
[2024-03-11 23:18:34,579 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:34,580 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:34,580 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2024-03-11 23:18:34,580 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 345 flow
[2024-03-11 23:18:34,581 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 343 flow, removed 1 selfloop flow, removed 0 redundant places.
[2024-03-11 23:18:34,582 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 224 flow
[2024-03-11 23:18:34,582 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=67, PETRI_TRANSITIONS=70}
[2024-03-11 23:18:34,583 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places.
[2024-03-11 23:18:34,583 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 224 flow
[2024-03-11 23:18:34,584 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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)
[2024-03-11 23:18:34,584 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:34,584 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:34,584 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-11 23:18:34,584 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:34,584 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:34,584 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006456856, now seen corresponding path program 1 times
[2024-03-11 23:18:34,585 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:34,585 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263582684]
[2024-03-11 23:18:34,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:34,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:34,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:34,608 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:34,608 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:34,608 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263582684]
[2024-03-11 23:18:34,609 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263582684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:34,609 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:34,609 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:34,609 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208205269]
[2024-03-11 23:18:34,609 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:34,610 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:34,610 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:34,610 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:34,610 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:34,628 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2024-03-11 23:18:34,629 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 70 transitions, 224 flow. Second operand  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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)
[2024-03-11 23:18:34,629 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:34,629 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2024-03-11 23:18:34,629 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:35,254 INFO  L130       PetriNetUnfolder]: 3685/7514 cut-off events.
[2024-03-11 23:18:35,254 INFO  L131       PetriNetUnfolder]: For 2646/3130 co-relation queries the response was YES.
[2024-03-11 23:18:35,283 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 16029 conditions, 7514 events. 3685/7514 cut-off events. For 2646/3130 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 62308 event pairs, 2270 based on Foata normal form. 44/6885 useless extension candidates. Maximal degree in co-relation 5090. Up to 4360 conditions per place. 
[2024-03-11 23:18:35,310 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 50 selfloop transitions, 4 changer transitions 0/90 dead transitions.
[2024-03-11 23:18:35,310 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 384 flow
[2024-03-11 23:18:35,310 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:35,310 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:35,311 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2024-03-11 23:18:35,312 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2024-03-11 23:18:35,312 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2024-03-11 23:18:35,312 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2024-03-11 23:18:35,312 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:35,312 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2024-03-11 23:18:35,313 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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)
[2024-03-11 23:18:35,315 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:35,315 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:35,315 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 224 flow. Second operand 3 states and 503 transitions.
[2024-03-11 23:18:35,315 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 384 flow
[2024-03-11 23:18:35,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:35,322 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 232 flow
[2024-03-11 23:18:35,322 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=69, PETRI_TRANSITIONS=73}
[2024-03-11 23:18:35,323 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places.
[2024-03-11 23:18:35,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 232 flow
[2024-03-11 23:18:35,323 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 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)
[2024-03-11 23:18:35,323 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:35,324 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:35,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-11 23:18:35,324 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:35,324 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:35,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -420520761, now seen corresponding path program 1 times
[2024-03-11 23:18:35,324 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:35,324 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53130664]
[2024-03-11 23:18:35,324 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:35,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:35,330 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:35,347 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:35,347 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:35,347 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53130664]
[2024-03-11 23:18:35,348 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53130664] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:35,348 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:35,348 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:35,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223261987]
[2024-03-11 23:18:35,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:35,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:35,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:35,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:35,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:35,380 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 269
[2024-03-11 23:18:35,381 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 73 transitions, 232 flow. Second operand  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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)
[2024-03-11 23:18:35,381 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:35,381 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 269
[2024-03-11 23:18:35,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:35,921 INFO  L130       PetriNetUnfolder]: 3968/7815 cut-off events.
[2024-03-11 23:18:35,921 INFO  L131       PetriNetUnfolder]: For 1629/1907 co-relation queries the response was YES.
[2024-03-11 23:18:35,930 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17024 conditions, 7815 events. 3968/7815 cut-off events. For 1629/1907 co-relation queries the response was YES. Maximal size of possible extension queue 366. Compared 63275 event pairs, 2601 based on Foata normal form. 60/7073 useless extension candidates. Maximal degree in co-relation 13547. Up to 5524 conditions per place. 
[2024-03-11 23:18:35,954 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 51 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2024-03-11 23:18:35,954 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 422 flow
[2024-03-11 23:18:35,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:35,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:35,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2024-03-11 23:18:35,957 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5997521685254027
[2024-03-11 23:18:35,957 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2024-03-11 23:18:35,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2024-03-11 23:18:35,957 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:35,957 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2024-03-11 23:18:35,958 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 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)
[2024-03-11 23:18:35,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:35,960 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:35,960 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 232 flow. Second operand 3 states and 484 transitions.
[2024-03-11 23:18:35,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 422 flow
[2024-03-11 23:18:35,962 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:35,964 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 330 flow
[2024-03-11 23:18:35,964 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=71, PETRI_TRANSITIONS=83}
[2024-03-11 23:18:35,964 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2024-03-11 23:18:35,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 330 flow
[2024-03-11 23:18:35,965 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 146.0) internal successors, (438), 3 states have internal predecessors, (438), 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)
[2024-03-11 23:18:35,965 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:35,965 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:35,965 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-11 23:18:35,965 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:35,965 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:35,965 INFO  L85        PathProgramCache]: Analyzing trace with hash 777101591, now seen corresponding path program 1 times
[2024-03-11 23:18:35,965 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:35,965 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600732294]
[2024-03-11 23:18:35,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:35,966 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:35,974 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:35,990 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:35,990 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:35,990 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600732294]
[2024-03-11 23:18:35,990 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600732294] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:35,991 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:35,991 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:35,991 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139587095]
[2024-03-11 23:18:35,991 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:35,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:35,991 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:35,992 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:35,992 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:36,010 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2024-03-11 23:18:36,011 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 83 transitions, 330 flow. Second operand  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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)
[2024-03-11 23:18:36,011 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:36,011 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2024-03-11 23:18:36,011 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:36,601 INFO  L130       PetriNetUnfolder]: 4157/8465 cut-off events.
[2024-03-11 23:18:36,601 INFO  L131       PetriNetUnfolder]: For 5135/6762 co-relation queries the response was YES.
[2024-03-11 23:18:36,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20170 conditions, 8465 events. 4157/8465 cut-off events. For 5135/6762 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 72159 event pairs, 2727 based on Foata normal form. 253/7737 useless extension candidates. Maximal degree in co-relation 12648. Up to 5667 conditions per place. 
[2024-03-11 23:18:36,638 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 63 selfloop transitions, 6 changer transitions 0/111 dead transitions.
[2024-03-11 23:18:36,638 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 571 flow
[2024-03-11 23:18:36,638 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:36,639 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:36,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions.
[2024-03-11 23:18:36,640 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6183395291201983
[2024-03-11 23:18:36,640 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 499 transitions.
[2024-03-11 23:18:36,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions.
[2024-03-11 23:18:36,640 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:36,640 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions.
[2024-03-11 23:18:36,641 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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)
[2024-03-11 23:18:36,642 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:36,642 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:36,642 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 330 flow. Second operand 3 states and 499 transitions.
[2024-03-11 23:18:36,642 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 571 flow
[2024-03-11 23:18:36,649 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:36,650 INFO  L231             Difference]: Finished difference. Result has 72 places, 87 transitions, 348 flow
[2024-03-11 23:18:36,650 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=72, PETRI_TRANSITIONS=87}
[2024-03-11 23:18:36,651 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places.
[2024-03-11 23:18:36,651 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 348 flow
[2024-03-11 23:18:36,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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)
[2024-03-11 23:18:36,651 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:36,651 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:36,651 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-11 23:18:36,651 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:36,652 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:36,652 INFO  L85        PathProgramCache]: Analyzing trace with hash 1261976369, now seen corresponding path program 1 times
[2024-03-11 23:18:36,652 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:36,652 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117732004]
[2024-03-11 23:18:36,652 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:36,652 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:36,662 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:36,679 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:36,679 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:36,679 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117732004]
[2024-03-11 23:18:36,679 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117732004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:36,679 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:36,679 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:36,680 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690753645]
[2024-03-11 23:18:36,680 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:36,680 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:36,680 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:36,680 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:36,680 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:36,704 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2024-03-11 23:18:36,705 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 87 transitions, 348 flow. Second operand  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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)
[2024-03-11 23:18:36,705 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:36,705 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2024-03-11 23:18:36,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:37,396 INFO  L130       PetriNetUnfolder]: 6039/11385 cut-off events.
[2024-03-11 23:18:37,396 INFO  L131       PetriNetUnfolder]: For 6574/7585 co-relation queries the response was YES.
[2024-03-11 23:18:37,410 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28271 conditions, 11385 events. 6039/11385 cut-off events. For 6574/7585 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 91649 event pairs, 3093 based on Foata normal form. 252/10449 useless extension candidates. Maximal degree in co-relation 15661. Up to 7558 conditions per place. 
[2024-03-11 23:18:37,439 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2024-03-11 23:18:37,439 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 661 flow
[2024-03-11 23:18:37,440 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:37,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:37,441 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions.
[2024-03-11 23:18:37,441 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.61090458488228
[2024-03-11 23:18:37,441 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 493 transitions.
[2024-03-11 23:18:37,441 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions.
[2024-03-11 23:18:37,441 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:37,441 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions.
[2024-03-11 23:18:37,442 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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)
[2024-03-11 23:18:37,443 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:37,443 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:37,444 INFO  L175             Difference]: Start difference. First operand has 72 places, 87 transitions, 348 flow. Second operand 3 states and 493 transitions.
[2024-03-11 23:18:37,444 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 661 flow
[2024-03-11 23:18:37,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:18:37,448 INFO  L231             Difference]: Finished difference. Result has 75 places, 102 transitions, 524 flow
[2024-03-11 23:18:37,448 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=524, PETRI_PLACES=75, PETRI_TRANSITIONS=102}
[2024-03-11 23:18:37,448 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2024-03-11 23:18:37,449 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 524 flow
[2024-03-11 23:18:37,449 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 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)
[2024-03-11 23:18:37,449 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:37,449 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:37,449 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-11 23:18:37,449 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:37,449 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:37,449 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922484543, now seen corresponding path program 1 times
[2024-03-11 23:18:37,450 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:37,450 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922813370]
[2024-03-11 23:18:37,450 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:37,450 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:37,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:37,528 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:37,528 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:37,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922813370]
[2024-03-11 23:18:37,528 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922813370] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:18:37,528 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463482770]
[2024-03-11 23:18:37,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:37,528 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:18:37,528 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:18:37,533 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)
[2024-03-11 23:18:37,543 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
[2024-03-11 23:18:37,616 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:37,618 INFO  L263         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 23:18:37,620 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:18:37,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:37,705 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 23:18:37,705 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [463482770] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:37,705 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 23:18:37,705 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2024-03-11 23:18:37,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337546038]
[2024-03-11 23:18:37,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:37,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-11 23:18:37,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:37,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-11 23:18:37,706 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-03-11 23:18:37,730 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2024-03-11 23:18:37,731 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 102 transitions, 524 flow. Second operand  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 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)
[2024-03-11 23:18:37,731 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:37,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2024-03-11 23:18:37,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:38,910 INFO  L130       PetriNetUnfolder]: 8285/15913 cut-off events.
[2024-03-11 23:18:38,910 INFO  L131       PetriNetUnfolder]: For 17760/19750 co-relation queries the response was YES.
[2024-03-11 23:18:38,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45043 conditions, 15913 events. 8285/15913 cut-off events. For 17760/19750 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 138602 event pairs, 2025 based on Foata normal form. 619/15242 useless extension candidates. Maximal degree in co-relation 25629. Up to 5856 conditions per place. 
[2024-03-11 23:18:38,980 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 167 selfloop transitions, 16 changer transitions 3/236 dead transitions.
[2024-03-11 23:18:38,980 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1545 flow
[2024-03-11 23:18:38,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 23:18:38,981 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 23:18:38,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions.
[2024-03-11 23:18:38,983 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112586298459904
[2024-03-11 23:18:38,983 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions.
[2024-03-11 23:18:38,983 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions.
[2024-03-11 23:18:38,984 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:38,984 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions.
[2024-03-11 23:18:38,986 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 164.42857142857142) internal successors, (1151), 7 states have internal predecessors, (1151), 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)
[2024-03-11 23:18:38,988 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 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)
[2024-03-11 23:18:38,988 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 269.0) internal successors, (2152), 8 states have internal predecessors, (2152), 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)
[2024-03-11 23:18:38,988 INFO  L175             Difference]: Start difference. First operand has 75 places, 102 transitions, 524 flow. Second operand 7 states and 1151 transitions.
[2024-03-11 23:18:38,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1545 flow
[2024-03-11 23:18:39,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:39,065 INFO  L231             Difference]: Finished difference. Result has 82 places, 117 transitions, 584 flow
[2024-03-11 23:18:39,065 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=584, PETRI_PLACES=82, PETRI_TRANSITIONS=117}
[2024-03-11 23:18:39,066 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places.
[2024-03-11 23:18:39,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 584 flow
[2024-03-11 23:18:39,066 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 149.6) internal successors, (748), 5 states have internal predecessors, (748), 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)
[2024-03-11 23:18:39,066 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:39,066 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:39,081 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-11 23:18:39,267 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,SelfDestructingSolverStorable10
[2024-03-11 23:18:39,268 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:39,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:39,269 INFO  L85        PathProgramCache]: Analyzing trace with hash 597665167, now seen corresponding path program 1 times
[2024-03-11 23:18:39,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:39,269 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088302399]
[2024-03-11 23:18:39,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:39,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:39,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:39,346 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:39,346 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:39,346 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088302399]
[2024-03-11 23:18:39,346 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088302399] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:39,346 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:39,347 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:18:39,347 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694537154]
[2024-03-11 23:18:39,347 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:39,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:39,347 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:39,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:39,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:39,365 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 269
[2024-03-11 23:18:39,365 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 117 transitions, 584 flow. Second operand  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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)
[2024-03-11 23:18:39,365 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:39,365 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 269
[2024-03-11 23:18:39,365 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:40,268 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [30#L701-2true, threadThread1of2ForFork0InUse, Black: 188#true, threadThread2of2ForFork0InUse, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), 95#L687true, Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2024-03-11 23:18:40,268 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2024-03-11 23:18:40,268 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2024-03-11 23:18:40,268 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2024-03-11 23:18:40,269 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2024-03-11 23:18:40,330 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][37], [30#L701-2true, Black: 188#true, threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 47#L688-5true, 274#(= (select (select |#pthreadsMutex| |~#threads_alive_mutex~0.base|) |~#threads_alive_mutex~0.offset|) 1), Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 127#L688true])
[2024-03-11 23:18:40,330 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2024-03-11 23:18:40,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 23:18:40,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 23:18:40,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2024-03-11 23:18:40,589 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([656] L688-3-->L688-5: Formula: (= |v_threadThread1of2ForFork0_#t~nondet4_15| |v_#race~threads_alive~0_32|)  InVars {}  OutVars{threadThread1of2ForFork0_#t~nondet4=|v_threadThread1of2ForFork0_#t~nondet4_15|, #race~threads_alive~0=|v_#race~threads_alive~0_32|}  AuxVars[]  AssignedVars[threadThread1of2ForFork0_#t~nondet4, #race~threads_alive~0][54], [Black: 188#true, threadThread1of2ForFork0InUse, 30#L701-2true, threadThread2of2ForFork0InUse, 63#L690true, 47#L688-5true, Black: 167#(= |#race~threads_alive~0| 0), Black: 265#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 0 ~threads_alive~0)), Black: 215#(<= 0 |ULTIMATE.start_main_#t~post8#1|), Black: 202#(<= 0 ~threads_alive~0), Black: 173#(= |#race~data~0| 0), 194#true, Black: 179#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 185#(= |threadThread1of2ForFork0_#t~nondet2| |#race~data~0|), 272#true])
[2024-03-11 23:18:40,589 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2024-03-11 23:18:40,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 23:18:40,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 23:18:40,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2024-03-11 23:18:40,632 INFO  L130       PetriNetUnfolder]: 8494/17801 cut-off events.
[2024-03-11 23:18:40,632 INFO  L131       PetriNetUnfolder]: For 20941/23812 co-relation queries the response was YES.
[2024-03-11 23:18:40,670 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50895 conditions, 17801 events. 8494/17801 cut-off events. For 20941/23812 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 171881 event pairs, 1830 based on Foata normal form. 1341/17783 useless extension candidates. Maximal degree in co-relation 38987. Up to 6594 conditions per place. 
[2024-03-11 23:18:40,714 INFO  L137   encePairwiseOnDemand]: 257/269 looper letters, 84 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2024-03-11 23:18:40,714 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 996 flow
[2024-03-11 23:18:40,717 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:40,717 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:40,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions.
[2024-03-11 23:18:40,718 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034696406443618
[2024-03-11 23:18:40,718 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 487 transitions.
[2024-03-11 23:18:40,718 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions.
[2024-03-11 23:18:40,719 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:40,719 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions.
[2024-03-11 23:18:40,719 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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)
[2024-03-11 23:18:40,721 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:40,721 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:40,721 INFO  L175             Difference]: Start difference. First operand has 82 places, 117 transitions, 584 flow. Second operand 3 states and 487 transitions.
[2024-03-11 23:18:40,721 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 996 flow
[2024-03-11 23:18:40,735 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-11 23:18:40,736 INFO  L231             Difference]: Finished difference. Result has 85 places, 126 transitions, 670 flow
[2024-03-11 23:18:40,736 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=85, PETRI_TRANSITIONS=126}
[2024-03-11 23:18:40,737 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 21 predicate places.
[2024-03-11 23:18:40,737 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 126 transitions, 670 flow
[2024-03-11 23:18:40,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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)
[2024-03-11 23:18:40,737 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:40,737 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:40,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-11 23:18:40,737 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:40,738 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:40,738 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119960399, now seen corresponding path program 2 times
[2024-03-11 23:18:40,738 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:40,738 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395436703]
[2024-03-11 23:18:40,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:40,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:40,751 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:40,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 23:18:40,848 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:40,848 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395436703]
[2024-03-11 23:18:40,848 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395436703] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:40,848 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:40,848 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-11 23:18:40,849 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614717325]
[2024-03-11 23:18:40,849 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:40,849 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-11 23:18:40,849 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:40,849 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-11 23:18:40,849 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-03-11 23:18:40,900 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269
[2024-03-11 23:18:40,901 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 126 transitions, 670 flow. Second operand  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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)
[2024-03-11 23:18:40,901 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:40,901 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269
[2024-03-11 23:18:40,901 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:41,155 INFO  L130       PetriNetUnfolder]: 1010/2573 cut-off events.
[2024-03-11 23:18:41,155 INFO  L131       PetriNetUnfolder]: For 2202/2418 co-relation queries the response was YES.
[2024-03-11 23:18:41,159 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7517 conditions, 2573 events. 1010/2573 cut-off events. For 2202/2418 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 18646 event pairs, 329 based on Foata normal form. 222/2707 useless extension candidates. Maximal degree in co-relation 5322. Up to 1190 conditions per place. 
[2024-03-11 23:18:41,163 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 40 selfloop transitions, 16 changer transitions 0/91 dead transitions.
[2024-03-11 23:18:41,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 528 flow
[2024-03-11 23:18:41,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 23:18:41,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 23:18:41,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2024-03-11 23:18:41,165 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5715613382899628
[2024-03-11 23:18:41,165 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2024-03-11 23:18:41,165 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2024-03-11 23:18:41,165 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:41,165 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2024-03-11 23:18:41,166 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 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)
[2024-03-11 23:18:41,167 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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)
[2024-03-11 23:18:41,168 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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)
[2024-03-11 23:18:41,168 INFO  L175             Difference]: Start difference. First operand has 85 places, 126 transitions, 670 flow. Second operand 4 states and 615 transitions.
[2024-03-11 23:18:41,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 528 flow
[2024-03-11 23:18:41,178 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 462 flow, removed 21 selfloop flow, removed 6 redundant places.
[2024-03-11 23:18:41,179 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 333 flow
[2024-03-11 23:18:41,179 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=333, PETRI_PLACES=75, PETRI_TRANSITIONS=77}
[2024-03-11 23:18:41,180 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2024-03-11 23:18:41,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 333 flow
[2024-03-11 23:18:41,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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)
[2024-03-11 23:18:41,180 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:41,180 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:41,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-11 23:18:41,180 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:41,181 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:41,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -674470246, now seen corresponding path program 1 times
[2024-03-11 23:18:41,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:41,181 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535935817]
[2024-03-11 23:18:41,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:41,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:41,192 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:41,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-03-11 23:18:41,211 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:41,211 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535935817]
[2024-03-11 23:18:41,211 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535935817] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:41,211 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:41,211 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:41,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334230855]
[2024-03-11 23:18:41,212 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:41,212 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:41,212 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:41,212 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:41,212 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:41,228 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2024-03-11 23:18:41,229 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 77 transitions, 333 flow. Second operand  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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)
[2024-03-11 23:18:41,229 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:41,229 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2024-03-11 23:18:41,229 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:41,450 INFO  L130       PetriNetUnfolder]: 1161/2703 cut-off events.
[2024-03-11 23:18:41,450 INFO  L131       PetriNetUnfolder]: For 1713/1792 co-relation queries the response was YES.
[2024-03-11 23:18:41,454 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7394 conditions, 2703 events. 1161/2703 cut-off events. For 1713/1792 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 19190 event pairs, 663 based on Foata normal form. 3/2518 useless extension candidates. Maximal degree in co-relation 5369. Up to 1652 conditions per place. 
[2024-03-11 23:18:41,459 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 56 selfloop transitions, 8 changer transitions 0/100 dead transitions.
[2024-03-11 23:18:41,459 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 561 flow
[2024-03-11 23:18:41,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:41,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:41,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2024-03-11 23:18:41,461 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2024-03-11 23:18:41,461 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2024-03-11 23:18:41,461 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2024-03-11 23:18:41,461 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:41,461 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2024-03-11 23:18:41,462 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.66666666666666) internal successors, (497), 3 states have internal predecessors, (497), 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)
[2024-03-11 23:18:41,463 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:41,464 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:41,464 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 333 flow. Second operand 3 states and 497 transitions.
[2024-03-11 23:18:41,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 561 flow
[2024-03-11 23:18:41,467 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:41,468 INFO  L231             Difference]: Finished difference. Result has 77 places, 82 transitions, 383 flow
[2024-03-11 23:18:41,469 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=383, PETRI_PLACES=77, PETRI_TRANSITIONS=82}
[2024-03-11 23:18:41,469 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places.
[2024-03-11 23:18:41,469 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 383 flow
[2024-03-11 23:18:41,469 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 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)
[2024-03-11 23:18:41,470 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:41,470 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:41,470 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-11 23:18:41,470 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:41,470 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:41,470 INFO  L85        PathProgramCache]: Analyzing trace with hash 545280907, now seen corresponding path program 1 times
[2024-03-11 23:18:41,470 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:41,470 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968768341]
[2024-03-11 23:18:41,470 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:41,470 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:41,482 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:41,538 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 23:18:41,538 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:41,538 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968768341]
[2024-03-11 23:18:41,538 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968768341] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:41,539 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:41,539 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:18:41,539 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151367002]
[2024-03-11 23:18:41,539 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:41,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:41,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:41,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:41,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:41,574 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2024-03-11 23:18:41,575 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 383 flow. Second operand  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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)
[2024-03-11 23:18:41,575 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:41,575 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2024-03-11 23:18:41,575 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:41,862 INFO  L130       PetriNetUnfolder]: 1581/3753 cut-off events.
[2024-03-11 23:18:41,862 INFO  L131       PetriNetUnfolder]: For 3378/3613 co-relation queries the response was YES.
[2024-03-11 23:18:41,868 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 11007 conditions, 3753 events. 1581/3753 cut-off events. For 3378/3613 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 29364 event pairs, 288 based on Foata normal form. 143/3777 useless extension candidates. Maximal degree in co-relation 7716. Up to 1817 conditions per place. 
[2024-03-11 23:18:41,875 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 67 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2024-03-11 23:18:41,875 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 732 flow
[2024-03-11 23:18:41,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:41,876 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:41,877 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2024-03-11 23:18:41,877 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6146220570012392
[2024-03-11 23:18:41,877 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2024-03-11 23:18:41,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2024-03-11 23:18:41,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:41,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2024-03-11 23:18:41,878 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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)
[2024-03-11 23:18:41,879 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:41,879 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 269.0) internal successors, (1076), 4 states have internal predecessors, (1076), 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)
[2024-03-11 23:18:41,879 INFO  L175             Difference]: Start difference. First operand has 77 places, 82 transitions, 383 flow. Second operand 3 states and 496 transitions.
[2024-03-11 23:18:41,879 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 732 flow
[2024-03-11 23:18:41,885 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:18:41,886 INFO  L231             Difference]: Finished difference. Result has 78 places, 95 transitions, 505 flow
[2024-03-11 23:18:41,886 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=78, PETRI_TRANSITIONS=95}
[2024-03-11 23:18:41,886 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places.
[2024-03-11 23:18:41,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 505 flow
[2024-03-11 23:18:41,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 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)
[2024-03-11 23:18:41,887 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:41,887 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:41,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-11 23:18:41,887 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:41,887 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:41,887 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143255471, now seen corresponding path program 2 times
[2024-03-11 23:18:41,887 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:41,887 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812599908]
[2024-03-11 23:18:41,887 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:41,887 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:41,900 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:41,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:18:41,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:41,985 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812599908]
[2024-03-11 23:18:41,985 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812599908] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:18:41,985 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239064777]
[2024-03-11 23:18:41,985 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 23:18:41,985 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:18:41,985 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:18:41,986 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)
[2024-03-11 23:18:41,990 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
[2024-03-11 23:18:42,079 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-03-11 23:18:42,079 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 23:18:42,080 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-03-11 23:18:42,082 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:18:42,205 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 11 treesize of output 7
[2024-03-11 23:18:42,242 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:18:42,243 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 14 treesize of output 16
[2024-03-11 23:18:42,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:18:42,263 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 23:18:42,326 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 23:18:42,327 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2024-03-11 23:18:42,330 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 33 treesize of output 25
[2024-03-11 23:18:42,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:18:42,357 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [239064777] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 23:18:42,357 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 23:18:42,357 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2024-03-11 23:18:42,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657368855]
[2024-03-11 23:18:42,357 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 23:18:42,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-11 23:18:42,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:42,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-11 23:18:42,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2024-03-11 23:18:42,522 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2024-03-11 23:18:42,524 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 95 transitions, 505 flow. Second operand  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 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)
[2024-03-11 23:18:42,524 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:42,524 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2024-03-11 23:18:42,524 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:42,773 INFO  L130       PetriNetUnfolder]: 800/2211 cut-off events.
[2024-03-11 23:18:42,773 INFO  L131       PetriNetUnfolder]: For 2345/2426 co-relation queries the response was YES.
[2024-03-11 23:18:42,777 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6911 conditions, 2211 events. 800/2211 cut-off events. For 2345/2426 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16413 event pairs, 251 based on Foata normal form. 88/2214 useless extension candidates. Maximal degree in co-relation 4732. Up to 1130 conditions per place. 
[2024-03-11 23:18:42,783 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 13 changer transitions 1/111 dead transitions.
[2024-03-11 23:18:42,784 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 719 flow
[2024-03-11 23:18:42,784 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 23:18:42,784 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 23:18:42,785 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions.
[2024-03-11 23:18:42,785 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5864312267657993
[2024-03-11 23:18:42,785 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 631 transitions.
[2024-03-11 23:18:42,785 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions.
[2024-03-11 23:18:42,786 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:42,786 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions.
[2024-03-11 23:18:42,787 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 157.75) internal successors, (631), 4 states have internal predecessors, (631), 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)
[2024-03-11 23:18:42,788 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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)
[2024-03-11 23:18:42,788 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 269.0) internal successors, (1345), 5 states have internal predecessors, (1345), 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)
[2024-03-11 23:18:42,788 INFO  L175             Difference]: Start difference. First operand has 78 places, 95 transitions, 505 flow. Second operand 4 states and 631 transitions.
[2024-03-11 23:18:42,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 719 flow
[2024-03-11 23:18:42,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 703 flow, removed 1 selfloop flow, removed 1 redundant places.
[2024-03-11 23:18:42,794 INFO  L231             Difference]: Finished difference. Result has 80 places, 90 transitions, 478 flow
[2024-03-11 23:18:42,794 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=269, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=478, PETRI_PLACES=80, PETRI_TRANSITIONS=90}
[2024-03-11 23:18:42,794 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places.
[2024-03-11 23:18:42,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 478 flow
[2024-03-11 23:18:42,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.3) internal successors, (1483), 10 states have internal predecessors, (1483), 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)
[2024-03-11 23:18:42,795 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:42,795 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2024-03-11 23:18:42,802 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-11 23:18:42,996 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:18:42,996 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2024-03-11 23:18:42,997 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:42,997 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802055890, now seen corresponding path program 1 times
[2024-03-11 23:18:42,997 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:42,997 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58616557]
[2024-03-11 23:18:42,998 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:42,998 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:43,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:18:43,022 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:18:43,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:18:43,042 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:18:43,042 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:18:43,042 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2024-03-11 23:18:43,043 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2024-03-11 23:18:43,044 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2024-03-11 23:18:43,044 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-03-11 23:18:43,044 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:43,044 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:18:43,045 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2024-03-11 23:18:43,062 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-11 23:18:43,064 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,086 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2024-03-11 23:18:43,086 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2024-03-11 23:18:43,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2024-03-11 23:18:43,087 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,089 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,089 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:18:43,089 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,089 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,089 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2024-03-11 23:18:43,110 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2024-03-11 23:18:43,110 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2024-03-11 23:18:43,111 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 360 conditions, 344 events. 13/344 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 491 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 263. Up to 8 conditions per place. 
[2024-03-11 23:18:43,117 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13416
[2024-03-11 23:18:47,239 INFO  L134        LiptonReduction]: Checked pairs total: 63011
[2024-03-11 23:18:47,240 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2024-03-11 23:18:47,241 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:18:47,241 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;@3b31b2e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:18:47,241 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-11 23:18:47,242 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2024-03-11 23:18:47,242 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:18:47,242 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:47,242 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:18:47,242 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:18:47,243 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:47,243 INFO  L85        PathProgramCache]: Analyzing trace with hash 33015180, now seen corresponding path program 1 times
[2024-03-11 23:18:47,243 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:47,243 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558193956]
[2024-03-11 23:18:47,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:47,243 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:47,247 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:47,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:47,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:47,256 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558193956]
[2024-03-11 23:18:47,256 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558193956] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:47,256 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:47,256 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:47,256 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811936879]
[2024-03-11 23:18:47,256 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:47,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:47,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:47,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:47,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:47,289 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 307
[2024-03-11 23:18:47,290 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 175 flow. Second operand  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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)
[2024-03-11 23:18:47,290 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:47,290 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 307
[2024-03-11 23:18:47,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:53,823 INFO  L130       PetriNetUnfolder]: 72169/116333 cut-off events.
[2024-03-11 23:18:53,824 INFO  L131       PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES.
[2024-03-11 23:18:53,941 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 219426 conditions, 116333 events. 72169/116333 cut-off events. For 1881/1881 co-relation queries the response was YES. Maximal size of possible extension queue 3388. Compared 1041871 event pairs, 31556 based on Foata normal form. 0/105895 useless extension candidates. Maximal degree in co-relation 36488. Up to 53205 conditions per place. 
[2024-03-11 23:18:54,282 INFO  L137   encePairwiseOnDemand]: 286/307 looper letters, 77 selfloop transitions, 14 changer transitions 0/117 dead transitions.
[2024-03-11 23:18:54,282 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 449 flow
[2024-03-11 23:18:54,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:18:54,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:18:54,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions.
[2024-03-11 23:18:54,284 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6395222584147665
[2024-03-11 23:18:54,284 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 589 transitions.
[2024-03-11 23:18:54,284 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions.
[2024-03-11 23:18:54,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:18:54,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions.
[2024-03-11 23:18:54,286 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 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)
[2024-03-11 23:18:54,287 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:18:54,287 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:18:54,287 INFO  L175             Difference]: Start difference. First operand has 82 places, 77 transitions, 175 flow. Second operand 3 states and 589 transitions.
[2024-03-11 23:18:54,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 449 flow
[2024-03-11 23:18:54,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 441 flow, removed 4 selfloop flow, removed 0 redundant places.
[2024-03-11 23:18:54,290 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 287 flow
[2024-03-11 23:18:54,290 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=85, PETRI_TRANSITIONS=89}
[2024-03-11 23:18:54,291 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places.
[2024-03-11 23:18:54,291 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 287 flow
[2024-03-11 23:18:54,291 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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)
[2024-03-11 23:18:54,291 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:18:54,291 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:18:54,291 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-03-11 23:18:54,291 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:18:54,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:18:54,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 265562788, now seen corresponding path program 1 times
[2024-03-11 23:18:54,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:18:54,292 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510582506]
[2024-03-11 23:18:54,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:18:54,292 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:18:54,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:18:54,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:18:54,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:18:54,304 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510582506]
[2024-03-11 23:18:54,305 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510582506] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:18:54,305 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:18:54,305 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:18:54,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903635180]
[2024-03-11 23:18:54,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:18:54,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:18:54,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:18:54,305 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:18:54,305 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:18:54,354 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2024-03-11 23:18:54,355 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 89 transitions, 287 flow. Second operand  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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)
[2024-03-11 23:18:54,355 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:18:54,355 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2024-03-11 23:18:54,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:18:58,208 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,208 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:18:58,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,208 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,208 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:18:58,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:18:58,209 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,517 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 116#L685-4true, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,517 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:18:58,517 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,804 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,805 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 156#L688-2true, 200#true, Black: 194#true, 80#L705-1true, 70#L686true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2024-03-11 23:18:58,805 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 194#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:18:58,805 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:58,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][74], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 194#true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse])
[2024-03-11 23:18:59,470 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][19], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), threadThread2of3ForFork0InUse])
[2024-03-11 23:18:59,470 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:18:59,470 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 194#true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:18:59,471 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, threadThread1of3ForFork0InUse, 196#(= |#race~threads_alive~0| 0), 68#L705-4true, threadThread2of3ForFork0InUse])
[2024-03-11 23:18:59,471 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:18:59,471 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:00,801 INFO  L130       PetriNetUnfolder]: 61911/103015 cut-off events.
[2024-03-11 23:19:00,802 INFO  L131       PetriNetUnfolder]: For 48263/52767 co-relation queries the response was YES.
[2024-03-11 23:19:00,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 239892 conditions, 103015 events. 61911/103015 cut-off events. For 48263/52767 co-relation queries the response was YES. Maximal size of possible extension queue 3459. Compared 973491 event pairs, 40172 based on Foata normal form. 626/93124 useless extension candidates. Maximal degree in co-relation 98726. Up to 73895 conditions per place. 
[2024-03-11 23:19:01,326 INFO  L137   encePairwiseOnDemand]: 297/307 looper letters, 65 selfloop transitions, 16 changer transitions 0/121 dead transitions.
[2024-03-11 23:19:01,326 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 549 flow
[2024-03-11 23:19:01,327 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:19:01,327 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:19:01,328 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions.
[2024-03-11 23:19:01,328 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6199782844733985
[2024-03-11 23:19:01,328 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 571 transitions.
[2024-03-11 23:19:01,328 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions.
[2024-03-11 23:19:01,329 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:19:01,329 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions.
[2024-03-11 23:19:01,330 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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)
[2024-03-11 23:19:01,331 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:01,331 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:01,331 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 287 flow. Second operand 3 states and 571 transitions.
[2024-03-11 23:19:01,331 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 549 flow
[2024-03-11 23:19:01,390 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:19:01,391 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 405 flow
[2024-03-11 23:19:01,391 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=87, PETRI_TRANSITIONS=103}
[2024-03-11 23:19:01,392 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places.
[2024-03-11 23:19:01,392 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 405 flow
[2024-03-11 23:19:01,392 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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)
[2024-03-11 23:19:01,392 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:19:01,392 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:19:01,392 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-03-11 23:19:01,392 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:19:01,392 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:19:01,393 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657692777, now seen corresponding path program 1 times
[2024-03-11 23:19:01,393 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:19:01,393 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686420236]
[2024-03-11 23:19:01,393 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:19:01,393 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:19:01,398 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:19:01,407 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:19:01,407 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:19:01,407 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686420236]
[2024-03-11 23:19:01,407 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686420236] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:19:01,407 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:19:01,407 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:19:01,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515295273]
[2024-03-11 23:19:01,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:19:01,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:19:01,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:19:01,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:19:01,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:19:01,423 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 307
[2024-03-11 23:19:01,424 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 405 flow. Second operand  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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)
[2024-03-11 23:19:01,424 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:19:01,424 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 307
[2024-03-11 23:19:01,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:19:06,496 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:19:06,496 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,496 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,497 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,497 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,504 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:06,504 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:06,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:07,023 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 116#L685-4true, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:19:07,023 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,023 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,023 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,023 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,029 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:07,029 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,029 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,029 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,029 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:07,443 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:19:07,443 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,443 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,448 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:07,449 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,449 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:07,841 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][107], [threadThread3of3ForFork0InUse, 72#L688-2true, 200#true, 156#L688-2true, Black: 194#true, 64#L688-1true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:07,841 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:07,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:07,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:07,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:08,321 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][37], [threadThread3of3ForFork0InUse, 200#true, 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 119#L688-5true])
[2024-03-11 23:19:08,322 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,325 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][79], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, 200#true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:08,325 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:08,325 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:09,776 INFO  L130       PetriNetUnfolder]: 70720/120727 cut-off events.
[2024-03-11 23:19:09,776 INFO  L131       PetriNetUnfolder]: For 84139/95985 co-relation queries the response was YES.
[2024-03-11 23:19:10,002 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 288992 conditions, 120727 events. 70720/120727 cut-off events. For 84139/95985 co-relation queries the response was YES. Maximal size of possible extension queue 4315. Compared 1202860 event pairs, 40332 based on Foata normal form. 2269/110394 useless extension candidates. Maximal degree in co-relation 124221. Up to 73684 conditions per place. 
[2024-03-11 23:19:10,442 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions.
[2024-03-11 23:19:10,442 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 655 flow
[2024-03-11 23:19:10,443 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:19:10,443 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:19:10,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2024-03-11 23:19:10,444 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6416938110749185
[2024-03-11 23:19:10,444 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2024-03-11 23:19:10,444 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2024-03-11 23:19:10,444 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:19:10,444 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2024-03-11 23:19:10,445 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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)
[2024-03-11 23:19:10,446 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:10,446 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:10,446 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 405 flow. Second operand 3 states and 591 transitions.
[2024-03-11 23:19:10,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 655 flow
[2024-03-11 23:19:10,533 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:19:10,535 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 411 flow
[2024-03-11 23:19:10,535 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=89, PETRI_TRANSITIONS=107}
[2024-03-11 23:19:10,535 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places.
[2024-03-11 23:19:10,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 411 flow
[2024-03-11 23:19:10,536 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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)
[2024-03-11 23:19:10,536 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:19:10,536 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:19:10,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-03-11 23:19:10,536 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:19:10,536 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:19:10,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092777545, now seen corresponding path program 1 times
[2024-03-11 23:19:10,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:19:10,536 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110179711]
[2024-03-11 23:19:10,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:19:10,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:19:10,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:19:10,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:19:10,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:19:10,559 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110179711]
[2024-03-11 23:19:10,559 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110179711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:19:10,559 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:19:10,559 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:19:10,559 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882268830]
[2024-03-11 23:19:10,559 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:19:10,560 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:19:10,560 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:19:10,560 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:19:10,560 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:19:10,580 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2024-03-11 23:19:10,580 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 107 transitions, 411 flow. Second operand  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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)
[2024-03-11 23:19:10,580 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:19:10,580 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2024-03-11 23:19:10,580 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:19:16,526 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2024-03-11 23:19:16,527 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,527 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,534 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, 149#L685-2true, threadThread1of3ForFork0InUse, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:16,534 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:16,534 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:17,082 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2024-03-11 23:19:17,083 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,089 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 116#L685-4true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:17,089 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:17,589 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 119#L688-5true, 212#true])
[2024-03-11 23:19:17,589 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,589 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,594 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:17,594 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,594 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,594 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,594 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:17,975 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][125], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 194#true, 206#true, 64#L688-1true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:17,975 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:17,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:17,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:17,975 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:18,436 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][41], [threadThread3of3ForFork0InUse, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true, 119#L688-5true])
[2024-03-11 23:19:18,437 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,440 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][86], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 206#true, threadThread1of3ForFork0InUse, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:18,440 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:18,440 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2024-03-11 23:19:19,921 INFO  L130       PetriNetUnfolder]: 80048/137390 cut-off events.
[2024-03-11 23:19:19,922 INFO  L131       PetriNetUnfolder]: For 90837/104282 co-relation queries the response was YES.
[2024-03-11 23:19:20,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 333514 conditions, 137390 events. 80048/137390 cut-off events. For 90837/104282 co-relation queries the response was YES. Maximal size of possible extension queue 5073. Compared 1412577 event pairs, 45808 based on Foata normal form. 2771/124165 useless extension candidates. Maximal degree in co-relation 239260. Up to 86226 conditions per place. 
[2024-03-11 23:19:20,711 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 85 selfloop transitions, 9 changer transitions 0/146 dead transitions.
[2024-03-11 23:19:20,711 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 747 flow
[2024-03-11 23:19:20,712 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:19:20,712 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:19:20,713 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2024-03-11 23:19:20,713 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6384364820846905
[2024-03-11 23:19:20,713 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2024-03-11 23:19:20,713 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2024-03-11 23:19:20,713 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:19:20,713 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2024-03-11 23:19:20,714 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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)
[2024-03-11 23:19:20,715 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:20,715 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:20,716 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 411 flow. Second operand 3 states and 588 transitions.
[2024-03-11 23:19:20,716 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 747 flow
[2024-03-11 23:19:21,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:19:21,956 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 477 flow
[2024-03-11 23:19:21,956 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=91, PETRI_TRANSITIONS=114}
[2024-03-11 23:19:21,957 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2024-03-11 23:19:21,957 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 477 flow
[2024-03-11 23:19:21,957 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 177.66666666666666) internal successors, (533), 3 states have internal predecessors, (533), 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)
[2024-03-11 23:19:21,957 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:19:21,957 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:19:21,957 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-03-11 23:19:21,957 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:19:21,957 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:19:21,957 INFO  L85        PathProgramCache]: Analyzing trace with hash -694365201, now seen corresponding path program 1 times
[2024-03-11 23:19:21,957 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:19:21,957 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683814312]
[2024-03-11 23:19:21,958 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:19:21,958 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:19:21,964 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:19:21,978 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:19:21,978 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:19:21,978 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683814312]
[2024-03-11 23:19:21,978 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683814312] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:19:21,979 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:19:21,979 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:19:21,979 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481507778]
[2024-03-11 23:19:21,979 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:19:21,979 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:19:21,979 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:19:21,980 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:19:21,980 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:19:22,020 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2024-03-11 23:19:22,021 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 114 transitions, 477 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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)
[2024-03-11 23:19:22,021 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:19:22,021 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2024-03-11 23:19:22,021 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:19:27,865 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 14#L685true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:27,865 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2024-03-11 23:19:27,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:27,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:27,865 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:28,697 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1031] L708-2-->ULTIMATE.startEXIT: Formula: (and (= |v_ULTIMATE.start_main_#res#1_50| v_~data~0_52) (= |v_ULTIMATE.start_main_#res#1_50| |v_ULTIMATE.start_#t~ret16#1_18|))  InVars {~data~0=v_~data~0_52}  OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_50|, ULTIMATE.start_#t~ret16#1=|v_ULTIMATE.start_#t~ret16#1_18|, ~data~0=v_~data~0_52}  AuxVars[]  AssignedVars[ULTIMATE.start_main_#res#1, ULTIMATE.start_#t~ret16#1][20], [threadThread3of3ForFork0InUse, 2#ULTIMATE.startEXITtrue, Black: 194#true, 122#L688-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 206#true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:28,697 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:19:28,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:28,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:28,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:28,871 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:28,871 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:19:28,871 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2024-03-11 23:19:28,872 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:28,872 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:28,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:28,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:28,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:29,437 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([985] L685-2-->L685-4: Formula: (= |v_#race~data~0_21| |v_threadThread3of3ForFork0_#t~nondet2_15|)  InVars {}  OutVars{#race~data~0=|v_#race~data~0_21|, threadThread3of3ForFork0_#t~nondet2=|v_threadThread3of3ForFork0_#t~nondet2_15|}  AuxVars[]  AssignedVars[#race~data~0, threadThread3of3ForFork0_#t~nondet2][120], [threadThread3of3ForFork0InUse, Black: 194#true, 122#L688-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 168#L708-2true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:29,437 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is not cut-off event
[2024-03-11 23:19:29,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2024-03-11 23:19:29,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2024-03-11 23:19:29,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2024-03-11 23:19:29,683 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:29,683 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:29,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:29,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:29,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:29,683 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:29,683 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:29,683 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:29,684 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:29,684 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:30,298 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 70#L686true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:30,298 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:30,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2024-03-11 23:19:30,299 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:30,299 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:30,299 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:30,299 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:30,299 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2024-03-11 23:19:31,659 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][35], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:31,659 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:31,659 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,659 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,659 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,659 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([758] L705-4-->L705-1: Formula: (= 0 |v_#race~threads_alive~0_7|)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_7|}  AuxVars[]  AssignedVars[#race~threads_alive~0][18], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 80#L705-1true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:31,659 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][91], [threadThread3of3ForFork0InUse, 72#L688-2true, 9#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:31,660 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][129], [threadThread3of3ForFork0InUse, 72#L688-2true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, threadThread2of3ForFork0InUse, 212#true])
[2024-03-11 23:19:31,660 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:31,660 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:35,455 INFO  L130       PetriNetUnfolder]: 117057/193039 cut-off events.
[2024-03-11 23:19:35,455 INFO  L131       PetriNetUnfolder]: For 158026/169600 co-relation queries the response was YES.
[2024-03-11 23:19:35,865 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 504642 conditions, 193039 events. 117057/193039 cut-off events. For 158026/169600 co-relation queries the response was YES. Maximal size of possible extension queue 6334. Compared 1920667 event pairs, 63393 based on Foata normal form. 1083/172268 useless extension candidates. Maximal degree in co-relation 281947. Up to 136766 conditions per place. 
[2024-03-11 23:19:36,602 INFO  L137   encePairwiseOnDemand]: 296/307 looper letters, 95 selfloop transitions, 28 changer transitions 0/164 dead transitions.
[2024-03-11 23:19:36,602 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 937 flow
[2024-03-11 23:19:36,603 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:19:36,603 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:19:36,604 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions.
[2024-03-11 23:19:36,604 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6297502714440825
[2024-03-11 23:19:36,604 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 580 transitions.
[2024-03-11 23:19:36,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions.
[2024-03-11 23:19:36,605 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:19:36,605 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions.
[2024-03-11 23:19:36,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 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)
[2024-03-11 23:19:36,607 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:36,607 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:19:36,607 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 477 flow. Second operand 3 states and 580 transitions.
[2024-03-11 23:19:36,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 937 flow
[2024-03-11 23:19:36,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:19:36,960 INFO  L231             Difference]: Finished difference. Result has 93 places, 138 transitions, 749 flow
[2024-03-11 23:19:36,960 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=749, PETRI_PLACES=93, PETRI_TRANSITIONS=138}
[2024-03-11 23:19:36,960 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2024-03-11 23:19:36,960 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 749 flow
[2024-03-11 23:19:36,960 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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)
[2024-03-11 23:19:36,960 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:19:36,960 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:19:36,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-03-11 23:19:36,961 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:19:36,961 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:19:36,961 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017840435, now seen corresponding path program 1 times
[2024-03-11 23:19:36,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:19:36,961 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082387724]
[2024-03-11 23:19:36,961 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:19:36,961 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:19:36,970 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:19:37,012 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:19:37,012 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:19:37,012 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082387724]
[2024-03-11 23:19:37,012 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082387724] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:19:37,012 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162163470]
[2024-03-11 23:19:37,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:19:37,012 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:19:37,012 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:19:37,013 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)
[2024-03-11 23:19:37,015 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
[2024-03-11 23:19:37,100 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:19:37,101 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-11 23:19:37,102 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:19:37,135 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:19:37,135 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-11 23:19:37,135 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [162163470] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:19:37,135 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-11 23:19:37,135 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2024-03-11 23:19:37,135 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338951987]
[2024-03-11 23:19:37,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:19:37,136 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-11 23:19:37,136 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:19:37,136 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-11 23:19:37,136 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2024-03-11 23:19:37,169 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 307
[2024-03-11 23:19:37,170 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 138 transitions, 749 flow. Second operand  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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)
[2024-03-11 23:19:37,170 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:19:37,170 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 307
[2024-03-11 23:19:37,170 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:19:45,800 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:45,801 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2024-03-11 23:19:45,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:45,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:45,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2024-03-11 23:19:46,768 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:46,768 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,768 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,769 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,769 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,841 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 14#L685true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:46,841 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,841 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:46,841 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,842 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,842 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,842 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2024-03-11 23:19:46,843 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:46,843 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:46,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:46,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:46,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,162 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 149#L685-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:48,162 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,237 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:48,237 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2024-03-11 23:19:48,396 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 116#L685-4true, Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:48,397 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:48,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:48,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:48,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,192 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 163#L705-2true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:49,193 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,461 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, 116#L685-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:49,461 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,461 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,709 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:49,710 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:49,711 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:49,711 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:49,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:49,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:49,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:49,807 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:49,807 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:49,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:50,452 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:50,453 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:50,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:50,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:50,453 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:50,811 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 70#L686true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:50,811 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2024-03-11 23:19:50,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:50,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:50,812 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:51,682 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][328], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:51,682 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:51,682 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:51,682 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:51,682 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:51,682 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,239 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:52,239 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,239 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,240 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([888] L688-2-->L688-3: Formula: (= v_~threads_alive~0_7 (+ v_~threads_alive~0_6 2))  InVars {~threads_alive~0=v_~threads_alive~0_7}  OutVars{~threads_alive~0=v_~threads_alive~0_6}  AuxVars[]  AssignedVars[~threads_alive~0][119], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 143#L688-3true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:52,240 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:52,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:52,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:52,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:52,501 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 170#L688-1true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:52,501 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:52,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,153 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:53,153 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,233 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 139#threadErr0ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:53,233 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,233 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,233 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,233 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:53,648 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([828] L705-2-->L706: Formula: (not (= v_~threads_alive~0_5 0))  InVars {~threads_alive~0=v_~threads_alive~0_5}  OutVars{~threads_alive~0=v_~threads_alive~0_5}  AuxVars[]  AssignedVars[][22], [threadThread3of3ForFork0InUse, Black: 194#true, 6#L688true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 146#L706true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:53,649 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,870 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:53,870 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,870 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,940 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:53,940 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:53,940 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:54,443 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 160#L698-2true, 103#threadEXITtrue, 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:54,444 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2024-03-11 23:19:54,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:54,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:54,444 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:55,603 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:55,603 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:55,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:55,977 INFO  L383   tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 80#L705-1true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:55,977 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([859] L688-->L688-1: Formula: (= |v_#race~threads_alive~0_10| 0)  InVars {}  OutVars{#race~threads_alive~0=|v_#race~threads_alive~0_10|}  AuxVars[]  AssignedVars[#race~threads_alive~0][230], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 228#(<= 1 ~threads_alive~0), Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse])
[2024-03-11 23:19:55,977 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:55,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:56,637 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][105], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 76#L688-6true, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:56,637 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:56,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:56,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:56,637 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 163#L705-2true, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:19:57,067 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, Black: 194#true, 224#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 163#L705-2true, threadThread2of3ForFork0InUse, 23#L688-3true])
[2024-03-11 23:19:57,067 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,417 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:57,417 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,417 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,456 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, 34#L698-3true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:57,456 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,456 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,457 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:57,457 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,458 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:57,458 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,458 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,458 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,458 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,463 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:57,463 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,463 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,463 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,463 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,493 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 160#L698-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:19:57,493 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,493 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,493 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,493 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:57,739 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, 68#L705-4true, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:57,739 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:57,739 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2024-03-11 23:19:58,214 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:58,215 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,215 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,215 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,215 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,269 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 161#L698-6true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 200#true, 218#true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:58,270 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,270 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,270 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,270 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,270 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,405 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][304], [threadThread3of3ForFork0InUse, 224#true, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 96#threadErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:58,405 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,419 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 164#L698-5true, 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:58,419 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,419 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2024-03-11 23:19:58,465 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 64#L688-1true, 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:58,465 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2024-03-11 23:19:58,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:58,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:58,465 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,012 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,012 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,012 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,012 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,012 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,015 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,015 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,015 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,015 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,015 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,016 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][330], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,016 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,044 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, threadThread3of3ForFork0InUse, 9#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,044 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,045 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2024-03-11 23:19:59,154 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1014] L688-6-->threadEXIT: Formula: (and (= (store |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143| (store (select |v_#pthreadsMutex_214| |v_~#threads_alive_mutex~0.base_143|) |v_~#threads_alive_mutex~0.offset_143| 0)) |v_#pthreadsMutex_213|) (= |v_threadThread1of3ForFork0_#res.base_7| 0) (= 0 |v_threadThread1of3ForFork0_#res.offset_7|))  InVars {#pthreadsMutex=|v_#pthreadsMutex_214|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_213|, threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_17|, threadThread1of3ForFork0_#res.base=|v_threadThread1of3ForFork0_#res.base_7|, threadThread1of3ForFork0_#res.offset=|v_threadThread1of3ForFork0_#res.offset_7|, ~#threads_alive_mutex~0.base=|v_~#threads_alive_mutex~0.base_143|, ~#threads_alive_mutex~0.offset=|v_~#threads_alive_mutex~0.offset_143|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread1of3ForFork0_#t~nondet4, threadThread1of3ForFork0_#res.base, threadThread1of3ForFork0_#res.offset][104], [threadThread3of3ForFork0InUse, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 64#L688-1true, 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,154 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,154 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,401 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 35#L701-2true, 64#L688-1true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,401 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,401 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,650 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:19:59,651 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,651 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,652 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:19:59,652 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,670 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][311], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, 18#L698-8true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:59,670 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,677 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:19:59,677 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,677 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,709 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,709 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,709 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,709 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,709 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:19:59,755 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([829] L698-5-->L698-6: Formula: (= |v_ULTIMATE.start_main_#t~nondet9#1_3| |v_#race~threads_alive~0_4|)  InVars {ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|}  OutVars{ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_3|, #race~threads_alive~0=|v_#race~threads_alive~0_4|}  AuxVars[]  AssignedVars[#race~threads_alive~0][13], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 161#L698-6true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 200#true, Black: 208#(= |#race~data~0| 0), 297#(and (<= 0 |ULTIMATE.start_main_#t~post8#1|) (<= 1 ~threads_alive~0)), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:19:59,756 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:19:59,756 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2024-03-11 23:19:59,950 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 7#threadEXITtrue, threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 163#L705-2true])
[2024-03-11 23:19:59,950 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2024-03-11 23:19:59,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:19:59,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:19:59,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,036 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:20:00,036 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,036 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,047 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, 111#L688-5true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:20:00,048 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,048 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:20:00,052 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,052 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:20:00,052 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,052 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,053 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L381   tUnfolder$Statistics]: inserting event number 7 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][81], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:20:00,067 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][336], [threadThread3of3ForFork0InUse, Black: 194#true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse, 23#L688-3true])
[2024-03-11 23:20:00,067 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,098 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([864] L688-4-->L688-5: Formula: (= |v_threadThread3of3ForFork0_#t~nondet4_3| |v_#race~threads_alive~0_13|)  InVars {threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|}  OutVars{threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_3|, #race~threads_alive~0=|v_#race~threads_alive~0_13|}  AuxVars[]  AssignedVars[#race~threads_alive~0][231], [threadThread3of3ForFork0InUse, 111#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), 156#L688-2true, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:20:00,098 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,099 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][128], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 103#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:20:00,099 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,110 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 119#L688-5true, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 129#L690true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:20:00,110 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2024-03-11 23:20:00,119 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([941] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_44| |v_threadThread1of3ForFork0_#t~nondet4_13|)  InVars {}  OutVars{threadThread1of3ForFork0_#t~nondet4=|v_threadThread1of3ForFork0_#t~nondet4_13|, #race~threads_alive~0=|v_#race~threads_alive~0_44|}  AuxVars[]  AssignedVars[threadThread1of3ForFork0_#t~nondet4, #race~threads_alive~0][45], [threadThread3of3ForFork0InUse, 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), 224#true, Black: 196#(= |#race~threads_alive~0| 0), 62#L688-2true, 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 119#L688-5true, 112#threadEXITtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 218#true])
[2024-03-11 23:20:00,119 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,119 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,119 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,119 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,142 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([958] L688-2-->L688-4: Formula: (= (+ 2 v_~threads_alive~0_36) v_~threads_alive~0_37)  InVars {~threads_alive~0=v_~threads_alive~0_37}  OutVars{~threads_alive~0=v_~threads_alive~0_36, threadThread3of3ForFork0_#t~nondet4=|v_threadThread3of3ForFork0_#t~nondet4_15|}  AuxVars[]  AssignedVars[~threads_alive~0, threadThread3of3ForFork0_#t~nondet4][275], [threadThread3of3ForFork0InUse, 75#threadErr2ASSERT_VIOLATIONDATA_RACEtrue, Black: 194#true, 164#L698-5true, 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 57#L688-4true, Black: 208#(= |#race~data~0| 0), 112#threadEXITtrue, Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 245#(<= 0 |ULTIMATE.start_main_#t~post8#1|), threadThread1of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|), threadThread2of3ForFork0InUse])
[2024-03-11 23:20:00,142 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,142 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,142 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,142 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2024-03-11 23:20:00,583 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([984] L688-3-->L688-5: Formula: (= |v_#race~threads_alive~0_50| |v_threadThread2of3ForFork0_#t~nondet4_17|)  InVars {}  OutVars{threadThread2of3ForFork0_#t~nondet4=|v_threadThread2of3ForFork0_#t~nondet4_17|, #race~threads_alive~0=|v_#race~threads_alive~0_50|}  AuxVars[]  AssignedVars[threadThread2of3ForFork0_#t~nondet4, #race~threads_alive~0][222], [threadThread3of3ForFork0InUse, 9#L688-5true, 224#true, Black: 196#(= |#race~threads_alive~0| 0), 218#true, Black: 202#(= |#race~threads_alive~0| |ULTIMATE.start_main_#t~nondet9#1|), 155#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, Black: 208#(= |#race~data~0| 0), Black: 214#(= |#race~data~0| |threadThread1of3ForFork0_#t~nondet2|), 76#L688-6true, 7#threadEXITtrue, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, Black: 220#(= |#race~threads_alive~0| |threadThread1of3ForFork0_#t~nondet4|)])
[2024-03-11 23:20:00,583 INFO  L383   tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2024-03-11 23:20:00,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-11 23:20:00,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-11 23:20:00,583 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2024-03-11 23:20:00,958 INFO  L130       PetriNetUnfolder]: 190525/317152 cut-off events.
[2024-03-11 23:20:00,958 INFO  L131       PetriNetUnfolder]: For 400239/430783 co-relation queries the response was YES.
[2024-03-11 23:20:01,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 899879 conditions, 317152 events. 190525/317152 cut-off events. For 400239/430783 co-relation queries the response was YES. Maximal size of possible extension queue 10515. Compared 3375792 event pairs, 46301 based on Foata normal form. 6530/291400 useless extension candidates. Maximal degree in co-relation 585968. Up to 118861 conditions per place. 
[2024-03-11 23:20:03,100 INFO  L137   encePairwiseOnDemand]: 298/307 looper letters, 268 selfloop transitions, 19 changer transitions 3/353 dead transitions.
[2024-03-11 23:20:03,100 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 353 transitions, 2513 flow
[2024-03-11 23:20:03,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-11 23:20:03,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-11 23:20:03,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions.
[2024-03-11 23:20:03,103 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6342484876686831
[2024-03-11 23:20:03,103 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1363 transitions.
[2024-03-11 23:20:03,103 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1363 transitions.
[2024-03-11 23:20:03,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:03,104 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1363 transitions.
[2024-03-11 23:20:03,106 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 194.71428571428572) internal successors, (1363), 7 states have internal predecessors, (1363), 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)
[2024-03-11 23:20:03,108 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 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)
[2024-03-11 23:20:03,108 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 307.0) internal successors, (2456), 8 states have internal predecessors, (2456), 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)
[2024-03-11 23:20:03,108 INFO  L175             Difference]: Start difference. First operand has 93 places, 138 transitions, 749 flow. Second operand 7 states and 1363 transitions.
[2024-03-11 23:20:03,108 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 353 transitions, 2513 flow
[2024-03-11 23:20:31,111 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 353 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:20:31,114 INFO  L231             Difference]: Finished difference. Result has 100 places, 158 transitions, 817 flow
[2024-03-11 23:20:31,114 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=693, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=817, PETRI_PLACES=100, PETRI_TRANSITIONS=158}
[2024-03-11 23:20:31,114 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 18 predicate places.
[2024-03-11 23:20:31,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 817 flow
[2024-03-11 23:20:31,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 174.8) internal successors, (874), 5 states have internal predecessors, (874), 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)
[2024-03-11 23:20:31,115 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:31,115 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:31,122 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-11 23:20:31,316 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,SelfDestructingSolverStorable22
[2024-03-11 23:20:31,316 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:31,317 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:31,317 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277540627, now seen corresponding path program 1 times
[2024-03-11 23:20:31,317 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:31,317 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883803219]
[2024-03-11 23:20:31,317 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:31,318 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:31,331 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:31,395 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-11 23:20:31,396 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:31,396 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883803219]
[2024-03-11 23:20:31,396 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883803219] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:31,396 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:31,396 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-11 23:20:31,396 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155712803]
[2024-03-11 23:20:31,397 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:31,397 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-11 23:20:31,397 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:31,397 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-11 23:20:31,398 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2024-03-11 23:20:31,509 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 307
[2024-03-11 23:20:31,510 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 158 transitions, 817 flow. Second operand  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 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)
[2024-03-11 23:20:31,510 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:31,510 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 307
[2024-03-11 23:20:31,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:33,696 INFO  L130       PetriNetUnfolder]: 15706/31175 cut-off events.
[2024-03-11 23:20:33,696 INFO  L131       PetriNetUnfolder]: For 23101/23856 co-relation queries the response was YES.
[2024-03-11 23:20:33,787 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 80768 conditions, 31175 events. 15706/31175 cut-off events. For 23101/23856 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 287583 event pairs, 4035 based on Foata normal form. 2989/33084 useless extension candidates. Maximal degree in co-relation 52185. Up to 15852 conditions per place. 
[2024-03-11 23:20:33,884 INFO  L137   encePairwiseOnDemand]: 294/307 looper letters, 68 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2024-03-11 23:20:33,884 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 663 flow
[2024-03-11 23:20:33,885 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 23:20:33,885 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 23:20:33,886 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions.
[2024-03-11 23:20:33,886 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5903908794788274
[2024-03-11 23:20:33,886 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 725 transitions.
[2024-03-11 23:20:33,887 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions.
[2024-03-11 23:20:33,887 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:33,887 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions.
[2024-03-11 23:20:33,888 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 181.25) internal successors, (725), 4 states have internal predecessors, (725), 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)
[2024-03-11 23:20:33,889 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 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)
[2024-03-11 23:20:33,889 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 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)
[2024-03-11 23:20:33,889 INFO  L175             Difference]: Start difference. First operand has 100 places, 158 transitions, 817 flow. Second operand 4 states and 725 transitions.
[2024-03-11 23:20:33,889 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 663 flow
[2024-03-11 23:20:34,054 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 118 transitions, 599 flow, removed 28 selfloop flow, removed 5 redundant places.
[2024-03-11 23:20:34,055 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 363 flow
[2024-03-11 23:20:34,055 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=363, PETRI_PLACES=90, PETRI_TRANSITIONS=93}
[2024-03-11 23:20:34,056 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places.
[2024-03-11 23:20:34,056 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 363 flow
[2024-03-11 23:20:34,056 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 168.4) internal successors, (842), 5 states have internal predecessors, (842), 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)
[2024-03-11 23:20:34,056 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:34,056 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:34,056 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2024-03-11 23:20:34,057 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:34,057 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:34,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 928932594, now seen corresponding path program 1 times
[2024-03-11 23:20:34,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:34,057 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895936294]
[2024-03-11 23:20:34,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:34,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:34,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:34,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-03-11 23:20:34,094 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:34,095 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895936294]
[2024-03-11 23:20:34,095 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895936294] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:34,095 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:34,095 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:20:34,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240649150]
[2024-03-11 23:20:34,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:34,096 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:20:34,096 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:34,096 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:20:34,096 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:20:34,120 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2024-03-11 23:20:34,120 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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)
[2024-03-11 23:20:34,120 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:34,120 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2024-03-11 23:20:34,120 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:35,748 INFO  L130       PetriNetUnfolder]: 12340/24716 cut-off events.
[2024-03-11 23:20:35,748 INFO  L131       PetriNetUnfolder]: For 11913/12428 co-relation queries the response was YES.
[2024-03-11 23:20:35,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 60037 conditions, 24716 events. 12340/24716 cut-off events. For 11913/12428 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 226377 event pairs, 8112 based on Foata normal form. 8/22709 useless extension candidates. Maximal degree in co-relation 39253. Up to 16781 conditions per place. 
[2024-03-11 23:20:35,894 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2024-03-11 23:20:35,895 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 687 flow
[2024-03-11 23:20:35,895 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:20:35,895 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:20:35,896 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2024-03-11 23:20:35,896 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6373507057546145
[2024-03-11 23:20:35,896 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2024-03-11 23:20:35,897 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2024-03-11 23:20:35,897 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:35,897 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2024-03-11 23:20:35,898 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 195.66666666666666) internal successors, (587), 3 states have internal predecessors, (587), 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)
[2024-03-11 23:20:35,898 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:35,899 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:35,899 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 363 flow. Second operand 3 states and 587 transitions.
[2024-03-11 23:20:35,899 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 687 flow
[2024-03-11 23:20:35,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:20:35,912 INFO  L231             Difference]: Finished difference. Result has 91 places, 101 transitions, 448 flow
[2024-03-11 23:20:35,912 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=448, PETRI_PLACES=91, PETRI_TRANSITIONS=101}
[2024-03-11 23:20:35,913 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2024-03-11 23:20:35,913 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 448 flow
[2024-03-11 23:20:35,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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)
[2024-03-11 23:20:35,913 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:35,913 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:35,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-11 23:20:35,913 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:35,914 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:35,914 INFO  L85        PathProgramCache]: Analyzing trace with hash -683014751, now seen corresponding path program 1 times
[2024-03-11 23:20:35,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:35,914 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158944700]
[2024-03-11 23:20:35,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:35,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:35,937 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:35,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-11 23:20:35,968 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:35,968 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158944700]
[2024-03-11 23:20:35,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158944700] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:35,968 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:35,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-11 23:20:35,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288261461]
[2024-03-11 23:20:35,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:35,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:20:35,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:35,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:20:35,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:20:36,004 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2024-03-11 23:20:36,005 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 101 transitions, 448 flow. Second operand  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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)
[2024-03-11 23:20:36,005 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:36,005 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2024-03-11 23:20:36,005 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:39,090 INFO  L130       PetriNetUnfolder]: 25377/49342 cut-off events.
[2024-03-11 23:20:39,090 INFO  L131       PetriNetUnfolder]: For 44120/46312 co-relation queries the response was YES.
[2024-03-11 23:20:39,250 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 128665 conditions, 49342 events. 25377/49342 cut-off events. For 44120/46312 co-relation queries the response was YES. Maximal size of possible extension queue 1426. Compared 488374 event pairs, 4916 based on Foata normal form. 1580/48575 useless extension candidates. Maximal degree in co-relation 92369. Up to 23483 conditions per place. 
[2024-03-11 23:20:39,420 INFO  L137   encePairwiseOnDemand]: 295/307 looper letters, 101 selfloop transitions, 13 changer transitions 0/155 dead transitions.
[2024-03-11 23:20:39,420 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 941 flow
[2024-03-11 23:20:39,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:20:39,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:20:39,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions.
[2024-03-11 23:20:39,422 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6330076004343105
[2024-03-11 23:20:39,422 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 583 transitions.
[2024-03-11 23:20:39,422 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions.
[2024-03-11 23:20:39,423 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:39,423 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions.
[2024-03-11 23:20:39,424 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 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)
[2024-03-11 23:20:39,425 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:39,425 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:39,425 INFO  L175             Difference]: Start difference. First operand has 91 places, 101 transitions, 448 flow. Second operand 3 states and 583 transitions.
[2024-03-11 23:20:39,425 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 941 flow
[2024-03-11 23:20:39,605 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-11 23:20:39,607 INFO  L231             Difference]: Finished difference. Result has 93 places, 111 transitions, 525 flow
[2024-03-11 23:20:39,607 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=525, PETRI_PLACES=93, PETRI_TRANSITIONS=111}
[2024-03-11 23:20:39,608 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2024-03-11 23:20:39,608 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 525 flow
[2024-03-11 23:20:39,608 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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)
[2024-03-11 23:20:39,608 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:39,608 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:39,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-11 23:20:39,608 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:39,609 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:39,609 INFO  L85        PathProgramCache]: Analyzing trace with hash 74336075, now seen corresponding path program 2 times
[2024-03-11 23:20:39,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:39,609 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832341413]
[2024-03-11 23:20:39,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:39,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:39,631 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:39,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:20:39,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:39,691 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832341413]
[2024-03-11 23:20:39,691 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832341413] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-11 23:20:39,691 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965759561]
[2024-03-11 23:20:39,691 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-11 23:20:39,692 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:20:39,692 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-11 23:20:39,692 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)
[2024-03-11 23:20:39,697 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
[2024-03-11 23:20:39,787 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-03-11 23:20:39,787 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-11 23:20:39,788 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core
[2024-03-11 23:20:39,790 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-11 23:20:39,868 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 11 treesize of output 7
[2024-03-11 23:20:39,893 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-11 23:20:39,894 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 14 treesize of output 16
[2024-03-11 23:20:39,906 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2024-03-11 23:20:39,906 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-11 23:20:39,917 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_496 (Array Int Int))) (not (= (select (select (store |c_#pthreadsMutex| |c_~#threads_alive_mutex~0.base| v_ArrVal_496) |c_~#data_mutex~0.base|) |c_~#data_mutex~0.offset|) 0))) is different from false
[2024-03-11 23:20:39,928 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-11 23:20:39,929 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20
[2024-03-11 23:20:39,931 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 33 treesize of output 25
[2024-03-11 23:20:39,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 1 not checked.
[2024-03-11 23:20:39,956 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965759561] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-11 23:20:39,956 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-11 23:20:39,956 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2024-03-11 23:20:39,956 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577306420]
[2024-03-11 23:20:39,956 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-11 23:20:39,956 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-11 23:20:39,956 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:39,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-11 23:20:39,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=45, Unknown=1, NotChecked=14, Total=90
[2024-03-11 23:20:39,984 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 152 out of 307
[2024-03-11 23:20:39,985 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 525 flow. Second operand  has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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)
[2024-03-11 23:20:39,985 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:39,985 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 307
[2024-03-11 23:20:39,985 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:41,344 INFO  L130       PetriNetUnfolder]: 7828/17729 cut-off events.
[2024-03-11 23:20:41,344 INFO  L131       PetriNetUnfolder]: For 17071/17866 co-relation queries the response was YES.
[2024-03-11 23:20:41,384 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50123 conditions, 17729 events. 7828/17729 cut-off events. For 17071/17866 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 170474 event pairs, 2777 based on Foata normal form. 979/17815 useless extension candidates. Maximal degree in co-relation 25184. Up to 10879 conditions per place. 
[2024-03-11 23:20:41,431 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 81 selfloop transitions, 12 changer transitions 0/131 dead transitions.
[2024-03-11 23:20:41,431 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 131 transitions, 754 flow
[2024-03-11 23:20:41,432 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-11 23:20:41,432 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-11 23:20:41,433 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions.
[2024-03-11 23:20:41,433 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5513029315960912
[2024-03-11 23:20:41,434 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 677 transitions.
[2024-03-11 23:20:41,434 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions.
[2024-03-11 23:20:41,434 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:41,434 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions.
[2024-03-11 23:20:41,435 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 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)
[2024-03-11 23:20:41,436 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 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)
[2024-03-11 23:20:41,436 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 307.0) internal successors, (1535), 5 states have internal predecessors, (1535), 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)
[2024-03-11 23:20:41,436 INFO  L175             Difference]: Start difference. First operand has 93 places, 111 transitions, 525 flow. Second operand 4 states and 677 transitions.
[2024-03-11 23:20:41,436 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 131 transitions, 754 flow
[2024-03-11 23:20:41,452 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 131 transitions, 737 flow, removed 2 selfloop flow, removed 1 redundant places.
[2024-03-11 23:20:41,454 INFO  L231             Difference]: Finished difference. Result has 95 places, 101 transitions, 454 flow
[2024-03-11 23:20:41,454 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=95, PETRI_TRANSITIONS=101}
[2024-03-11 23:20:41,454 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2024-03-11 23:20:41,454 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 454 flow
[2024-03-11 23:20:41,454 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 155.5) internal successors, (1555), 10 states have internal predecessors, (1555), 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)
[2024-03-11 23:20:41,454 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:41,454 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:41,464 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-11 23:20:41,655 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-11 23:20:41,655 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:41,656 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:41,656 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830676315, now seen corresponding path program 1 times
[2024-03-11 23:20:41,656 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:41,656 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575868997]
[2024-03-11 23:20:41,657 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:41,657 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:41,671 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:41,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-03-11 23:20:41,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:41,685 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575868997]
[2024-03-11 23:20:41,685 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575868997] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:41,685 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:41,685 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:20:41,686 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934063542]
[2024-03-11 23:20:41,686 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:41,686 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:20:41,686 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:41,686 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:20:41,686 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:20:41,728 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2024-03-11 23:20:41,729 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 454 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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)
[2024-03-11 23:20:41,729 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:41,729 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2024-03-11 23:20:41,729 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:43,015 INFO  L130       PetriNetUnfolder]: 7661/17723 cut-off events.
[2024-03-11 23:20:43,015 INFO  L131       PetriNetUnfolder]: For 18667/19190 co-relation queries the response was YES.
[2024-03-11 23:20:43,056 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 50483 conditions, 17723 events. 7661/17723 cut-off events. For 18667/19190 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 171596 event pairs, 5125 based on Foata normal form. 1/16720 useless extension candidates. Maximal degree in co-relation 26943. Up to 12759 conditions per place. 
[2024-03-11 23:20:43,101 INFO  L137   encePairwiseOnDemand]: 304/307 looper letters, 72 selfloop transitions, 2 changer transitions 3/118 dead transitions.
[2024-03-11 23:20:43,101 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 118 transitions, 707 flow
[2024-03-11 23:20:43,102 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:20:43,102 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:20:43,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2024-03-11 23:20:43,103 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6069489685124865
[2024-03-11 23:20:43,103 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2024-03-11 23:20:43,104 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2024-03-11 23:20:43,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:43,104 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2024-03-11 23:20:43,105 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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)
[2024-03-11 23:20:43,105 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:43,106 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:43,106 INFO  L175             Difference]: Start difference. First operand has 95 places, 101 transitions, 454 flow. Second operand 3 states and 559 transitions.
[2024-03-11 23:20:43,106 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 118 transitions, 707 flow
[2024-03-11 23:20:43,123 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 118 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:20:43,124 INFO  L231             Difference]: Finished difference. Result has 94 places, 100 transitions, 444 flow
[2024-03-11 23:20:43,125 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=94, PETRI_TRANSITIONS=100}
[2024-03-11 23:20:43,125 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 12 predicate places.
[2024-03-11 23:20:43,125 INFO  L495      AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 444 flow
[2024-03-11 23:20:43,125 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 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)
[2024-03-11 23:20:43,125 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:43,125 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:43,125 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-11 23:20:43,125 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:43,125 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:43,126 INFO  L85        PathProgramCache]: Analyzing trace with hash 1793748985, now seen corresponding path program 1 times
[2024-03-11 23:20:43,126 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:43,126 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132923425]
[2024-03-11 23:20:43,126 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:43,126 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:43,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:43,156 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked.
[2024-03-11 23:20:43,156 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:43,156 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132923425]
[2024-03-11 23:20:43,156 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132923425] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:43,156 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:43,156 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:20:43,156 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914493314]
[2024-03-11 23:20:43,156 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:43,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:20:43,157 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:43,157 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:20:43,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:20:43,176 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2024-03-11 23:20:43,177 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 444 flow. Second operand  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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)
[2024-03-11 23:20:43,177 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:43,177 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2024-03-11 23:20:43,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-11 23:20:44,534 INFO  L130       PetriNetUnfolder]: 6863/16556 cut-off events.
[2024-03-11 23:20:44,534 INFO  L131       PetriNetUnfolder]: For 15647/15802 co-relation queries the response was YES.
[2024-03-11 23:20:44,579 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 46618 conditions, 16556 events. 6863/16556 cut-off events. For 15647/15802 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 164442 event pairs, 4421 based on Foata normal form. 4/15578 useless extension candidates. Maximal degree in co-relation 26713. Up to 11071 conditions per place. 
[2024-03-11 23:20:44,622 INFO  L137   encePairwiseOnDemand]: 303/307 looper letters, 77 selfloop transitions, 4 changer transitions 0/124 dead transitions.
[2024-03-11 23:20:44,622 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 124 transitions, 705 flow
[2024-03-11 23:20:44,622 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-11 23:20:44,623 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-11 23:20:44,623 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 578 transitions.
[2024-03-11 23:20:44,624 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6275787187839305
[2024-03-11 23:20:44,624 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 578 transitions.
[2024-03-11 23:20:44,624 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 578 transitions.
[2024-03-11 23:20:44,624 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-11 23:20:44,624 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 578 transitions.
[2024-03-11 23:20:44,625 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 192.66666666666666) internal successors, (578), 3 states have internal predecessors, (578), 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)
[2024-03-11 23:20:44,626 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:44,626 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 307.0) internal successors, (1228), 4 states have internal predecessors, (1228), 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)
[2024-03-11 23:20:44,626 INFO  L175             Difference]: Start difference. First operand has 94 places, 100 transitions, 444 flow. Second operand 3 states and 578 transitions.
[2024-03-11 23:20:44,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 124 transitions, 705 flow
[2024-03-11 23:20:44,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 124 transitions, 697 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-11 23:20:44,646 INFO  L231             Difference]: Finished difference. Result has 95 places, 102 transitions, 468 flow
[2024-03-11 23:20:44,646 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=95, PETRI_TRANSITIONS=102}
[2024-03-11 23:20:44,646 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2024-03-11 23:20:44,646 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 102 transitions, 468 flow
[2024-03-11 23:20:44,646 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.66666666666666) internal successors, (536), 3 states have internal predecessors, (536), 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)
[2024-03-11 23:20:44,647 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:44,647 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2024-03-11 23:20:44,647 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-11 23:20:44,647 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-11 23:20:44,647 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:44,647 INFO  L85        PathProgramCache]: Analyzing trace with hash 2137542505, now seen corresponding path program 1 times
[2024-03-11 23:20:44,647 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:44,647 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052759487]
[2024-03-11 23:20:44,647 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:44,647 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:44,665 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:20:44,665 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-11 23:20:44,675 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-11 23:20:44,682 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-11 23:20:44,682 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-11 23:20:44,682 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-11 23:20:44,682 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-11 23:20:44,683 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-11 23:20:44,684 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-11 23:20:44,684 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-11 23:20:44,684 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-11 23:20:44,684 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-11 23:20:44,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-11 23:20:44,684 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-11 23:20:44,684 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-11 23:20:44,684 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2024-03-11 23:20:44,703 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-03-11 23:20:44,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,735 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2024-03-11 23:20:44,735 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2024-03-11 23:20:44,736 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2024-03-11 23:20:44,737 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,738 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,738 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-11 23:20:44,739 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,739 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 215 transitions, 462 flow
[2024-03-11 23:20:44,771 INFO  L130       PetriNetUnfolder]: 16/429 cut-off events.
[2024-03-11 23:20:44,772 INFO  L131       PetriNetUnfolder]: For 16/16 co-relation queries the response was YES.
[2024-03-11 23:20:44,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 452 conditions, 429 events. 16/429 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 640 event pairs, 0 based on Foata normal form. 0/372 useless extension candidates. Maximal degree in co-relation 352. Up to 10 conditions per place. 
[2024-03-11 23:20:44,783 INFO  L119        LiptonReduction]: Number of co-enabled transitions 20696
[2024-03-11 23:20:48,130 INFO  L134        LiptonReduction]: Checked pairs total: 99608
[2024-03-11 23:20:48,130 INFO  L136        LiptonReduction]: Total number of compositions: 130
[2024-03-11 23:20:48,131 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-11 23:20:48,132 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;@3b31b2e8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-11 23:20:48,132 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 21 error locations.
[2024-03-11 23:20:48,132 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2024-03-11 23:20:48,133 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-11 23:20:48,133 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-11 23:20:48,133 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2024-03-11 23:20:48,133 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 18 more)] ===
[2024-03-11 23:20:48,133 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-11 23:20:48,133 INFO  L85        PathProgramCache]: Analyzing trace with hash 44451972, now seen corresponding path program 1 times
[2024-03-11 23:20:48,133 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-11 23:20:48,133 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724608327]
[2024-03-11 23:20:48,133 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-11 23:20:48,133 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-11 23:20:48,137 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-11 23:20:48,144 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-11 23:20:48,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-11 23:20:48,145 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724608327]
[2024-03-11 23:20:48,145 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724608327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-11 23:20:48,145 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-11 23:20:48,145 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-11 23:20:48,145 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091163041]
[2024-03-11 23:20:48,145 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-11 23:20:48,145 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-11 23:20:48,145 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-11 23:20:48,145 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-11 23:20:48,145 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-11 23:20:48,190 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 345
[2024-03-11 23:20:48,190 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 93 transitions, 218 flow. Second operand  has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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)
[2024-03-11 23:20:48,190 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-11 23:20:48,190 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 345
[2024-03-11 23:20:48,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
