./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 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:26:21,611 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:26:21,612 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:26:21,670 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:26:21,670 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:26:21,686 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:26:21,687 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:26:21,689 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:26:21,691 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:26:21,694 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:26:21,696 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:26:21,697 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:26:21,697 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:26:21,699 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:26:21,700 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:26:21,701 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:26:21,703 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:26:21,703 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:26:21,704 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:26:21,708 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:26:21,709 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:26:21,727 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:26:21,728 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:26:21,729 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:26:21,737 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:26:21,738 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:26:21,738 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:26:21,740 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:26:21,740 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:26:21,742 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:26:21,742 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:26:21,743 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:26:21,744 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:26:21,745 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:26:21,746 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:26:21,746 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:26:21,746 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:26:21,747 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:26:21,747 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:26:21,748 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:26:21,749 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:26:21,750 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:26:21,794 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:26:21,795 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:26:21,795 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:26:21,796 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:26:21,796 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:26:21,797 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:26:21,797 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:26:21,809 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:26:21,809 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:26:21,810 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:26:21,810 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:26:21,811 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:26:21,811 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:26:21,811 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:26:21,811 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:26:21,811 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:26:21,812 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:26:21,813 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:26:21,813 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:26:21,813 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:26:21,813 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:21,813 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:26:21,814 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:26:21,814 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:26:21,814 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:26:21,814 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:26:21,815 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:26:21,815 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:26:21,815 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:26:21,815 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:26:21,815 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:26:21,816 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 -> 5c4d9327c15cdd6f8cbe544af68182476337b21d5bfe21353a45ea7b3e2e4c4c
[2023-10-25 15:26:22,212 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:26:22,234 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:26:22,236 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:26:22,237 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:26:22,237 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:26:22,238 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
[2023-10-25 15:26:24,100 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:26:24,470 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:26:24,477 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-10-25 15:26:24,492 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6ed93d5af/24b04cc03f7f46c19d0d2e0a1f1ab9f2/FLAGa16e9517b
[2023-10-25 15:26:24,530 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/6ed93d5af/24b04cc03f7f46c19d0d2e0a1f1ab9f2
[2023-10-25 15:26:24,533 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:26:24,534 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:26:24,537 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:24,537 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:26:24,539 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:26:24,540 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:24" (1/1) ...
[2023-10-25 15:26:24,546 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f94a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:24, skipping insertion in model container
[2023-10-25 15:26:24,547 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:26:24" (1/1) ...
[2023-10-25 15:26:24,552 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:26:24,631 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:26:25,066 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:25,070 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:25,098 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:26:25,166 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-25 15:26:25,173 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:26:25,239 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:26:25,245 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25 WrapperNode
[2023-10-25 15:26:25,245 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:26:25,246 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:25,247 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:26:25,247 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:26:25,265 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,296 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,322 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2023-10-25 15:26:25,328 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:26:25,340 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:26:25,340 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:26:25,341 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:26:25,347 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,348 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,350 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,351 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,372 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,388 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,396 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,397 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,399 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:26:25,400 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:26:25,410 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:26:25,410 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:26:25,411 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (1/1) ...
[2023-10-25 15:26:25,415 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:26:25,437 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:25,466 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:26:25,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
[2023-10-25 15:26:25,523 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:26:25,523 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:26:25,525 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:26:25,527 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:26:25,527 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-25 15:26:25,527 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:26:25,528 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-10-25 15:26:25,528 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:26:25,528 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:26:25,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:26:25,528 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:26:25,528 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:26:25,530 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:26:25,765 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:26:25,783 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:26:26,168 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:26:26,174 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:26:26,193 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:26:26,195 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:26 BoogieIcfgContainer
[2023-10-25 15:26:26,196 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:26:26,198 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:26:26,199 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:26:26,201 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:26:26,201 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:26:24" (1/3) ...
[2023-10-25 15:26:26,203 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614a40a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:26, skipping insertion in model container
[2023-10-25 15:26:26,203 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:26:25" (2/3) ...
[2023-10-25 15:26:26,203 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614a40a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:26:26, skipping insertion in model container
[2023-10-25 15:26:26,203 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:26:26" (3/3) ...
[2023-10-25 15:26:26,204 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2023-10-25 15:26:26,231 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:26:26,238 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:26:26,238 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-25 15:26:26,238 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:26:26,353 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:26,403 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,538 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-25 15:26:26,539 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:26,544 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. 
[2023-10-25 15:26:26,559 INFO  L82        GeneralOperation]: Start removeDead. Operand has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,564 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,566 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:26,573 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,586 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,587 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-25 15:26:26,660 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-25 15:26:26,660 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:26,662 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. 
[2023-10-25 15:26:26,665 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3068
[2023-10-25 15:26:30,963 INFO  L134        LiptonReduction]: Checked pairs total: 11184
[2023-10-25 15:26:30,963 INFO  L136        LiptonReduction]: Total number of compositions: 98
[2023-10-25 15:26:30,987 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:31,015 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;@797f4af6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:31,015 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-25 15:26:31,018 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-25 15:26:31,018 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:31,018 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:31,018 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:26:31,019 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)] ===
[2023-10-25 15:26:31,024 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:31,024 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631503, now seen corresponding path program 1 times
[2023-10-25 15:26:31,040 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:31,040 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106546620]
[2023-10-25 15:26:31,041 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:31,041 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:31,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:31,390 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:31,390 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:31,390 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106546620]
[2023-10-25 15:26:31,391 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106546620] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:31,391 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:31,391 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:31,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509440454]
[2023-10-25 15:26:31,393 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:31,399 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:31,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:31,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:31,431 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:31,488 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 232
[2023-10-25 15:26:31,491 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)
[2023-10-25 15:26:31,492 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:31,492 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 232
[2023-10-25 15:26:31,493 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:31,665 INFO  L130       PetriNetUnfolder]: 134/429 cut-off events.
[2023-10-25 15:26:31,666 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:31,669 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. 
[2023-10-25 15:26:31,673 INFO  L137   encePairwiseOnDemand]: 219/232 looper letters, 39 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2023-10-25 15:26:31,673 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 225 flow
[2023-10-25 15:26:31,674 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:31,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:31,701 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2023-10-25 15:26:31,704 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5905172413793104
[2023-10-25 15:26:31,705 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2023-10-25 15:26:31,706 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2023-10-25 15:26:31,709 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:31,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2023-10-25 15:26:31,715 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)
[2023-10-25 15:26:31,720 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)
[2023-10-25 15:26:31,720 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)
[2023-10-25 15:26:31,722 INFO  L175             Difference]: Start difference. First operand has 45 places, 44 transitions, 93 flow. Second operand 3 states and 411 transitions.
[2023-10-25 15:26:31,731 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 225 flow
[2023-10-25 15:26:31,732 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:31,734 INFO  L231             Difference]: Finished difference. Result has 48 places, 50 transitions, 159 flow
[2023-10-25 15:26:31,736 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}
[2023-10-25 15:26:31,738 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-10-25 15:26:31,753 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 159 flow
[2023-10-25 15:26:31,754 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)
[2023-10-25 15:26:31,754 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:31,754 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:31,755 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:26:31,755 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)] ===
[2023-10-25 15:26:31,757 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:31,757 INFO  L85        PathProgramCache]: Analyzing trace with hash 750408184, now seen corresponding path program 1 times
[2023-10-25 15:26:31,759 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:31,760 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730322502]
[2023-10-25 15:26:31,760 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:31,760 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:31,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:31,868 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:31,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:31,869 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730322502]
[2023-10-25 15:26:31,869 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730322502] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:31,870 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:31,870 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:31,870 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647089226]
[2023-10-25 15:26:31,870 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:31,871 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:31,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:31,872 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:31,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:31,883 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 232
[2023-10-25 15:26:31,885 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)
[2023-10-25 15:26:31,890 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:31,890 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 232
[2023-10-25 15:26:31,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:32,018 INFO  L130       PetriNetUnfolder]: 121/425 cut-off events.
[2023-10-25 15:26:32,019 INFO  L131       PetriNetUnfolder]: For 122/125 co-relation queries the response was YES.
[2023-10-25 15:26:32,019 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. 
[2023-10-25 15:26:32,022 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 2/59 dead transitions.
[2023-10-25 15:26:32,022 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 249 flow
[2023-10-25 15:26:32,022 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:32,022 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:32,023 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2023-10-25 15:26:32,023 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5876436781609196
[2023-10-25 15:26:32,023 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2023-10-25 15:26:32,023 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2023-10-25 15:26:32,024 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:32,024 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2023-10-25 15:26:32,025 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)
[2023-10-25 15:26:32,027 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)
[2023-10-25 15:26:32,027 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)
[2023-10-25 15:26:32,027 INFO  L175             Difference]: Start difference. First operand has 48 places, 50 transitions, 159 flow. Second operand 3 states and 409 transitions.
[2023-10-25 15:26:32,027 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 249 flow
[2023-10-25 15:26:32,031 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:32,032 INFO  L231             Difference]: Finished difference. Result has 50 places, 52 transitions, 165 flow
[2023-10-25 15:26:32,032 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}
[2023-10-25 15:26:32,033 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places.
[2023-10-25 15:26:32,033 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 165 flow
[2023-10-25 15:26:32,034 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)
[2023-10-25 15:26:32,034 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:32,034 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:32,034 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:26:32,034 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)] ===
[2023-10-25 15:26:32,036 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:32,036 INFO  L85        PathProgramCache]: Analyzing trace with hash 439345902, now seen corresponding path program 1 times
[2023-10-25 15:26:32,037 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:32,037 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001973253]
[2023-10-25 15:26:32,038 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:32,039 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:32,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:32,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:32,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:32,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001973253]
[2023-10-25 15:26:32,119 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001973253] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:32,119 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:32,119 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:32,120 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495368590]
[2023-10-25 15:26:32,120 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:32,121 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:32,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:32,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:32,129 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:32,174 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 232
[2023-10-25 15:26:32,175 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)
[2023-10-25 15:26:32,175 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:32,175 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 232
[2023-10-25 15:26:32,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:32,271 INFO  L130       PetriNetUnfolder]: 120/423 cut-off events.
[2023-10-25 15:26:32,271 INFO  L131       PetriNetUnfolder]: For 82/87 co-relation queries the response was YES.
[2023-10-25 15:26:32,272 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. 
[2023-10-25 15:26:32,282 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2023-10-25 15:26:32,282 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 267 flow
[2023-10-25 15:26:32,283 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:32,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:32,283 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions.
[2023-10-25 15:26:32,284 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5617816091954023
[2023-10-25 15:26:32,284 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 391 transitions.
[2023-10-25 15:26:32,284 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions.
[2023-10-25 15:26:32,284 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:32,284 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions.
[2023-10-25 15:26:32,285 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)
[2023-10-25 15:26:32,286 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)
[2023-10-25 15:26:32,287 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)
[2023-10-25 15:26:32,287 INFO  L175             Difference]: Start difference. First operand has 50 places, 52 transitions, 165 flow. Second operand 3 states and 391 transitions.
[2023-10-25 15:26:32,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 267 flow
[2023-10-25 15:26:32,289 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:32,291 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 215 flow
[2023-10-25 15:26:32,291 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}
[2023-10-25 15:26:32,306 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2023-10-25 15:26:32,308 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 215 flow
[2023-10-25 15:26:32,309 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)
[2023-10-25 15:26:32,309 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:32,309 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:32,309 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:26:32,310 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 9 more)] ===
[2023-10-25 15:26:32,310 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:32,310 INFO  L85        PathProgramCache]: Analyzing trace with hash 969654521, now seen corresponding path program 1 times
[2023-10-25 15:26:32,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:32,311 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646160602]
[2023-10-25 15:26:32,311 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:32,311 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:32,336 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:32,404 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:32,404 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:32,404 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646160602]
[2023-10-25 15:26:32,404 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646160602] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:32,405 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:32,405 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:32,405 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235254948]
[2023-10-25 15:26:32,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:32,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:32,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:32,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:32,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:32,416 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 232
[2023-10-25 15:26:32,417 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)
[2023-10-25 15:26:32,417 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:32,417 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 232
[2023-10-25 15:26:32,418 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:32,515 INFO  L130       PetriNetUnfolder]: 117/389 cut-off events.
[2023-10-25 15:26:32,517 INFO  L131       PetriNetUnfolder]: For 191/207 co-relation queries the response was YES.
[2023-10-25 15:26:32,518 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. 
[2023-10-25 15:26:32,519 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 36 selfloop transitions, 4 changer transitions 0/68 dead transitions.
[2023-10-25 15:26:32,519 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow
[2023-10-25 15:26:32,520 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:32,520 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:32,521 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-10-25 15:26:32,521 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5804597701149425
[2023-10-25 15:26:32,521 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-10-25 15:26:32,522 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-10-25 15:26:32,533 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:32,533 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-10-25 15:26:32,534 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)
[2023-10-25 15:26:32,535 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)
[2023-10-25 15:26:32,536 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)
[2023-10-25 15:26:32,536 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 215 flow. Second operand 3 states and 404 transitions.
[2023-10-25 15:26:32,540 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow
[2023-10-25 15:26:32,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:32,544 INFO  L231             Difference]: Finished difference. Result has 53 places, 59 transitions, 225 flow
[2023-10-25 15:26:32,544 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}
[2023-10-25 15:26:32,546 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2023-10-25 15:26:32,546 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 225 flow
[2023-10-25 15:26:32,546 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)
[2023-10-25 15:26:32,546 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:32,546 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:26:32,546 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:26:32,547 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)] ===
[2023-10-25 15:26:32,547 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:32,547 INFO  L85        PathProgramCache]: Analyzing trace with hash 598293283, now seen corresponding path program 1 times
[2023-10-25 15:26:32,547 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:32,548 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334284634]
[2023-10-25 15:26:32,548 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:32,548 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:32,624 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:32,624 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:32,660 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:32,705 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:32,705 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:32,706 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-10-25 15:26:32,708 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-10-25 15:26:32,708 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-10-25 15:26:32,708 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-10-25 15:26:32,709 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-10-25 15:26:32,709 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-10-25 15:26:32,709 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-10-25 15:26:32,709 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-10-25 15:26:32,710 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-10-25 15:26:32,710 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-10-25 15:26:32,710 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-10-25 15:26:32,710 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-10-25 15:26:32,710 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:26:32,711 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-25 15:26:32,714 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:26:32,714 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:26:32,827 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:32,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,852 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-25 15:26:32,863 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:32,864 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. 
[2023-10-25 15:26:32,864 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,866 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,881 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:32,881 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,882 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,882 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-25 15:26:32,916 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-25 15:26:32,916 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-25 15:26:32,917 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. 
[2023-10-25 15:26:32,920 INFO  L119        LiptonReduction]: Number of co-enabled transitions 7540
[2023-10-25 15:26:36,805 INFO  L134        LiptonReduction]: Checked pairs total: 34782
[2023-10-25 15:26:36,805 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2023-10-25 15:26:36,807 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:36,807 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;@797f4af6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:36,807 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-25 15:26:36,808 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-25 15:26:36,808 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:36,809 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:36,809 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:26:36,809 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)] ===
[2023-10-25 15:26:36,825 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:36,825 INFO  L85        PathProgramCache]: Analyzing trace with hash 22736524, now seen corresponding path program 1 times
[2023-10-25 15:26:36,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:36,826 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382668008]
[2023-10-25 15:26:36,826 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:36,826 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:36,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:36,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:36,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:36,861 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382668008]
[2023-10-25 15:26:36,861 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382668008] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:36,861 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:36,861 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:36,862 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916852334]
[2023-10-25 15:26:36,862 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:36,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:36,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:36,863 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:36,863 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:36,893 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2023-10-25 15:26:36,893 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)
[2023-10-25 15:26:36,894 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:36,894 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2023-10-25 15:26:36,894 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:37,969 INFO  L130       PetriNetUnfolder]: 4106/7967 cut-off events.
[2023-10-25 15:26:37,969 INFO  L131       PetriNetUnfolder]: For 57/57 co-relation queries the response was YES.
[2023-10-25 15:26:37,994 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. 
[2023-10-25 15:26:38,042 INFO  L137   encePairwiseOnDemand]: 252/269 looper letters, 61 selfloop transitions, 11 changer transitions 0/92 dead transitions.
[2023-10-25 15:26:38,042 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 345 flow
[2023-10-25 15:26:38,042 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:38,043 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:38,043 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-25 15:26:38,044 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-25 15:26:38,044 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-25 15:26:38,044 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-25 15:26:38,044 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:38,044 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-25 15:26:38,045 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)
[2023-10-25 15:26:38,046 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)
[2023-10-25 15:26:38,047 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)
[2023-10-25 15:26:38,061 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2023-10-25 15:26:38,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 345 flow
[2023-10-25 15:26:38,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 343 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:38,065 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 224 flow
[2023-10-25 15:26:38,065 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}
[2023-10-25 15:26:38,068 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places.
[2023-10-25 15:26:38,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 224 flow
[2023-10-25 15:26:38,071 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)
[2023-10-25 15:26:38,071 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:38,071 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:38,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:26:38,072 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)] ===
[2023-10-25 15:26:38,072 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:38,072 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006456856, now seen corresponding path program 1 times
[2023-10-25 15:26:38,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:38,072 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176349208]
[2023-10-25 15:26:38,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:38,073 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:38,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:38,100 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:38,100 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:38,100 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176349208]
[2023-10-25 15:26:38,100 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176349208] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:38,100 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:38,101 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:38,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40689879]
[2023-10-25 15:26:38,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:38,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:38,104 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:38,105 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:38,105 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:38,116 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2023-10-25 15:26:38,117 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)
[2023-10-25 15:26:38,117 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:38,117 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2023-10-25 15:26:38,117 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:39,142 INFO  L130       PetriNetUnfolder]: 3685/7514 cut-off events.
[2023-10-25 15:26:39,150 INFO  L131       PetriNetUnfolder]: For 2646/3130 co-relation queries the response was YES.
[2023-10-25 15:26:39,174 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. 
[2023-10-25 15:26:39,227 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 50 selfloop transitions, 4 changer transitions 0/90 dead transitions.
[2023-10-25 15:26:39,232 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 384 flow
[2023-10-25 15:26:39,232 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:39,232 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:39,233 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-25 15:26:39,233 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-25 15:26:39,233 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-25 15:26:39,233 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-25 15:26:39,234 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:39,234 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-25 15:26:39,235 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)
[2023-10-25 15:26:39,236 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)
[2023-10-25 15:26:39,237 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)
[2023-10-25 15:26:39,249 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 224 flow. Second operand 3 states and 503 transitions.
[2023-10-25 15:26:39,249 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 384 flow
[2023-10-25 15:26:39,256 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:39,257 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 232 flow
[2023-10-25 15:26:39,257 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}
[2023-10-25 15:26:39,258 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places.
[2023-10-25 15:26:39,259 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 232 flow
[2023-10-25 15:26:39,267 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)
[2023-10-25 15:26:39,267 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:39,267 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:39,268 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:26:39,268 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)] ===
[2023-10-25 15:26:39,268 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:39,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -420520761, now seen corresponding path program 1 times
[2023-10-25 15:26:39,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:39,269 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736468072]
[2023-10-25 15:26:39,269 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:39,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:39,285 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:39,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:39,304 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:39,304 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736468072]
[2023-10-25 15:26:39,304 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736468072] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:39,305 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:39,305 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:39,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867863497]
[2023-10-25 15:26:39,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:39,305 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:39,305 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:39,306 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:39,306 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:39,342 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 269
[2023-10-25 15:26:39,343 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)
[2023-10-25 15:26:39,344 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:39,344 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 269
[2023-10-25 15:26:39,344 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:40,451 INFO  L130       PetriNetUnfolder]: 3968/7815 cut-off events.
[2023-10-25 15:26:40,465 INFO  L131       PetriNetUnfolder]: For 1629/1907 co-relation queries the response was YES.
[2023-10-25 15:26:40,504 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. 
[2023-10-25 15:26:40,540 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 51 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2023-10-25 15:26:40,541 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 422 flow
[2023-10-25 15:26:40,541 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:40,541 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:40,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2023-10-25 15:26:40,703 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5997521685254027
[2023-10-25 15:26:40,704 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2023-10-25 15:26:40,704 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2023-10-25 15:26:40,704 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:40,704 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2023-10-25 15:26:40,705 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)
[2023-10-25 15:26:40,706 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)
[2023-10-25 15:26:40,706 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)
[2023-10-25 15:26:40,706 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 232 flow. Second operand 3 states and 484 transitions.
[2023-10-25 15:26:40,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 422 flow
[2023-10-25 15:26:40,711 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:40,714 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 330 flow
[2023-10-25 15:26:40,714 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}
[2023-10-25 15:26:40,715 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2023-10-25 15:26:40,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 330 flow
[2023-10-25 15:26:40,715 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)
[2023-10-25 15:26:40,715 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:40,716 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:40,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:26:40,716 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:40,716 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:40,716 INFO  L85        PathProgramCache]: Analyzing trace with hash 777101591, now seen corresponding path program 1 times
[2023-10-25 15:26:40,717 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:40,717 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290844452]
[2023-10-25 15:26:40,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:40,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:40,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:40,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:40,772 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:40,772 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290844452]
[2023-10-25 15:26:40,772 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290844452] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:40,772 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:40,772 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:40,773 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728206959]
[2023-10-25 15:26:40,773 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:40,773 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:40,773 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:40,773 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:40,774 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:40,787 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-25 15:26:40,788 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)
[2023-10-25 15:26:40,788 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:40,788 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-25 15:26:40,788 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:41,832 INFO  L130       PetriNetUnfolder]: 4157/8465 cut-off events.
[2023-10-25 15:26:41,832 INFO  L131       PetriNetUnfolder]: For 5135/6762 co-relation queries the response was YES.
[2023-10-25 15:26:41,852 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. 
[2023-10-25 15:26:41,943 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 63 selfloop transitions, 6 changer transitions 0/111 dead transitions.
[2023-10-25 15:26:41,944 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 571 flow
[2023-10-25 15:26:41,944 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:41,944 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:41,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions.
[2023-10-25 15:26:41,945 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6183395291201983
[2023-10-25 15:26:41,945 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 499 transitions.
[2023-10-25 15:26:41,945 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions.
[2023-10-25 15:26:41,946 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:41,946 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions.
[2023-10-25 15:26:41,947 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)
[2023-10-25 15:26:41,947 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)
[2023-10-25 15:26:41,948 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)
[2023-10-25 15:26:41,948 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 330 flow. Second operand 3 states and 499 transitions.
[2023-10-25 15:26:41,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 571 flow
[2023-10-25 15:26:41,955 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:41,956 INFO  L231             Difference]: Finished difference. Result has 72 places, 87 transitions, 348 flow
[2023-10-25 15:26:41,956 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}
[2023-10-25 15:26:41,957 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places.
[2023-10-25 15:26:41,958 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 348 flow
[2023-10-25 15:26:41,958 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)
[2023-10-25 15:26:41,958 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:41,958 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]
[2023-10-25 15:26:41,958 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-25 15:26:41,958 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:41,959 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:41,959 INFO  L85        PathProgramCache]: Analyzing trace with hash 1261976369, now seen corresponding path program 1 times
[2023-10-25 15:26:41,959 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:41,959 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519639008]
[2023-10-25 15:26:41,959 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:41,959 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:41,979 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:42,014 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:42,014 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:42,014 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519639008]
[2023-10-25 15:26:42,015 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519639008] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:42,015 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:42,015 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:42,015 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843618911]
[2023-10-25 15:26:42,015 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:42,016 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:42,021 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:42,021 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:42,022 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:42,059 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-25 15:26:42,059 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)
[2023-10-25 15:26:42,059 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:42,059 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-25 15:26:42,059 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:43,302 INFO  L130       PetriNetUnfolder]: 6039/11385 cut-off events.
[2023-10-25 15:26:43,302 INFO  L131       PetriNetUnfolder]: For 6574/7585 co-relation queries the response was YES.
[2023-10-25 15:26:43,337 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. 
[2023-10-25 15:26:43,406 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2023-10-25 15:26:43,406 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 661 flow
[2023-10-25 15:26:43,406 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:43,407 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:43,407 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions.
[2023-10-25 15:26:43,413 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.61090458488228
[2023-10-25 15:26:43,413 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 493 transitions.
[2023-10-25 15:26:43,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions.
[2023-10-25 15:26:43,414 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:43,414 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions.
[2023-10-25 15:26:43,415 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)
[2023-10-25 15:26:43,416 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)
[2023-10-25 15:26:43,416 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)
[2023-10-25 15:26:43,416 INFO  L175             Difference]: Start difference. First operand has 72 places, 87 transitions, 348 flow. Second operand 3 states and 493 transitions.
[2023-10-25 15:26:43,416 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 661 flow
[2023-10-25 15:26:43,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:43,438 INFO  L231             Difference]: Finished difference. Result has 75 places, 102 transitions, 524 flow
[2023-10-25 15:26:43,438 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}
[2023-10-25 15:26:43,439 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-25 15:26:43,439 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 524 flow
[2023-10-25 15:26:43,439 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)
[2023-10-25 15:26:43,439 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:43,439 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]
[2023-10-25 15:26:43,439 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:26:43,440 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)] ===
[2023-10-25 15:26:43,440 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:43,440 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922484543, now seen corresponding path program 1 times
[2023-10-25 15:26:43,441 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:43,441 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685042717]
[2023-10-25 15:26:43,441 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:43,441 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:43,452 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:43,580 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:43,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:43,580 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685042717]
[2023-10-25 15:26:43,581 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685042717] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:26:43,581 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417121134]
[2023-10-25 15:26:43,581 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:43,581 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:26:43,581 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:43,603 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:26:43,645 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:26:43,742 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:43,743 INFO  L263         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:26:43,746 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:26:43,889 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:43,889 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:26:43,889 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417121134] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:43,889 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 15:26:43,889 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-25 15:26:43,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806874525]
[2023-10-25 15:26:43,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:43,890 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-25 15:26:43,890 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:43,890 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-25 15:26:43,890 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-25 15:26:43,928 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2023-10-25 15:26:43,929 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)
[2023-10-25 15:26:43,929 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:43,929 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2023-10-25 15:26:43,929 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:45,685 INFO  L130       PetriNetUnfolder]: 8285/15913 cut-off events.
[2023-10-25 15:26:45,685 INFO  L131       PetriNetUnfolder]: For 17760/19750 co-relation queries the response was YES.
[2023-10-25 15:26:45,706 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. 
[2023-10-25 15:26:45,816 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 167 selfloop transitions, 16 changer transitions 3/236 dead transitions.
[2023-10-25 15:26:45,816 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1545 flow
[2023-10-25 15:26:45,817 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:26:45,817 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:26:45,819 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions.
[2023-10-25 15:26:45,819 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112586298459904
[2023-10-25 15:26:45,819 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions.
[2023-10-25 15:26:45,819 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions.
[2023-10-25 15:26:45,820 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:45,820 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions.
[2023-10-25 15:26:45,822 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)
[2023-10-25 15:26:45,832 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)
[2023-10-25 15:26:45,833 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)
[2023-10-25 15:26:45,833 INFO  L175             Difference]: Start difference. First operand has 75 places, 102 transitions, 524 flow. Second operand 7 states and 1151 transitions.
[2023-10-25 15:26:45,833 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1545 flow
[2023-10-25 15:26:46,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:46,064 INFO  L231             Difference]: Finished difference. Result has 82 places, 117 transitions, 584 flow
[2023-10-25 15:26:46,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}
[2023-10-25 15:26:46,065 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places.
[2023-10-25 15:26:46,066 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 584 flow
[2023-10-25 15:26:46,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)
[2023-10-25 15:26:46,066 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:46,081 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]
[2023-10-25 15:26:46,088 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2023-10-25 15:26:46,285 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
[2023-10-25 15:26:46,286 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)] ===
[2023-10-25 15:26:46,286 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:46,286 INFO  L85        PathProgramCache]: Analyzing trace with hash 597665167, now seen corresponding path program 1 times
[2023-10-25 15:26:46,287 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:46,287 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794494653]
[2023-10-25 15:26:46,287 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:46,287 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:46,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:46,420 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:46,422 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:46,422 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794494653]
[2023-10-25 15:26:46,423 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794494653] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:46,423 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:46,423 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:26:46,424 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140761947]
[2023-10-25 15:26:46,424 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:46,424 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:46,424 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:46,424 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:46,425 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:46,446 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 269
[2023-10-25 15:26:46,461 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)
[2023-10-25 15:26:46,462 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:46,462 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 269
[2023-10-25 15:26:46,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:47,480 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])
[2023-10-25 15:26:47,480 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-10-25 15:26:47,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:26:47,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:26:47,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-25 15:26:47,567 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])
[2023-10-25 15:26:47,567 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-10-25 15:26:47,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:26:47,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:26:47,567 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-25 15:26:48,189 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])
[2023-10-25 15:26:48,190 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-25 15:26:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 15:26:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 15:26:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-25 15:26:48,245 INFO  L130       PetriNetUnfolder]: 8494/17801 cut-off events.
[2023-10-25 15:26:48,246 INFO  L131       PetriNetUnfolder]: For 20941/23812 co-relation queries the response was YES.
[2023-10-25 15:26:48,307 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. 
[2023-10-25 15:26:48,356 INFO  L137   encePairwiseOnDemand]: 257/269 looper letters, 84 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2023-10-25 15:26:48,356 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 996 flow
[2023-10-25 15:26:48,356 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:48,356 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:48,358 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions.
[2023-10-25 15:26:48,358 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034696406443618
[2023-10-25 15:26:48,358 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 487 transitions.
[2023-10-25 15:26:48,358 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions.
[2023-10-25 15:26:48,359 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:48,359 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions.
[2023-10-25 15:26:48,360 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)
[2023-10-25 15:26:48,364 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)
[2023-10-25 15:26:48,364 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)
[2023-10-25 15:26:48,365 INFO  L175             Difference]: Start difference. First operand has 82 places, 117 transitions, 584 flow. Second operand 3 states and 487 transitions.
[2023-10-25 15:26:48,365 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 996 flow
[2023-10-25 15:26:48,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:26:48,398 INFO  L231             Difference]: Finished difference. Result has 85 places, 126 transitions, 670 flow
[2023-10-25 15:26:48,398 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}
[2023-10-25 15:26:48,398 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 21 predicate places.
[2023-10-25 15:26:48,399 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 126 transitions, 670 flow
[2023-10-25 15:26:48,399 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)
[2023-10-25 15:26:48,437 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:48,437 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]
[2023-10-25 15:26:48,437 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:26:48,438 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)] ===
[2023-10-25 15:26:48,438 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:48,438 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119960399, now seen corresponding path program 2 times
[2023-10-25 15:26:48,438 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:48,438 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574351676]
[2023-10-25 15:26:48,439 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:48,439 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:48,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:48,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:26:48,689 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:48,689 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574351676]
[2023-10-25 15:26:48,690 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574351676] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:48,690 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:48,690 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-25 15:26:48,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513734186]
[2023-10-25 15:26:48,690 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:48,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-25 15:26:48,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:48,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-25 15:26:48,691 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-25 15:26:48,758 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269
[2023-10-25 15:26:48,759 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)
[2023-10-25 15:26:48,759 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:48,759 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269
[2023-10-25 15:26:48,759 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:49,220 INFO  L130       PetriNetUnfolder]: 1010/2573 cut-off events.
[2023-10-25 15:26:49,220 INFO  L131       PetriNetUnfolder]: For 2202/2418 co-relation queries the response was YES.
[2023-10-25 15:26:49,223 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. 
[2023-10-25 15:26:49,227 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 40 selfloop transitions, 16 changer transitions 0/91 dead transitions.
[2023-10-25 15:26:49,227 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 528 flow
[2023-10-25 15:26:49,227 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:26:49,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:26:49,232 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2023-10-25 15:26:49,234 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5715613382899628
[2023-10-25 15:26:49,234 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2023-10-25 15:26:49,234 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2023-10-25 15:26:49,234 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:49,234 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2023-10-25 15:26:49,238 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)
[2023-10-25 15:26:49,248 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)
[2023-10-25 15:26:49,248 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)
[2023-10-25 15:26:49,248 INFO  L175             Difference]: Start difference. First operand has 85 places, 126 transitions, 670 flow. Second operand 4 states and 615 transitions.
[2023-10-25 15:26:49,248 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 528 flow
[2023-10-25 15:26:49,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 462 flow, removed 21 selfloop flow, removed 6 redundant places.
[2023-10-25 15:26:49,289 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 333 flow
[2023-10-25 15:26:49,289 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}
[2023-10-25 15:26:49,289 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-25 15:26:49,290 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 333 flow
[2023-10-25 15:26:49,290 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)
[2023-10-25 15:26:49,290 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:49,290 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:49,290 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:26:49,290 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:49,291 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:49,291 INFO  L85        PathProgramCache]: Analyzing trace with hash -674470246, now seen corresponding path program 1 times
[2023-10-25 15:26:49,291 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:49,291 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535707316]
[2023-10-25 15:26:49,291 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:49,291 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:49,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:49,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-25 15:26:49,341 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:49,341 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535707316]
[2023-10-25 15:26:49,341 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535707316] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:49,341 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:49,341 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:49,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970825218]
[2023-10-25 15:26:49,342 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:49,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:49,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:49,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:49,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:49,354 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-25 15:26:49,355 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)
[2023-10-25 15:26:49,355 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:49,355 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-25 15:26:49,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:49,620 INFO  L130       PetriNetUnfolder]: 1161/2703 cut-off events.
[2023-10-25 15:26:49,620 INFO  L131       PetriNetUnfolder]: For 1713/1792 co-relation queries the response was YES.
[2023-10-25 15:26:49,623 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. 
[2023-10-25 15:26:49,627 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 56 selfloop transitions, 8 changer transitions 0/100 dead transitions.
[2023-10-25 15:26:49,627 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 561 flow
[2023-10-25 15:26:49,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:49,628 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:49,629 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2023-10-25 15:26:49,629 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2023-10-25 15:26:49,629 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2023-10-25 15:26:49,629 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2023-10-25 15:26:49,630 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:49,630 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2023-10-25 15:26:49,632 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)
[2023-10-25 15:26:49,635 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)
[2023-10-25 15:26:49,635 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)
[2023-10-25 15:26:49,635 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 333 flow. Second operand 3 states and 497 transitions.
[2023-10-25 15:26:49,636 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 561 flow
[2023-10-25 15:26:49,640 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:49,642 INFO  L231             Difference]: Finished difference. Result has 77 places, 82 transitions, 383 flow
[2023-10-25 15:26:49,642 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}
[2023-10-25 15:26:49,643 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places.
[2023-10-25 15:26:49,643 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 383 flow
[2023-10-25 15:26:49,644 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)
[2023-10-25 15:26:49,644 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:49,644 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]
[2023-10-25 15:26:49,644 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:26:49,645 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:49,645 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:49,645 INFO  L85        PathProgramCache]: Analyzing trace with hash 545280907, now seen corresponding path program 1 times
[2023-10-25 15:26:49,645 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:49,646 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857351036]
[2023-10-25 15:26:49,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:49,651 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:49,693 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:49,799 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 15:26:49,800 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:49,800 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857351036]
[2023-10-25 15:26:49,800 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857351036] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:49,800 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:49,800 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:26:49,800 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971554703]
[2023-10-25 15:26:49,800 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:49,801 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:49,801 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:49,801 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:49,801 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:49,829 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2023-10-25 15:26:49,829 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)
[2023-10-25 15:26:49,829 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:49,829 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2023-10-25 15:26:49,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:50,182 INFO  L130       PetriNetUnfolder]: 1581/3753 cut-off events.
[2023-10-25 15:26:50,182 INFO  L131       PetriNetUnfolder]: For 3378/3613 co-relation queries the response was YES.
[2023-10-25 15:26:50,186 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. 
[2023-10-25 15:26:50,193 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 67 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2023-10-25 15:26:50,193 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 732 flow
[2023-10-25 15:26:50,194 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:26:50,194 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:26:50,195 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2023-10-25 15:26:50,195 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6146220570012392
[2023-10-25 15:26:50,195 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2023-10-25 15:26:50,195 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2023-10-25 15:26:50,196 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:50,196 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2023-10-25 15:26:50,210 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)
[2023-10-25 15:26:50,216 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)
[2023-10-25 15:26:50,216 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)
[2023-10-25 15:26:50,216 INFO  L175             Difference]: Start difference. First operand has 77 places, 82 transitions, 383 flow. Second operand 3 states and 496 transitions.
[2023-10-25 15:26:50,217 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 732 flow
[2023-10-25 15:26:50,223 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:26:50,243 INFO  L231             Difference]: Finished difference. Result has 78 places, 95 transitions, 505 flow
[2023-10-25 15:26:50,243 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}
[2023-10-25 15:26:50,244 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places.
[2023-10-25 15:26:50,244 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 505 flow
[2023-10-25 15:26:50,244 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)
[2023-10-25 15:26:50,244 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:50,244 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]
[2023-10-25 15:26:50,245 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:26:50,245 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 12 more)] ===
[2023-10-25 15:26:50,245 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:50,245 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143255471, now seen corresponding path program 2 times
[2023-10-25 15:26:50,246 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:50,246 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409374297]
[2023-10-25 15:26:50,246 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:50,246 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:50,275 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:50,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:26:50,429 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:50,429 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409374297]
[2023-10-25 15:26:50,429 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409374297] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:26:50,429 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997699248]
[2023-10-25 15:26:50,430 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:26:50,430 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:26:50,430 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:26:50,446 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:26:50,478 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:26:50,585 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-25 15:26:50,585 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:26:50,586 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-25 15:26:50,587 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:26:50,751 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
[2023-10-25 15:26:50,804 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:26:50,806 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
[2023-10-25 15:26:50,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:26:50,821 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:26:50,916 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:26:50,916 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
[2023-10-25 15:26:50,921 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
[2023-10-25 15:26:50,961 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:26:50,961 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997699248] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:26:50,962 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:26:50,962 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-25 15:26:50,962 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264854125]
[2023-10-25 15:26:50,962 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:26:50,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 15:26:50,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:50,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 15:26:50,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2023-10-25 15:26:51,182 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-25 15:26:51,183 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)
[2023-10-25 15:26:51,183 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:51,183 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-25 15:26:51,183 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:26:51,569 INFO  L130       PetriNetUnfolder]: 800/2211 cut-off events.
[2023-10-25 15:26:51,580 INFO  L131       PetriNetUnfolder]: For 2345/2426 co-relation queries the response was YES.
[2023-10-25 15:26:51,600 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. 
[2023-10-25 15:26:51,608 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 13 changer transitions 1/111 dead transitions.
[2023-10-25 15:26:51,621 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 719 flow
[2023-10-25 15:26:51,621 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:26:51,621 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:26:51,622 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions.
[2023-10-25 15:26:51,623 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5864312267657993
[2023-10-25 15:26:51,623 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 631 transitions.
[2023-10-25 15:26:51,623 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions.
[2023-10-25 15:26:51,623 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:26:51,623 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions.
[2023-10-25 15:26:51,624 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)
[2023-10-25 15:26:51,626 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)
[2023-10-25 15:26:51,626 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)
[2023-10-25 15:26:51,626 INFO  L175             Difference]: Start difference. First operand has 78 places, 95 transitions, 505 flow. Second operand 4 states and 631 transitions.
[2023-10-25 15:26:51,626 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 719 flow
[2023-10-25 15:26:51,630 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 703 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-10-25 15:26:51,632 INFO  L231             Difference]: Finished difference. Result has 80 places, 90 transitions, 478 flow
[2023-10-25 15:26:51,632 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}
[2023-10-25 15:26:51,645 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places.
[2023-10-25 15:26:51,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 478 flow
[2023-10-25 15:26:51,646 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)
[2023-10-25 15:26:51,646 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:51,646 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:26:51,652 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-10-25 15:26:51,850 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
[2023-10-25 15:26:51,850 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)] ===
[2023-10-25 15:26:51,851 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:51,851 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802055890, now seen corresponding path program 1 times
[2023-10-25 15:26:51,851 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:51,851 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547122282]
[2023-10-25 15:26:51,851 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:51,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:51,885 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:51,886 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:26:51,909 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:26:51,935 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:26:51,935 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:26:51,936 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-10-25 15:26:51,936 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-25 15:26:51,936 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-10-25 15:26:51,937 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-25 15:26:51,938 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-25 15:26:51,939 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-25 15:26:51,939 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:26:51,939 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:26:51,939 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:26:51,982 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-25 15:26:51,984 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,007 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-25 15:26:52,010 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-25 15:26:52,011 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. 
[2023-10-25 15:26:52,021 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,023 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,023 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:26:52,024 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,024 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,024 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-25 15:26:52,041 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-25 15:26:52,051 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-25 15:26:52,053 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. 
[2023-10-25 15:26:52,072 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13416
[2023-10-25 15:26:56,369 INFO  L134        LiptonReduction]: Checked pairs total: 63011
[2023-10-25 15:26:56,369 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2023-10-25 15:26:56,370 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:26:56,371 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;@797f4af6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:26:56,371 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-25 15:26:56,371 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-25 15:26:56,371 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:26:56,372 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:26:56,372 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-25 15:26:56,372 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)] ===
[2023-10-25 15:26:56,372 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:26:56,372 INFO  L85        PathProgramCache]: Analyzing trace with hash 33015180, now seen corresponding path program 1 times
[2023-10-25 15:26:56,372 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:26:56,372 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290644950]
[2023-10-25 15:26:56,372 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:26:56,372 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:26:56,394 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:26:56,416 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:26:56,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:26:56,417 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290644950]
[2023-10-25 15:26:56,417 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290644950] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:26:56,417 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:26:56,417 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:26:56,418 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693082867]
[2023-10-25 15:26:56,418 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:26:56,418 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:26:56,418 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:26:56,418 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:26:56,419 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:26:56,461 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 307
[2023-10-25 15:26:56,462 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)
[2023-10-25 15:26:56,462 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:26:56,462 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 307
[2023-10-25 15:26:56,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:27:07,472 INFO  L130       PetriNetUnfolder]: 72169/116333 cut-off events.
[2023-10-25 15:27:07,472 INFO  L131       PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES.
[2023-10-25 15:27:07,668 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. 
[2023-10-25 15:27:08,062 INFO  L137   encePairwiseOnDemand]: 286/307 looper letters, 77 selfloop transitions, 14 changer transitions 0/117 dead transitions.
[2023-10-25 15:27:08,062 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 449 flow
[2023-10-25 15:27:08,063 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:27:08,063 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:27:08,064 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions.
[2023-10-25 15:27:08,064 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6395222584147665
[2023-10-25 15:27:08,064 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 589 transitions.
[2023-10-25 15:27:08,064 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions.
[2023-10-25 15:27:08,065 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:27:08,065 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions.
[2023-10-25 15:27:08,066 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)
[2023-10-25 15:27:08,068 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)
[2023-10-25 15:27:08,068 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)
[2023-10-25 15:27:08,068 INFO  L175             Difference]: Start difference. First operand has 82 places, 77 transitions, 175 flow. Second operand 3 states and 589 transitions.
[2023-10-25 15:27:08,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 449 flow
[2023-10-25 15:27:08,086 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 441 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-10-25 15:27:08,091 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 287 flow
[2023-10-25 15:27:08,091 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}
[2023-10-25 15:27:08,092 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places.
[2023-10-25 15:27:08,092 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 287 flow
[2023-10-25 15:27:08,092 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)
[2023-10-25 15:27:08,092 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:27:08,092 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:27:08,092 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:27:08,093 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)] ===
[2023-10-25 15:27:08,093 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:27:08,093 INFO  L85        PathProgramCache]: Analyzing trace with hash 265562788, now seen corresponding path program 1 times
[2023-10-25 15:27:08,093 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:27:08,093 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343199171]
[2023-10-25 15:27:08,094 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:27:08,094 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:27:08,114 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:27:08,125 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:27:08,126 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:27:08,126 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343199171]
[2023-10-25 15:27:08,126 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343199171] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:27:08,126 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:27:08,126 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:27:08,126 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586219315]
[2023-10-25 15:27:08,126 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:27:08,127 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:27:08,127 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:27:08,128 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:27:08,128 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:27:08,177 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-25 15:27:08,178 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)
[2023-10-25 15:27:08,178 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:27:08,178 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-25 15:27:08,178 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:27:13,695 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])
[2023-10-25 15:27:13,696 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:13,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,696 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])
[2023-10-25 15:27:13,696 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:27:13,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:13,696 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:13,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:13,697 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])
[2023-10-25 15:27:13,697 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:13,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,697 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,985 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])
[2023-10-25 15:27:13,986 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:13,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:13,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:13,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:13,986 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])
[2023-10-25 15:27:13,986 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:13,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:13,987 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])
[2023-10-25 15:27:13,987 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:13,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:13,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:13,987 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:14,446 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])
[2023-10-25 15:27:14,447 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:14,447 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])
[2023-10-25 15:27:14,447 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:14,447 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:14,448 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])
[2023-10-25 15:27:14,448 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:14,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:14,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:14,448 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:15,230 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])
[2023-10-25 15:27:15,231 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,231 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])
[2023-10-25 15:27:15,231 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:15,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:15,232 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])
[2023-10-25 15:27:15,241 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:15,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:15,241 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])
[2023-10-25 15:27:15,241 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:15,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:15,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:15,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:16,972 INFO  L130       PetriNetUnfolder]: 61911/103015 cut-off events.
[2023-10-25 15:27:16,972 INFO  L131       PetriNetUnfolder]: For 48263/52767 co-relation queries the response was YES.
[2023-10-25 15:27:17,201 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. 
[2023-10-25 15:27:17,824 INFO  L137   encePairwiseOnDemand]: 297/307 looper letters, 65 selfloop transitions, 16 changer transitions 0/121 dead transitions.
[2023-10-25 15:27:17,825 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 549 flow
[2023-10-25 15:27:17,825 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:27:17,825 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:27:17,827 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions.
[2023-10-25 15:27:17,845 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6199782844733985
[2023-10-25 15:27:17,845 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 571 transitions.
[2023-10-25 15:27:17,845 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions.
[2023-10-25 15:27:17,846 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:27:17,846 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions.
[2023-10-25 15:27:17,847 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)
[2023-10-25 15:27:17,848 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)
[2023-10-25 15:27:17,848 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)
[2023-10-25 15:27:17,849 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 287 flow. Second operand 3 states and 571 transitions.
[2023-10-25 15:27:17,849 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 549 flow
[2023-10-25 15:27:18,074 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:27:18,076 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 405 flow
[2023-10-25 15:27:18,076 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}
[2023-10-25 15:27:18,076 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places.
[2023-10-25 15:27:18,077 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 405 flow
[2023-10-25 15:27:18,077 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)
[2023-10-25 15:27:18,077 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:27:18,078 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:27:18,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-25 15:27:18,078 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)] ===
[2023-10-25 15:27:18,078 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:27:18,078 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657692777, now seen corresponding path program 1 times
[2023-10-25 15:27:18,078 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:27:18,078 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319408739]
[2023-10-25 15:27:18,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:27:18,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:27:18,099 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:27:18,150 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:27:18,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:27:18,151 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319408739]
[2023-10-25 15:27:18,151 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319408739] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:27:18,151 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:27:18,151 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:27:18,151 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084600242]
[2023-10-25 15:27:18,151 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:27:18,152 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:27:18,152 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:27:18,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:27:18,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:27:18,176 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 307
[2023-10-25 15:27:18,176 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)
[2023-10-25 15:27:18,177 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:27:18,177 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 307
[2023-10-25 15:27:18,177 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:27:24,655 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])
[2023-10-25 15:27:24,656 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,656 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,663 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])
[2023-10-25 15:27:24,663 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:24,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:25,250 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])
[2023-10-25 15:27:25,251 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,251 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,256 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])
[2023-10-25 15:27:25,256 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:25,596 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])
[2023-10-25 15:27:25,596 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,597 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,597 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,597 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,601 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])
[2023-10-25 15:27:25,601 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:25,601 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:26,162 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])
[2023-10-25 15:27:26,162 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:26,162 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:26,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:26,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:26,675 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])
[2023-10-25 15:27:26,675 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,675 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,676 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,676 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,679 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])
[2023-10-25 15:27:26,679 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:26,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:28,381 INFO  L130       PetriNetUnfolder]: 70720/120727 cut-off events.
[2023-10-25 15:27:28,382 INFO  L131       PetriNetUnfolder]: For 84139/95985 co-relation queries the response was YES.
[2023-10-25 15:27:28,661 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. 
[2023-10-25 15:27:29,131 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions.
[2023-10-25 15:27:29,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 655 flow
[2023-10-25 15:27:29,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:27:29,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:27:29,139 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2023-10-25 15:27:29,139 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6416938110749185
[2023-10-25 15:27:29,139 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2023-10-25 15:27:29,139 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2023-10-25 15:27:29,139 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:27:29,139 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2023-10-25 15:27:29,154 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)
[2023-10-25 15:27:29,155 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)
[2023-10-25 15:27:29,155 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)
[2023-10-25 15:27:29,156 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 405 flow. Second operand 3 states and 591 transitions.
[2023-10-25 15:27:29,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 655 flow
[2023-10-25 15:27:29,311 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:27:29,313 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 411 flow
[2023-10-25 15:27:29,313 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}
[2023-10-25 15:27:29,313 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places.
[2023-10-25 15:27:29,313 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 411 flow
[2023-10-25 15:27:29,314 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)
[2023-10-25 15:27:29,314 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:27:29,314 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:27:29,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-25 15:27:29,315 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-25 15:27:29,315 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:27:29,315 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092777545, now seen corresponding path program 1 times
[2023-10-25 15:27:29,315 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:27:29,316 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599843250]
[2023-10-25 15:27:29,316 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:27:29,316 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:27:29,433 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:27:29,474 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:27:29,475 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:27:29,475 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599843250]
[2023-10-25 15:27:29,475 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599843250] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:27:29,475 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:27:29,475 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:27:29,475 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612667212]
[2023-10-25 15:27:29,476 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:27:29,476 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:27:29,476 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:27:29,476 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:27:29,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:27:29,504 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-25 15:27:29,504 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)
[2023-10-25 15:27:29,504 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:27:29,505 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-25 15:27:29,505 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:27:36,802 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])
[2023-10-25 15:27:36,802 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,802 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,810 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])
[2023-10-25 15:27:36,810 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:36,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:27:37,480 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])
[2023-10-25 15:27:37,480 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,480 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,485 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])
[2023-10-25 15:27:37,485 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:37,485 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:27:38,131 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])
[2023-10-25 15:27:38,131 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,132 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,136 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])
[2023-10-25 15:27:38,137 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,137 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,137 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,137 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:27:38,755 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])
[2023-10-25 15:27:38,755 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:38,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:38,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:38,755 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:27:39,083 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])
[2023-10-25 15:27:39,083 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,084 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,088 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])
[2023-10-25 15:27:39,088 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-25 15:27:43,156 INFO  L130       PetriNetUnfolder]: 80048/137390 cut-off events.
[2023-10-25 15:27:43,157 INFO  L131       PetriNetUnfolder]: For 90837/104282 co-relation queries the response was YES.
[2023-10-25 15:27:43,543 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. 
[2023-10-25 15:27:44,105 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 85 selfloop transitions, 9 changer transitions 0/146 dead transitions.
[2023-10-25 15:27:44,105 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 747 flow
[2023-10-25 15:27:44,105 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:27:44,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:27:44,106 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2023-10-25 15:27:44,107 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6384364820846905
[2023-10-25 15:27:44,107 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2023-10-25 15:27:44,107 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2023-10-25 15:27:44,107 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:27:44,107 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2023-10-25 15:27:44,108 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)
[2023-10-25 15:27:44,109 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)
[2023-10-25 15:27:44,125 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)
[2023-10-25 15:27:44,125 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 411 flow. Second operand 3 states and 588 transitions.
[2023-10-25 15:27:44,125 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 747 flow
[2023-10-25 15:27:46,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:27:46,236 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 477 flow
[2023-10-25 15:27:46,236 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}
[2023-10-25 15:27:46,236 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-25 15:27:46,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 477 flow
[2023-10-25 15:27:46,237 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)
[2023-10-25 15:27:46,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:27:46,238 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]
[2023-10-25 15:27:46,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-25 15:27:46,238 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-25 15:27:46,239 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:27:46,239 INFO  L85        PathProgramCache]: Analyzing trace with hash -694365201, now seen corresponding path program 1 times
[2023-10-25 15:27:46,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:27:46,239 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509781997]
[2023-10-25 15:27:46,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:27:46,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:27:46,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:27:46,295 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:27:46,295 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:27:46,296 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509781997]
[2023-10-25 15:27:46,297 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509781997] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:27:46,297 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:27:46,298 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:27:46,298 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849654408]
[2023-10-25 15:27:46,298 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:27:46,298 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:27:46,298 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:27:46,299 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:27:46,299 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:27:46,341 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-25 15:27:46,346 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)
[2023-10-25 15:27:46,346 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:27:46,346 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-25 15:27:46,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:27:53,277 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])
[2023-10-25 15:27:53,278 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-25 15:27:53,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:53,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:53,278 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:54,305 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])
[2023-10-25 15:27:54,306 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:27:54,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:54,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:54,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:54,453 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])
[2023-10-25 15:27:54,454 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:54,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:54,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:54,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:54,454 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])
[2023-10-25 15:27:54,454 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:27:54,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:54,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:54,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-25 15:27:54,455 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])
[2023-10-25 15:27:54,455 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:54,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:54,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:54,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:57,129 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])
[2023-10-25 15:27:57,130 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is not cut-off event
[2023-10-25 15:27:57,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-25 15:27:57,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-25 15:27:57,130 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-25 15:27:57,236 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])
[2023-10-25 15:27:57,237 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,237 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])
[2023-10-25 15:27:57,237 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:57,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-25 15:27:57,238 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])
[2023-10-25 15:27:57,238 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:57,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,854 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])
[2023-10-25 15:27:57,855 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:57,855 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])
[2023-10-25 15:27:57,855 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-25 15:27:57,856 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])
[2023-10-25 15:27:57,856 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:27:57,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:57,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:57,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-25 15:27:59,854 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])
[2023-10-25 15:27:59,854 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:59,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,854 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])
[2023-10-25 15:27:59,854 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:59,855 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])
[2023-10-25 15:27:59,855 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:27:59,855 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])
[2023-10-25 15:27:59,856 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:27:59,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:59,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:27:59,856 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:28:04,488 INFO  L130       PetriNetUnfolder]: 117057/193039 cut-off events.
[2023-10-25 15:28:04,488 INFO  L131       PetriNetUnfolder]: For 158026/169600 co-relation queries the response was YES.
[2023-10-25 15:28:05,037 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. 
[2023-10-25 15:28:06,131 INFO  L137   encePairwiseOnDemand]: 296/307 looper letters, 95 selfloop transitions, 28 changer transitions 0/164 dead transitions.
[2023-10-25 15:28:06,131 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 937 flow
[2023-10-25 15:28:06,132 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:28:06,132 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:28:06,133 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions.
[2023-10-25 15:28:06,133 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6297502714440825
[2023-10-25 15:28:06,133 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 580 transitions.
[2023-10-25 15:28:06,133 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions.
[2023-10-25 15:28:06,134 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:28:06,134 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions.
[2023-10-25 15:28:06,135 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)
[2023-10-25 15:28:06,149 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)
[2023-10-25 15:28:06,163 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)
[2023-10-25 15:28:06,164 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 477 flow. Second operand 3 states and 580 transitions.
[2023-10-25 15:28:06,164 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 937 flow
[2023-10-25 15:28:06,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:28:06,833 INFO  L231             Difference]: Finished difference. Result has 93 places, 138 transitions, 749 flow
[2023-10-25 15:28:06,833 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}
[2023-10-25 15:28:06,834 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-25 15:28:06,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 749 flow
[2023-10-25 15:28:06,849 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)
[2023-10-25 15:28:06,849 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:28:06,849 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]
[2023-10-25 15:28:06,849 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:28:06,849 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)] ===
[2023-10-25 15:28:06,850 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:28:06,850 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017840435, now seen corresponding path program 1 times
[2023-10-25 15:28:06,850 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:28:06,850 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340573379]
[2023-10-25 15:28:06,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:28:06,851 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:28:06,862 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:28:06,955 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:28:06,955 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:28:06,955 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340573379]
[2023-10-25 15:28:06,956 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340573379] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:28:06,956 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35486577]
[2023-10-25 15:28:06,956 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:28:06,956 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:28:06,956 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:28:06,989 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:28:07,027 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:28:07,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:28:07,128 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-25 15:28:07,129 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:28:07,166 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:28:07,167 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:28:07,167 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [35486577] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:28:07,167 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-25 15:28:07,167 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-25 15:28:07,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096598772]
[2023-10-25 15:28:07,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:28:07,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-25 15:28:07,168 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:28:07,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-25 15:28:07,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-25 15:28:07,193 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 307
[2023-10-25 15:28:07,194 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)
[2023-10-25 15:28:07,209 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:28:07,209 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 307
[2023-10-25 15:28:07,209 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:28:17,858 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])
[2023-10-25 15:28:17,858 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-25 15:28:17,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:28:17,858 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:28:17,863 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-25 15:28:19,241 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|)])
[2023-10-25 15:28:19,241 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,242 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,315 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])
[2023-10-25 15:28:19,315 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 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])
[2023-10-25 15:28:19,316 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-25 15:28:19,317 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])
[2023-10-25 15:28:19,318 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:28:19,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:19,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:19,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,755 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|)])
[2023-10-25 15:28:20,756 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,756 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,831 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])
[2023-10-25 15:28:20,831 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-25 15:28:20,833 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])
[2023-10-25 15:28:20,833 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:28:20,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:20,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:20,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,040 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])
[2023-10-25 15:28:22,040 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,040 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,041 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,041 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,312 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|)])
[2023-10-25 15:28:22,312 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,312 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,395 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])
[2023-10-25 15:28:22,395 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,395 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,395 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,396 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:22,397 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])
[2023-10-25 15:28:22,397 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:28:22,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:22,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:22,397 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:22,497 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])
[2023-10-25 15:28:22,498 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,502 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,502 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,502 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:22,502 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:23,640 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])
[2023-10-25 15:28:23,640 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:23,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:23,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:23,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:24,046 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|)])
[2023-10-25 15:28:24,046 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-25 15:28:24,046 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:24,046 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:24,046 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:25,209 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|)])
[2023-10-25 15:28:25,210 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:25,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:25,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:25,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:25,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,199 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])
[2023-10-25 15:28:26,199 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,199 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,199 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,199 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,201 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])
[2023-10-25 15:28:26,201 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:28:26,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:26,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:26,201 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:26,281 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])
[2023-10-25 15:28:26,282 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,282 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,282 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,282 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,820 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])
[2023-10-25 15:28:26,821 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,821 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,887 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])
[2023-10-25 15:28:26,887 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:26,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:27,698 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|)])
[2023-10-25 15:28:27,698 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,698 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,761 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])
[2023-10-25 15:28:27,761 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,833 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])
[2023-10-25 15:28:27,833 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,833 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:27,834 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:28,361 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])
[2023-10-25 15:28:28,361 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-25 15:28:28,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:28,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:28,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:29,798 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])
[2023-10-25 15:28:29,799 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:29,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:29,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:29,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:30,742 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])
[2023-10-25 15:28:30,742 INFO  L383   tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-10-25 15:28:30,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:30,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:30,742 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-25 15:28:30,743 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])
[2023-10-25 15:28:30,743 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:30,743 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:30,743 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:30,743 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-25 15:28:30,743 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])
[2023-10-25 15:28:30,743 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:30,743 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:30,744 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:30,744 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:31,245 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])
[2023-10-25 15:28:31,245 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:31,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:31,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:31,245 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,925 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])
[2023-10-25 15:28:35,925 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,925 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,925 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,925 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,925 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])
[2023-10-25 15:28:35,926 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:35,926 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,279 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])
[2023-10-25 15:28:36,280 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,280 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,320 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|)])
[2023-10-25 15:28:36,321 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,321 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,322 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|)])
[2023-10-25 15:28:36,322 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,322 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,323 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|)])
[2023-10-25 15:28:36,323 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,323 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,357 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|)])
[2023-10-25 15:28:36,357 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,357 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,358 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,358 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,388 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])
[2023-10-25 15:28:36,389 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-25 15:28:36,646 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])
[2023-10-25 15:28:36,647 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-25 15:28:36,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:36,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:36,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-25 15:28:36,647 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])
[2023-10-25 15:28:36,647 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:36,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:36,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-25 15:28:36,920 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|)])
[2023-10-25 15:28:36,920 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,920 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,972 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])
[2023-10-25 15:28:36,972 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,972 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:36,973 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,110 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|)])
[2023-10-25 15:28:37,110 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,110 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,111 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,125 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|)])
[2023-10-25 15:28:37,125 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,125 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-25 15:28:37,171 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|)])
[2023-10-25 15:28:37,172 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-25 15:28:37,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:37,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:37,172 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,782 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|)])
[2023-10-25 15:28:38,782 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,785 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|)])
[2023-10-25 15:28:38,785 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,786 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|)])
[2023-10-25 15:28:38,786 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,810 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|)])
[2023-10-25 15:28:38,810 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,810 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,811 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-25 15:28:38,909 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|)])
[2023-10-25 15:28:38,909 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:38,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,177 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|)])
[2023-10-25 15:28:39,178 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,254 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])
[2023-10-25 15:28:39,254 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,255 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,255 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,255 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,256 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])
[2023-10-25 15:28:39,256 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,256 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,274 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])
[2023-10-25 15:28:39,275 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,275 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,275 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,275 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,281 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])
[2023-10-25 15:28:39,281 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,281 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,312 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|)])
[2023-10-25 15:28:39,313 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,358 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|)])
[2023-10-25 15:28:39,358 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,358 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,358 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,358 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,359 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])
[2023-10-25 15:28:39,359 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,359 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-25 15:28:39,556 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])
[2023-10-25 15:28:39,556 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,556 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,556 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,556 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,646 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|)])
[2023-10-25 15:28:39,646 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,647 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,658 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|)])
[2023-10-25 15:28:39,658 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,658 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,659 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,663 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])
[2023-10-25 15:28:39,663 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,663 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,664 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])
[2023-10-25 15:28:39,664 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,664 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,678 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])
[2023-10-25 15:28:39,678 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 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])
[2023-10-25 15:28:39,679 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,679 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,711 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|)])
[2023-10-25 15:28:39,711 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,713 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|)])
[2023-10-25 15:28:39,713 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,714 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,724 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])
[2023-10-25 15:28:39,724 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,724 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-25 15:28:39,734 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])
[2023-10-25 15:28:39,735 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,759 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])
[2023-10-25 15:28:39,760 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:39,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-25 15:28:40,944 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|)])
[2023-10-25 15:28:40,944 INFO  L383   tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2023-10-25 15:28:40,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-25 15:28:40,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-25 15:28:40,945 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-25 15:28:41,161 INFO  L130       PetriNetUnfolder]: 190525/317152 cut-off events.
[2023-10-25 15:28:41,162 INFO  L131       PetriNetUnfolder]: For 400239/430783 co-relation queries the response was YES.
[2023-10-25 15:28:42,161 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. 
[2023-10-25 15:28:43,564 INFO  L137   encePairwiseOnDemand]: 298/307 looper letters, 268 selfloop transitions, 19 changer transitions 3/353 dead transitions.
[2023-10-25 15:28:43,564 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 353 transitions, 2513 flow
[2023-10-25 15:28:43,565 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-25 15:28:43,565 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-25 15:28:43,584 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions.
[2023-10-25 15:28:43,585 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6342484876686831
[2023-10-25 15:28:43,585 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1363 transitions.
[2023-10-25 15:28:43,585 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1363 transitions.
[2023-10-25 15:28:43,586 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:28:43,586 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1363 transitions.
[2023-10-25 15:28:43,587 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)
[2023-10-25 15:28:43,589 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)
[2023-10-25 15:28:43,598 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)
[2023-10-25 15:28:43,599 INFO  L175             Difference]: Start difference. First operand has 93 places, 138 transitions, 749 flow. Second operand 7 states and 1363 transitions.
[2023-10-25 15:28:43,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 353 transitions, 2513 flow
[2023-10-25 15:29:49,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 353 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:29:49,948 INFO  L231             Difference]: Finished difference. Result has 100 places, 158 transitions, 817 flow
[2023-10-25 15:29:49,949 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}
[2023-10-25 15:29:49,949 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 18 predicate places.
[2023-10-25 15:29:49,952 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 817 flow
[2023-10-25 15:29:49,953 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)
[2023-10-25 15:29:49,953 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:29:49,955 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]
[2023-10-25 15:29:49,963 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:29:50,161 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
[2023-10-25 15:29:50,162 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)] ===
[2023-10-25 15:29:50,163 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:29:50,163 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277540627, now seen corresponding path program 1 times
[2023-10-25 15:29:50,163 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:29:50,164 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757535092]
[2023-10-25 15:29:50,164 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:29:50,164 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:29:50,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:29:50,363 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2023-10-25 15:29:50,364 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:29:50,364 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757535092]
[2023-10-25 15:29:50,364 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757535092] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:29:50,364 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:29:50,364 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-25 15:29:50,366 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705407402]
[2023-10-25 15:29:50,367 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:29:50,368 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-25 15:29:50,368 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:29:50,369 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-25 15:29:50,369 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-25 15:29:50,501 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 307
[2023-10-25 15:29:50,502 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)
[2023-10-25 15:29:50,502 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:29:50,502 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 307
[2023-10-25 15:29:50,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:29:52,989 INFO  L130       PetriNetUnfolder]: 15706/31175 cut-off events.
[2023-10-25 15:29:52,990 INFO  L131       PetriNetUnfolder]: For 23101/23856 co-relation queries the response was YES.
[2023-10-25 15:29:53,048 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. 
[2023-10-25 15:29:53,127 INFO  L137   encePairwiseOnDemand]: 294/307 looper letters, 68 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2023-10-25 15:29:53,128 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 663 flow
[2023-10-25 15:29:53,128 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-25 15:29:53,128 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-25 15:29:53,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions.
[2023-10-25 15:29:53,143 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5903908794788274
[2023-10-25 15:29:53,143 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 725 transitions.
[2023-10-25 15:29:53,143 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions.
[2023-10-25 15:29:53,144 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:29:53,150 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions.
[2023-10-25 15:29:53,152 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)
[2023-10-25 15:29:53,153 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)
[2023-10-25 15:29:53,153 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)
[2023-10-25 15:29:53,153 INFO  L175             Difference]: Start difference. First operand has 100 places, 158 transitions, 817 flow. Second operand 4 states and 725 transitions.
[2023-10-25 15:29:53,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 663 flow
[2023-10-25 15:29:53,330 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 118 transitions, 599 flow, removed 28 selfloop flow, removed 5 redundant places.
[2023-10-25 15:29:53,333 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 363 flow
[2023-10-25 15:29:53,333 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}
[2023-10-25 15:29:53,334 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places.
[2023-10-25 15:29:53,334 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 363 flow
[2023-10-25 15:29:53,334 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)
[2023-10-25 15:29:53,334 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:29:53,334 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:29:53,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-25 15:29:53,335 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-25 15:29:53,335 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:29:53,335 INFO  L85        PathProgramCache]: Analyzing trace with hash 928932594, now seen corresponding path program 1 times
[2023-10-25 15:29:53,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:29:53,335 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642729336]
[2023-10-25 15:29:53,335 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:29:53,335 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:29:53,374 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:29:53,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2023-10-25 15:29:53,389 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:29:53,390 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642729336]
[2023-10-25 15:29:53,390 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642729336] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:29:53,390 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:29:53,390 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:29:53,390 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736052546]
[2023-10-25 15:29:53,390 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:29:53,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:29:53,391 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:29:53,391 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:29:53,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:29:53,419 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-25 15:29:53,419 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)
[2023-10-25 15:29:53,419 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:29:53,419 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-25 15:29:53,420 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:29:55,551 INFO  L130       PetriNetUnfolder]: 12340/24716 cut-off events.
[2023-10-25 15:29:55,552 INFO  L131       PetriNetUnfolder]: For 11913/12428 co-relation queries the response was YES.
[2023-10-25 15:29:55,591 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. 
[2023-10-25 15:29:55,652 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-10-25 15:29:55,652 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 687 flow
[2023-10-25 15:29:55,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:29:55,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:29:55,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2023-10-25 15:29:55,654 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6373507057546145
[2023-10-25 15:29:55,654 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2023-10-25 15:29:55,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2023-10-25 15:29:55,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:29:55,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2023-10-25 15:29:55,666 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)
[2023-10-25 15:29:55,667 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)
[2023-10-25 15:29:55,668 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)
[2023-10-25 15:29:55,668 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 363 flow. Second operand 3 states and 587 transitions.
[2023-10-25 15:29:55,668 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 687 flow
[2023-10-25 15:29:55,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:29:55,681 INFO  L231             Difference]: Finished difference. Result has 91 places, 101 transitions, 448 flow
[2023-10-25 15:29:55,681 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}
[2023-10-25 15:29:55,682 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-25 15:29:55,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 448 flow
[2023-10-25 15:29:55,682 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)
[2023-10-25 15:29:55,682 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:29:55,682 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]
[2023-10-25 15:29:55,683 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-25 15:29:55,683 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-25 15:29:55,684 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:29:55,684 INFO  L85        PathProgramCache]: Analyzing trace with hash -683014751, now seen corresponding path program 1 times
[2023-10-25 15:29:55,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:29:55,684 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380071411]
[2023-10-25 15:29:55,684 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:29:55,684 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:29:55,712 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:29:55,808 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2023-10-25 15:29:55,809 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:29:55,809 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380071411]
[2023-10-25 15:29:55,809 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380071411] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:29:55,809 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:29:55,809 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:29:55,810 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530470040]
[2023-10-25 15:29:55,810 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:29:55,811 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:29:55,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:29:55,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:29:55,811 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:29:55,841 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-25 15:29:55,842 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)
[2023-10-25 15:29:55,842 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:29:55,842 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-25 15:29:55,842 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:29:59,566 INFO  L130       PetriNetUnfolder]: 25377/49342 cut-off events.
[2023-10-25 15:29:59,566 INFO  L131       PetriNetUnfolder]: For 44120/46312 co-relation queries the response was YES.
[2023-10-25 15:29:59,685 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. 
[2023-10-25 15:29:59,829 INFO  L137   encePairwiseOnDemand]: 295/307 looper letters, 101 selfloop transitions, 13 changer transitions 0/155 dead transitions.
[2023-10-25 15:29:59,829 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 941 flow
[2023-10-25 15:29:59,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:29:59,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:29:59,831 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions.
[2023-10-25 15:29:59,831 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6330076004343105
[2023-10-25 15:29:59,831 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 583 transitions.
[2023-10-25 15:29:59,831 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions.
[2023-10-25 15:29:59,831 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:29:59,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions.
[2023-10-25 15:29:59,832 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)
[2023-10-25 15:29:59,840 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)
[2023-10-25 15:29:59,841 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)
[2023-10-25 15:29:59,841 INFO  L175             Difference]: Start difference. First operand has 91 places, 101 transitions, 448 flow. Second operand 3 states and 583 transitions.
[2023-10-25 15:29:59,841 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 941 flow
[2023-10-25 15:30:00,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:30:00,063 INFO  L231             Difference]: Finished difference. Result has 93 places, 111 transitions, 525 flow
[2023-10-25 15:30:00,063 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}
[2023-10-25 15:30:00,064 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-25 15:30:00,064 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 525 flow
[2023-10-25 15:30:00,064 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)
[2023-10-25 15:30:00,064 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:30:00,064 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]
[2023-10-25 15:30:00,065 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-25 15:30:00,065 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-25 15:30:00,065 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:30:00,065 INFO  L85        PathProgramCache]: Analyzing trace with hash 74336075, now seen corresponding path program 2 times
[2023-10-25 15:30:00,065 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:30:00,065 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954432160]
[2023-10-25 15:30:00,065 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:30:00,066 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:30:00,085 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:30:00,216 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:30:00,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:30:00,217 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954432160]
[2023-10-25 15:30:00,217 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954432160] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-25 15:30:00,217 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353970345]
[2023-10-25 15:30:00,217 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-25 15:30:00,217 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:30:00,218 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:30:00,218 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:30:00,273 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-10-25 15:30:00,359 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-25 15:30:00,359 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-25 15:30:00,360 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-25 15:30:00,363 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:30:00,445 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
[2023-10-25 15:30:00,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-25 15:30:00,488 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
[2023-10-25 15:30:00,501 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:30:00,501 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-25 15:30:00,548 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:30:00,549 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
[2023-10-25 15:30:00,551 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
[2023-10-25 15:30:00,590 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:30:00,591 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [353970345] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-25 15:30:00,591 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-25 15:30:00,591 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-25 15:30:00,592 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412876558]
[2023-10-25 15:30:00,592 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-25 15:30:00,592 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-25 15:30:00,592 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:30:00,593 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-25 15:30:00,593 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90
[2023-10-25 15:30:00,825 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-25 15:30:00,826 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 111 transitions, 525 flow. Second operand  has 10 states, 10 states have (on average 171.5) internal successors, (1715), 10 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:30:00,826 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:30:00,826 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-25 15:30:00,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
