./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-27 12:50:28,862 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-27 12:50:28,864 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-27 12:50:28,931 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-27 12:50:28,932 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-27 12:50:28,935 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-27 12:50:28,936 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-27 12:50:28,938 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-27 12:50:28,940 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-27 12:50:28,943 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-27 12:50:28,944 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-27 12:50:28,946 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-27 12:50:28,946 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-27 12:50:28,949 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-27 12:50:28,950 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-27 12:50:28,951 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-27 12:50:28,952 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-27 12:50:28,953 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-27 12:50:28,954 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-27 12:50:28,970 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-27 12:50:28,971 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-27 12:50:28,973 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-27 12:50:28,973 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-27 12:50:28,974 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-27 12:50:28,977 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-27 12:50:28,977 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-27 12:50:28,977 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-27 12:50:28,978 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-27 12:50:28,978 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-27 12:50:28,980 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-27 12:50:28,980 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-27 12:50:28,980 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-27 12:50:28,982 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-27 12:50:28,983 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-27 12:50:28,988 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-27 12:50:28,988 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-27 12:50:28,988 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-27 12:50:28,988 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-27 12:50:28,989 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-27 12:50:28,989 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-27 12:50:28,990 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-27 12:50:28,991 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-27 12:50:29,035 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-27 12:50:29,035 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-27 12:50:29,036 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-27 12:50:29,036 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-27 12:50:29,037 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-27 12:50:29,037 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-27 12:50:29,037 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-27 12:50:29,037 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-27 12:50:29,038 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-27 12:50:29,038 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-27 12:50:29,038 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-27 12:50:29,039 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-27 12:50:29,040 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-27 12:50:29,041 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-27 12:50:29,041 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-27 12:50:29,041 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-27 12:50:29,041 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:50:29,041 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-27 12:50:29,041 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-27 12:50:29,042 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-27 12:50:29,042 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-27 12:50:29,042 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-27 12:50:29,043 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-27 12:50:29,043 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-27 12:50:29,043 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-27 12:50:29,043 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-27 12:50:29,043 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-27 12:50:29,043 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-27 12:50:29,412 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-27 12:50:29,435 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-27 12:50:29,437 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-27 12:50:29,438 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-27 12:50:29,438 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-27 12:50:29,439 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-27 12:50:31,135 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-27 12:50:31,502 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-27 12:50:31,509 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-counter-outer-race-4.i
[2023-10-27 12:50:31,527 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/22d0fd86c/8c72e4e525ba4616b514b9c1e34da9c4/FLAGbddaa6bb4
[2023-10-27 12:50:31,564 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/22d0fd86c/8c72e4e525ba4616b514b9c1e34da9c4
[2023-10-27 12:50:31,566 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-27 12:50:31,582 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-27 12:50:31,583 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-27 12:50:31,584 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-27 12:50:31,586 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-27 12:50:31,587 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:50:31" (1/1) ...
[2023-10-27 12:50:31,587 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@500d0f90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:31, skipping insertion in model container
[2023-10-27 12:50:31,587 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 12:50:31" (1/1) ...
[2023-10-27 12:50:31,593 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-27 12:50:31,675 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-27 12:50:32,092 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-27 12:50:32,097 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:50:32,129 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-27 12:50:32,207 WARN  L623        FunctionHandler]: Unknown extern function pthread_detach
[2023-10-27 12:50:32,213 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-27 12:50:32,269 INFO  L208         MainTranslator]: Completed translation
[2023-10-27 12:50:32,269 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32 WrapperNode
[2023-10-27 12:50:32,269 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-27 12:50:32,270 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-27 12:50:32,271 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-27 12:50:32,271 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-27 12:50:32,276 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,317 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,367 INFO  L138                Inliner]: procedures = 159, calls = 37, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 95
[2023-10-27 12:50:32,367 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-27 12:50:32,368 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-27 12:50:32,368 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-27 12:50:32,368 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-27 12:50:32,375 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,375 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,377 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,378 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,382 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,396 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,398 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,398 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,400 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-27 12:50:32,418 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-27 12:50:32,419 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-27 12:50:32,419 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-27 12:50:32,420 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (1/1) ...
[2023-10-27 12:50:32,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-27 12:50:32,443 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:50:32,456 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-27 12:50:32,489 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-27 12:50:32,495 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-27 12:50:32,495 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-27 12:50:32,495 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-27 12:50:32,498 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-27 12:50:32,498 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-10-27 12:50:32,499 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-27 12:50:32,499 INFO  L130     BoogieDeclarations]: Found specification of procedure pthread_detach
[2023-10-27 12:50:32,499 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-27 12:50:32,499 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-27 12:50:32,499 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-27 12:50:32,499 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-27 12:50:32,499 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-27 12:50:32,500 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-27 12:50:32,712 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-27 12:50:32,714 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-27 12:50:33,101 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-27 12:50:33,113 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-27 12:50:33,130 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-27 12:50:33,134 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:50:33 BoogieIcfgContainer
[2023-10-27 12:50:33,134 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-27 12:50:33,136 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-27 12:50:33,137 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-27 12:50:33,140 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-27 12:50:33,150 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 12:50:31" (1/3) ...
[2023-10-27 12:50:33,153 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686f9688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:50:33, skipping insertion in model container
[2023-10-27 12:50:33,153 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 12:50:32" (2/3) ...
[2023-10-27 12:50:33,153 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686f9688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 12:50:33, skipping insertion in model container
[2023-10-27 12:50:33,153 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 12:50:33" (3/3) ...
[2023-10-27 12:50:33,155 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-counter-outer-race-4.i
[2023-10-27 12:50:33,164 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-27 12:50:33,184 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-27 12:50:33,185 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations.
[2023-10-27 12:50:33,185 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-27 12:50:33,315 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-27 12:50:33,358 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,474 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-27 12:50:33,498 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:50:33,504 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-27 12:50:33,504 INFO  L82        GeneralOperation]: Start removeDead. Operand has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,512 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,515 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:50:33,531 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,544 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 133 places, 134 transitions, 273 flow
[2023-10-27 12:50:33,636 INFO  L130       PetriNetUnfolder]: 7/174 cut-off events.
[2023-10-27 12:50:33,637 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:50:33,639 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-27 12:50:33,641 INFO  L119        LiptonReduction]: Number of co-enabled transitions 3068
[2023-10-27 12:50:37,869 INFO  L134        LiptonReduction]: Checked pairs total: 11184
[2023-10-27 12:50:37,869 INFO  L136        LiptonReduction]: Total number of compositions: 98
[2023-10-27 12:50:37,907 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:50:37,926 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;@40f6b251, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:50:37,926 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 12 error locations.
[2023-10-27 12:50:37,928 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-27 12:50:37,928 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:50:37,928 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:37,929 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:50:37,929 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-27 12:50:37,933 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:37,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 13631503, now seen corresponding path program 1 times
[2023-10-27 12:50:37,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:37,947 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922497673]
[2023-10-27 12:50:37,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:37,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:38,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:38,286 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-27 12:50:38,301 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:38,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922497673]
[2023-10-27 12:50:38,302 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922497673] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:38,303 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:38,303 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:38,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554815759]
[2023-10-27 12:50:38,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:38,311 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:38,311 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:38,342 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:38,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:38,404 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 119 out of 232
[2023-10-27 12:50:38,408 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-27 12:50:38,408 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:38,408 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 232
[2023-10-27 12:50:38,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:38,581 INFO  L130       PetriNetUnfolder]: 134/429 cut-off events.
[2023-10-27 12:50:38,582 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:50:38,583 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-27 12:50:38,586 INFO  L137   encePairwiseOnDemand]: 219/232 looper letters, 39 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2023-10-27 12:50:38,601 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 63 transitions, 225 flow
[2023-10-27 12:50:38,602 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:38,604 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:38,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 411 transitions.
[2023-10-27 12:50:38,619 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5905172413793104
[2023-10-27 12:50:38,620 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 411 transitions.
[2023-10-27 12:50:38,621 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 411 transitions.
[2023-10-27 12:50:38,624 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:38,626 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 411 transitions.
[2023-10-27 12:50:38,630 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-27 12:50:38,640 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-27 12:50:38,641 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-27 12:50:38,657 INFO  L175             Difference]: Start difference. First operand has 45 places, 44 transitions, 93 flow. Second operand 3 states and 411 transitions.
[2023-10-27 12:50:38,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 63 transitions, 225 flow
[2023-10-27 12:50:38,660 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 225 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:50:38,662 INFO  L231             Difference]: Finished difference. Result has 48 places, 50 transitions, 159 flow
[2023-10-27 12:50:38,679 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-27 12:50:38,684 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places.
[2023-10-27 12:50:38,684 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 50 transitions, 159 flow
[2023-10-27 12:50:38,684 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-27 12:50:38,685 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:38,685 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:38,686 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-27 12:50:38,686 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-27 12:50:38,687 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:38,687 INFO  L85        PathProgramCache]: Analyzing trace with hash 750408184, now seen corresponding path program 1 times
[2023-10-27 12:50:38,689 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:38,690 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099644433]
[2023-10-27 12:50:38,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:38,691 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:38,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:38,803 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-27 12:50:38,804 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:38,804 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099644433]
[2023-10-27 12:50:38,805 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099644433] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:38,805 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:38,806 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:38,806 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68153976]
[2023-10-27 12:50:38,806 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:38,807 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:38,811 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:38,811 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:38,812 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:38,825 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 232
[2023-10-27 12:50:38,831 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-27 12:50:38,831 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:38,831 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 232
[2023-10-27 12:50:38,831 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:38,963 INFO  L130       PetriNetUnfolder]: 121/425 cut-off events.
[2023-10-27 12:50:38,963 INFO  L131       PetriNetUnfolder]: For 122/125 co-relation queries the response was YES.
[2023-10-27 12:50:38,966 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-27 12:50:38,970 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 28 selfloop transitions, 3 changer transitions 2/59 dead transitions.
[2023-10-27 12:50:38,970 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 249 flow
[2023-10-27 12:50:38,970 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:38,971 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:38,971 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions.
[2023-10-27 12:50:38,985 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5876436781609196
[2023-10-27 12:50:38,986 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 409 transitions.
[2023-10-27 12:50:38,986 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions.
[2023-10-27 12:50:38,986 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:38,986 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions.
[2023-10-27 12:50:38,989 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-27 12:50:38,991 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-27 12:50:38,991 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-27 12:50:38,991 INFO  L175             Difference]: Start difference. First operand has 48 places, 50 transitions, 159 flow. Second operand 3 states and 409 transitions.
[2023-10-27 12:50:38,991 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 249 flow
[2023-10-27 12:50:38,995 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 59 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:38,996 INFO  L231             Difference]: Finished difference. Result has 50 places, 52 transitions, 165 flow
[2023-10-27 12:50:38,996 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-27 12:50:38,997 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places.
[2023-10-27 12:50:38,997 INFO  L495      AbstractCegarLoop]: Abstraction has has 50 places, 52 transitions, 165 flow
[2023-10-27 12:50:38,998 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-27 12:50:38,998 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:38,998 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:38,998 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-27 12:50:38,998 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-27 12:50:38,999 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:38,999 INFO  L85        PathProgramCache]: Analyzing trace with hash 439345902, now seen corresponding path program 1 times
[2023-10-27 12:50:38,999 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:39,000 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926640856]
[2023-10-27 12:50:39,000 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:39,000 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:39,045 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:39,098 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-27 12:50:39,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:39,099 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926640856]
[2023-10-27 12:50:39,100 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926640856] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:39,100 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:39,100 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:39,101 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374061222]
[2023-10-27 12:50:39,101 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:39,101 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:39,102 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:39,102 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:39,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:39,145 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 120 out of 232
[2023-10-27 12:50:39,146 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-27 12:50:39,146 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:39,146 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 232
[2023-10-27 12:50:39,146 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:39,256 INFO  L130       PetriNetUnfolder]: 120/423 cut-off events.
[2023-10-27 12:50:39,256 INFO  L131       PetriNetUnfolder]: For 82/87 co-relation queries the response was YES.
[2023-10-27 12:50:39,256 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-27 12:50:39,258 INFO  L137   encePairwiseOnDemand]: 226/232 looper letters, 30 selfloop transitions, 7 changer transitions 0/62 dead transitions.
[2023-10-27 12:50:39,258 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 62 transitions, 267 flow
[2023-10-27 12:50:39,258 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:39,263 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:39,264 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 391 transitions.
[2023-10-27 12:50:39,264 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5617816091954023
[2023-10-27 12:50:39,264 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 391 transitions.
[2023-10-27 12:50:39,264 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 391 transitions.
[2023-10-27 12:50:39,265 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:39,265 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 391 transitions.
[2023-10-27 12:50:39,266 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-27 12:50:39,267 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-27 12:50:39,267 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-27 12:50:39,267 INFO  L175             Difference]: Start difference. First operand has 50 places, 52 transitions, 165 flow. Second operand 3 states and 391 transitions.
[2023-10-27 12:50:39,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 62 transitions, 267 flow
[2023-10-27 12:50:39,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 261 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:39,286 INFO  L231             Difference]: Finished difference. Result has 52 places, 57 transitions, 215 flow
[2023-10-27 12:50:39,287 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-27 12:50:39,288 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places.
[2023-10-27 12:50:39,290 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 57 transitions, 215 flow
[2023-10-27 12:50:39,290 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-27 12:50:39,290 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:39,291 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:39,291 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-27 12:50:39,291 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-27 12:50:39,292 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:39,292 INFO  L85        PathProgramCache]: Analyzing trace with hash 969654521, now seen corresponding path program 1 times
[2023-10-27 12:50:39,292 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:39,292 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969486227]
[2023-10-27 12:50:39,292 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:39,293 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:39,313 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:39,359 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-27 12:50:39,359 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:39,360 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969486227]
[2023-10-27 12:50:39,360 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969486227] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:39,360 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:39,360 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:39,360 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183721579]
[2023-10-27 12:50:39,361 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:39,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:39,364 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:39,365 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:39,365 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:39,387 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 124 out of 232
[2023-10-27 12:50:39,387 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-27 12:50:39,388 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:39,388 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 232
[2023-10-27 12:50:39,388 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:39,501 INFO  L130       PetriNetUnfolder]: 117/389 cut-off events.
[2023-10-27 12:50:39,503 INFO  L131       PetriNetUnfolder]: For 191/207 co-relation queries the response was YES.
[2023-10-27 12:50:39,504 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-27 12:50:39,505 INFO  L137   encePairwiseOnDemand]: 228/232 looper letters, 36 selfloop transitions, 4 changer transitions 0/68 dead transitions.
[2023-10-27 12:50:39,505 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 68 transitions, 327 flow
[2023-10-27 12:50:39,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:39,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:39,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions.
[2023-10-27 12:50:39,507 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5804597701149425
[2023-10-27 12:50:39,507 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 404 transitions.
[2023-10-27 12:50:39,507 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions.
[2023-10-27 12:50:39,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:39,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions.
[2023-10-27 12:50:39,512 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-27 12:50:39,513 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-27 12:50:39,529 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-27 12:50:39,529 INFO  L175             Difference]: Start difference. First operand has 52 places, 57 transitions, 215 flow. Second operand 3 states and 404 transitions.
[2023-10-27 12:50:39,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 68 transitions, 327 flow
[2023-10-27 12:50:39,532 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 68 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:39,533 INFO  L231             Difference]: Finished difference. Result has 53 places, 59 transitions, 225 flow
[2023-10-27 12:50:39,534 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-27 12:50:39,535 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places.
[2023-10-27 12:50:39,535 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 59 transitions, 225 flow
[2023-10-27 12:50:39,535 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-27 12:50:39,536 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:39,536 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:50:39,536 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-27 12:50:39,536 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-27 12:50:39,536 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:39,537 INFO  L85        PathProgramCache]: Analyzing trace with hash 598293283, now seen corresponding path program 1 times
[2023-10-27 12:50:39,537 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:39,537 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372344819]
[2023-10-27 12:50:39,537 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:39,537 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:39,596 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:50:39,596 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:50:39,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:50:39,685 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:50:39,685 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:50:39,687 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining)
[2023-10-27 12:50:39,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining)
[2023-10-27 12:50:39,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining)
[2023-10-27 12:50:39,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining)
[2023-10-27 12:50:39,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining)
[2023-10-27 12:50:39,690 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining)
[2023-10-27 12:50:39,691 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining)
[2023-10-27 12:50:39,691 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining)
[2023-10-27 12:50:39,691 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining)
[2023-10-27 12:50:39,697 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining)
[2023-10-27 12:50:39,697 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining)
[2023-10-27 12:50:39,697 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining)
[2023-10-27 12:50:39,697 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-27 12:50:39,698 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1]
[2023-10-27 12:50:39,701 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:50:39,701 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-27 12:50:39,738 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-27 12:50:39,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,913 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-27 12:50:39,913 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:50:39,914 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-27 12:50:39,914 INFO  L82        GeneralOperation]: Start removeDead. Operand has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,915 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,916 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:50:39,916 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,916 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,916 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 162 places, 161 transitions, 334 flow
[2023-10-27 12:50:39,964 INFO  L130       PetriNetUnfolder]: 10/259 cut-off events.
[2023-10-27 12:50:39,964 INFO  L131       PetriNetUnfolder]: For 2/2 co-relation queries the response was YES.
[2023-10-27 12:50:39,965 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-27 12:50:39,968 INFO  L119        LiptonReduction]: Number of co-enabled transitions 7540
[2023-10-27 12:50:43,894 INFO  L134        LiptonReduction]: Checked pairs total: 34782
[2023-10-27 12:50:43,895 INFO  L136        LiptonReduction]: Total number of compositions: 108
[2023-10-27 12:50:43,896 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:50:43,909 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;@40f6b251, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:50:43,910 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-10-27 12:50:43,914 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-27 12:50:43,914 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:50:43,914 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:43,915 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:50:43,915 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-27 12:50:43,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:43,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 22736524, now seen corresponding path program 1 times
[2023-10-27 12:50:43,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:43,915 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273322283]
[2023-10-27 12:50:43,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:43,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:43,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:43,956 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-27 12:50:43,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:43,958 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273322283]
[2023-10-27 12:50:43,958 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273322283] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:43,958 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:43,958 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:43,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409076712]
[2023-10-27 12:50:43,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:43,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:43,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:43,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:43,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:43,986 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 269
[2023-10-27 12:50:43,993 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-27 12:50:43,994 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:43,994 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 269
[2023-10-27 12:50:43,994 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:45,127 INFO  L130       PetriNetUnfolder]: 4106/7967 cut-off events.
[2023-10-27 12:50:45,128 INFO  L131       PetriNetUnfolder]: For 57/57 co-relation queries the response was YES.
[2023-10-27 12:50:45,141 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-27 12:50:45,197 INFO  L137   encePairwiseOnDemand]: 252/269 looper letters, 61 selfloop transitions, 11 changer transitions 0/92 dead transitions.
[2023-10-27 12:50:45,213 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 92 transitions, 345 flow
[2023-10-27 12:50:45,214 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:45,214 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:45,215 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-27 12:50:45,215 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-27 12:50:45,215 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-27 12:50:45,215 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-27 12:50:45,215 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:45,216 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-27 12:50:45,217 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-27 12:50:45,218 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-27 12:50:45,219 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-27 12:50:45,219 INFO  L175             Difference]: Start difference. First operand has 64 places, 61 transitions, 134 flow. Second operand 3 states and 503 transitions.
[2023-10-27 12:50:45,219 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 92 transitions, 345 flow
[2023-10-27 12:50:45,220 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 92 transitions, 343 flow, removed 1 selfloop flow, removed 0 redundant places.
[2023-10-27 12:50:45,222 INFO  L231             Difference]: Finished difference. Result has 67 places, 70 transitions, 224 flow
[2023-10-27 12:50:45,223 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-27 12:50:45,225 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 3 predicate places.
[2023-10-27 12:50:45,225 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 70 transitions, 224 flow
[2023-10-27 12:50:45,228 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-27 12:50:45,228 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:45,228 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:45,228 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-27 12:50:45,228 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-27 12:50:45,229 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:45,229 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006456856, now seen corresponding path program 1 times
[2023-10-27 12:50:45,229 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:45,229 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581861644]
[2023-10-27 12:50:45,229 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:45,229 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:45,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:45,274 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-27 12:50:45,274 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:45,274 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581861644]
[2023-10-27 12:50:45,275 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581861644] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:45,275 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:45,275 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:45,276 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203774658]
[2023-10-27 12:50:45,276 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:45,277 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:45,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:45,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:45,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:45,292 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 269
[2023-10-27 12:50:45,305 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-27 12:50:45,306 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:45,306 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 269
[2023-10-27 12:50:45,306 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:46,391 INFO  L130       PetriNetUnfolder]: 3685/7514 cut-off events.
[2023-10-27 12:50:46,391 INFO  L131       PetriNetUnfolder]: For 2646/3130 co-relation queries the response was YES.
[2023-10-27 12:50:46,399 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-27 12:50:46,462 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 50 selfloop transitions, 4 changer transitions 0/90 dead transitions.
[2023-10-27 12:50:46,469 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 90 transitions, 384 flow
[2023-10-27 12:50:46,470 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:46,470 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:46,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions.
[2023-10-27 12:50:46,480 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6232961586121437
[2023-10-27 12:50:46,480 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 503 transitions.
[2023-10-27 12:50:46,480 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions.
[2023-10-27 12:50:46,480 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:46,481 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions.
[2023-10-27 12:50:46,482 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-27 12:50:46,483 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-27 12:50:46,483 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-27 12:50:46,487 INFO  L175             Difference]: Start difference. First operand has 67 places, 70 transitions, 224 flow. Second operand 3 states and 503 transitions.
[2023-10-27 12:50:46,488 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 90 transitions, 384 flow
[2023-10-27 12:50:46,494 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 358 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:46,502 INFO  L231             Difference]: Finished difference. Result has 69 places, 73 transitions, 232 flow
[2023-10-27 12:50:46,502 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-27 12:50:46,504 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 5 predicate places.
[2023-10-27 12:50:46,504 INFO  L495      AbstractCegarLoop]: Abstraction has has 69 places, 73 transitions, 232 flow
[2023-10-27 12:50:46,505 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-27 12:50:46,505 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:46,505 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:46,505 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-27 12:50:46,505 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-27 12:50:46,505 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:46,505 INFO  L85        PathProgramCache]: Analyzing trace with hash -420520761, now seen corresponding path program 1 times
[2023-10-27 12:50:46,521 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:46,521 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897989136]
[2023-10-27 12:50:46,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:46,522 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:46,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:46,541 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-27 12:50:46,541 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:46,541 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897989136]
[2023-10-27 12:50:46,542 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897989136] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:46,542 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:46,542 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:46,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134463527]
[2023-10-27 12:50:46,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:46,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:46,543 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:46,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:46,550 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:46,593 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 269
[2023-10-27 12:50:46,594 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-27 12:50:46,594 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:46,595 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 269
[2023-10-27 12:50:46,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:47,684 INFO  L130       PetriNetUnfolder]: 3968/7815 cut-off events.
[2023-10-27 12:50:47,684 INFO  L131       PetriNetUnfolder]: For 1629/1907 co-relation queries the response was YES.
[2023-10-27 12:50:47,701 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-27 12:50:47,948 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 51 selfloop transitions, 12 changer transitions 0/96 dead transitions.
[2023-10-27 12:50:47,948 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 96 transitions, 422 flow
[2023-10-27 12:50:47,949 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:47,949 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:47,949 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 484 transitions.
[2023-10-27 12:50:47,950 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5997521685254027
[2023-10-27 12:50:47,950 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 484 transitions.
[2023-10-27 12:50:47,950 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 484 transitions.
[2023-10-27 12:50:47,950 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:47,950 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 484 transitions.
[2023-10-27 12:50:47,951 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-27 12:50:47,953 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-27 12:50:47,954 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-27 12:50:47,954 INFO  L175             Difference]: Start difference. First operand has 69 places, 73 transitions, 232 flow. Second operand 3 states and 484 transitions.
[2023-10-27 12:50:47,954 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 96 transitions, 422 flow
[2023-10-27 12:50:47,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 96 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:47,961 INFO  L231             Difference]: Finished difference. Result has 71 places, 83 transitions, 330 flow
[2023-10-27 12:50:47,961 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-27 12:50:47,962 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 7 predicate places.
[2023-10-27 12:50:47,963 INFO  L495      AbstractCegarLoop]: Abstraction has has 71 places, 83 transitions, 330 flow
[2023-10-27 12:50:47,963 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-27 12:50:47,963 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:47,963 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:47,963 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-27 12:50:47,963 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-27 12:50:47,964 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:47,964 INFO  L85        PathProgramCache]: Analyzing trace with hash 777101591, now seen corresponding path program 1 times
[2023-10-27 12:50:47,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:47,964 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247116073]
[2023-10-27 12:50:47,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:47,964 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:47,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:48,025 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-27 12:50:48,025 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:48,025 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247116073]
[2023-10-27 12:50:48,025 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247116073] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:48,025 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:48,026 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:48,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031926743]
[2023-10-27 12:50:48,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:48,026 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:48,026 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:48,027 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:48,027 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:48,041 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-27 12:50:48,041 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-27 12:50:48,041 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:48,041 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-27 12:50:48,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:49,051 INFO  L130       PetriNetUnfolder]: 4157/8465 cut-off events.
[2023-10-27 12:50:49,051 INFO  L131       PetriNetUnfolder]: For 5135/6762 co-relation queries the response was YES.
[2023-10-27 12:50:49,063 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-27 12:50:49,125 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 63 selfloop transitions, 6 changer transitions 0/111 dead transitions.
[2023-10-27 12:50:49,125 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 571 flow
[2023-10-27 12:50:49,126 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:49,126 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:49,170 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 499 transitions.
[2023-10-27 12:50:49,170 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6183395291201983
[2023-10-27 12:50:49,170 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 499 transitions.
[2023-10-27 12:50:49,170 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 499 transitions.
[2023-10-27 12:50:49,171 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:49,171 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 499 transitions.
[2023-10-27 12:50:49,172 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-27 12:50:49,173 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-27 12:50:49,173 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-27 12:50:49,173 INFO  L175             Difference]: Start difference. First operand has 71 places, 83 transitions, 330 flow. Second operand 3 states and 499 transitions.
[2023-10-27 12:50:49,174 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 571 flow
[2023-10-27 12:50:49,182 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 111 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:49,183 INFO  L231             Difference]: Finished difference. Result has 72 places, 87 transitions, 348 flow
[2023-10-27 12:50:49,184 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-27 12:50:49,185 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 8 predicate places.
[2023-10-27 12:50:49,185 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 87 transitions, 348 flow
[2023-10-27 12:50:49,186 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-27 12:50:49,186 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:49,186 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-27 12:50:49,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-10-27 12:50:49,186 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-27 12:50:49,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:49,187 INFO  L85        PathProgramCache]: Analyzing trace with hash 1261976369, now seen corresponding path program 1 times
[2023-10-27 12:50:49,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:49,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911283504]
[2023-10-27 12:50:49,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:49,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:49,214 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:49,254 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-27 12:50:49,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:49,255 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911283504]
[2023-10-27 12:50:49,255 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911283504] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:49,255 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:49,255 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:49,255 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696028453]
[2023-10-27 12:50:49,255 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:49,256 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:49,256 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:49,257 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:49,257 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:49,295 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-27 12:50:49,296 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-27 12:50:49,296 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:49,296 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-27 12:50:49,296 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:50,534 INFO  L130       PetriNetUnfolder]: 6039/11385 cut-off events.
[2023-10-27 12:50:50,534 INFO  L131       PetriNetUnfolder]: For 6574/7585 co-relation queries the response was YES.
[2023-10-27 12:50:50,575 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-27 12:50:50,639 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 70 selfloop transitions, 19 changer transitions 0/122 dead transitions.
[2023-10-27 12:50:50,639 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 122 transitions, 661 flow
[2023-10-27 12:50:50,639 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:50,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:50,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 493 transitions.
[2023-10-27 12:50:50,641 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.61090458488228
[2023-10-27 12:50:50,641 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 493 transitions.
[2023-10-27 12:50:50,641 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 493 transitions.
[2023-10-27 12:50:50,642 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:50,642 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 493 transitions.
[2023-10-27 12:50:50,643 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-27 12:50:50,644 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-27 12:50:50,644 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-27 12:50:50,645 INFO  L175             Difference]: Start difference. First operand has 72 places, 87 transitions, 348 flow. Second operand 3 states and 493 transitions.
[2023-10-27 12:50:50,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 122 transitions, 661 flow
[2023-10-27 12:50:50,648 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:50:50,652 INFO  L231             Difference]: Finished difference. Result has 75 places, 102 transitions, 524 flow
[2023-10-27 12:50:50,652 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-27 12:50:50,653 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-27 12:50:50,653 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 102 transitions, 524 flow
[2023-10-27 12:50:50,653 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-27 12:50:50,653 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:50,653 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-27 12:50:50,653 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-27 12:50:50,654 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-27 12:50:50,654 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:50,669 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922484543, now seen corresponding path program 1 times
[2023-10-27 12:50:50,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:50,670 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909510465]
[2023-10-27 12:50:50,670 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:50,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:50,684 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:50,804 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-27 12:50:50,817 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:50,817 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909510465]
[2023-10-27 12:50:50,817 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909510465] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:50:50,818 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890479218]
[2023-10-27 12:50:50,818 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:50,818 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:50:50,818 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:50:50,837 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-27 12:50:50,877 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-27 12:50:50,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:50,998 INFO  L263         TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:50:51,001 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:50:51,130 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-27 12:50:51,131 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:50:51,131 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890479218] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:51,131 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:50:51,131 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-27 12:50:51,131 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96868231]
[2023-10-27 12:50:51,131 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:51,132 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-27 12:50:51,132 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:51,132 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-27 12:50:51,132 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-27 12:50:51,172 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 269
[2023-10-27 12:50:51,173 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-27 12:50:51,173 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:51,173 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 269
[2023-10-27 12:50:51,173 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:52,819 INFO  L130       PetriNetUnfolder]: 8285/15913 cut-off events.
[2023-10-27 12:50:52,819 INFO  L131       PetriNetUnfolder]: For 17760/19750 co-relation queries the response was YES.
[2023-10-27 12:50:52,856 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-27 12:50:52,964 INFO  L137   encePairwiseOnDemand]: 261/269 looper letters, 167 selfloop transitions, 16 changer transitions 3/236 dead transitions.
[2023-10-27 12:50:52,964 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 236 transitions, 1545 flow
[2023-10-27 12:50:52,964 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:50:52,964 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:50:52,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1151 transitions.
[2023-10-27 12:50:52,967 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112586298459904
[2023-10-27 12:50:52,967 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1151 transitions.
[2023-10-27 12:50:52,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1151 transitions.
[2023-10-27 12:50:52,968 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:52,968 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1151 transitions.
[2023-10-27 12:50:52,970 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-27 12:50:52,972 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-27 12:50:52,973 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-27 12:50:52,973 INFO  L175             Difference]: Start difference. First operand has 75 places, 102 transitions, 524 flow. Second operand 7 states and 1151 transitions.
[2023-10-27 12:50:52,973 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 236 transitions, 1545 flow
[2023-10-27 12:50:53,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 236 transitions, 1445 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:53,216 INFO  L231             Difference]: Finished difference. Result has 82 places, 117 transitions, 584 flow
[2023-10-27 12:50:53,216 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-27 12:50:53,217 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 18 predicate places.
[2023-10-27 12:50:53,217 INFO  L495      AbstractCegarLoop]: Abstraction has has 82 places, 117 transitions, 584 flow
[2023-10-27 12:50:53,217 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-27 12:50:53,217 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:53,218 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-27 12:50:53,238 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-27 12:50:53,422 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-27 12:50:53,422 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-27 12:50:53,423 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:53,423 INFO  L85        PathProgramCache]: Analyzing trace with hash 597665167, now seen corresponding path program 1 times
[2023-10-27 12:50:53,423 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:53,423 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379463026]
[2023-10-27 12:50:53,423 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:53,424 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:53,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:53,575 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-27 12:50:53,575 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:53,576 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379463026]
[2023-10-27 12:50:53,576 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379463026] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:53,576 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:53,576 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:50:53,576 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460969628]
[2023-10-27 12:50:53,576 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:53,576 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:53,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:53,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:53,577 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:53,614 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 269
[2023-10-27 12:50:53,615 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-27 12:50:53,615 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:53,615 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 269
[2023-10-27 12:50:53,615 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:54,798 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-27 12:50:54,798 INFO  L383   tUnfolder$Statistics]: this new event has 46 ancestors and is cut-off event
[2023-10-27 12:50:54,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-27 12:50:54,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-27 12:50:54,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 46 ancestors and is cut-off event
[2023-10-27 12:50:54,884 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-27 12:50:54,884 INFO  L383   tUnfolder$Statistics]: this new event has 47 ancestors and is cut-off event
[2023-10-27 12:50:54,884 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-27 12:50:54,884 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-27 12:50:54,885 INFO  L386   tUnfolder$Statistics]:   existing Event has 47 ancestors and is cut-off event
[2023-10-27 12:50:55,498 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-27 12:50:55,499 INFO  L383   tUnfolder$Statistics]: this new event has 52 ancestors and is cut-off event
[2023-10-27 12:50:55,499 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:50:55,499 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:50:55,499 INFO  L386   tUnfolder$Statistics]:   existing Event has 52 ancestors and is cut-off event
[2023-10-27 12:50:55,586 INFO  L130       PetriNetUnfolder]: 8494/17801 cut-off events.
[2023-10-27 12:50:55,601 INFO  L131       PetriNetUnfolder]: For 20941/23812 co-relation queries the response was YES.
[2023-10-27 12:50:55,692 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-27 12:50:55,889 INFO  L137   encePairwiseOnDemand]: 257/269 looper letters, 84 selfloop transitions, 14 changer transitions 0/160 dead transitions.
[2023-10-27 12:50:55,889 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 160 transitions, 996 flow
[2023-10-27 12:50:55,889 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:55,890 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:55,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 487 transitions.
[2023-10-27 12:50:55,891 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6034696406443618
[2023-10-27 12:50:55,891 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 487 transitions.
[2023-10-27 12:50:55,891 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 487 transitions.
[2023-10-27 12:50:55,891 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:55,891 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 487 transitions.
[2023-10-27 12:50:55,892 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-27 12:50:55,893 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-27 12:50:55,894 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-27 12:50:55,894 INFO  L175             Difference]: Start difference. First operand has 82 places, 117 transitions, 584 flow. Second operand 3 states and 487 transitions.
[2023-10-27 12:50:55,894 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 160 transitions, 996 flow
[2023-10-27 12:50:55,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 160 transitions, 996 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-27 12:50:55,960 INFO  L231             Difference]: Finished difference. Result has 85 places, 126 transitions, 670 flow
[2023-10-27 12:50:55,960 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-27 12:50:55,961 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 21 predicate places.
[2023-10-27 12:50:55,961 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 126 transitions, 670 flow
[2023-10-27 12:50:55,961 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-27 12:50:55,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:55,962 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-27 12:50:55,962 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-27 12:50:55,962 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-27 12:50:55,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:55,962 INFO  L85        PathProgramCache]: Analyzing trace with hash -2119960399, now seen corresponding path program 2 times
[2023-10-27 12:50:55,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:55,963 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951453541]
[2023-10-27 12:50:55,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:55,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:55,990 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:56,189 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-27 12:50:56,189 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:56,189 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951453541]
[2023-10-27 12:50:56,189 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951453541] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:56,189 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:56,189 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-27 12:50:56,190 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066969480]
[2023-10-27 12:50:56,190 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:56,190 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-27 12:50:56,191 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:56,191 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-27 12:50:56,191 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-27 12:50:56,255 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 142 out of 269
[2023-10-27 12:50:56,256 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-27 12:50:56,256 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:56,256 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 269
[2023-10-27 12:50:56,256 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:56,703 INFO  L130       PetriNetUnfolder]: 1010/2573 cut-off events.
[2023-10-27 12:50:56,717 INFO  L131       PetriNetUnfolder]: For 2202/2418 co-relation queries the response was YES.
[2023-10-27 12:50:56,720 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-27 12:50:56,724 INFO  L137   encePairwiseOnDemand]: 258/269 looper letters, 40 selfloop transitions, 16 changer transitions 0/91 dead transitions.
[2023-10-27 12:50:56,724 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 91 transitions, 528 flow
[2023-10-27 12:50:56,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:50:56,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:50:56,725 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 615 transitions.
[2023-10-27 12:50:56,726 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5715613382899628
[2023-10-27 12:50:56,726 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 615 transitions.
[2023-10-27 12:50:56,726 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 615 transitions.
[2023-10-27 12:50:56,727 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:56,727 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 615 transitions.
[2023-10-27 12:50:56,728 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-27 12:50:56,729 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-27 12:50:56,734 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-27 12:50:56,734 INFO  L175             Difference]: Start difference. First operand has 85 places, 126 transitions, 670 flow. Second operand 4 states and 615 transitions.
[2023-10-27 12:50:56,734 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 91 transitions, 528 flow
[2023-10-27 12:50:56,764 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 462 flow, removed 21 selfloop flow, removed 6 redundant places.
[2023-10-27 12:50:56,766 INFO  L231             Difference]: Finished difference. Result has 75 places, 77 transitions, 333 flow
[2023-10-27 12:50:56,766 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-27 12:50:56,766 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 11 predicate places.
[2023-10-27 12:50:56,767 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 77 transitions, 333 flow
[2023-10-27 12:50:56,767 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-27 12:50:56,767 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:56,767 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:56,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-27 12:50:56,767 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-27 12:50:56,768 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:56,768 INFO  L85        PathProgramCache]: Analyzing trace with hash -674470246, now seen corresponding path program 1 times
[2023-10-27 12:50:56,768 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:56,768 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050723424]
[2023-10-27 12:50:56,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:56,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:56,793 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:56,822 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-27 12:50:56,822 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:56,823 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050723424]
[2023-10-27 12:50:56,823 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050723424] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:56,823 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:56,823 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:50:56,823 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250143275]
[2023-10-27 12:50:56,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:56,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:56,824 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:56,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:56,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:56,836 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 149 out of 269
[2023-10-27 12:50:56,836 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-27 12:50:56,846 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:56,846 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 269
[2023-10-27 12:50:56,846 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:57,154 INFO  L130       PetriNetUnfolder]: 1161/2703 cut-off events.
[2023-10-27 12:50:57,155 INFO  L131       PetriNetUnfolder]: For 1713/1792 co-relation queries the response was YES.
[2023-10-27 12:50:57,158 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-27 12:50:57,161 INFO  L137   encePairwiseOnDemand]: 263/269 looper letters, 56 selfloop transitions, 8 changer transitions 0/100 dead transitions.
[2023-10-27 12:50:57,162 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 100 transitions, 561 flow
[2023-10-27 12:50:57,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:57,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:57,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions.
[2023-10-27 12:50:57,177 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6158612143742255
[2023-10-27 12:50:57,178 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 497 transitions.
[2023-10-27 12:50:57,178 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 497 transitions.
[2023-10-27 12:50:57,178 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:57,178 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 497 transitions.
[2023-10-27 12:50:57,179 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-27 12:50:57,187 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-27 12:50:57,187 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-27 12:50:57,187 INFO  L175             Difference]: Start difference. First operand has 75 places, 77 transitions, 333 flow. Second operand 3 states and 497 transitions.
[2023-10-27 12:50:57,188 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 100 transitions, 561 flow
[2023-10-27 12:50:57,191 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 538 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:57,195 INFO  L231             Difference]: Finished difference. Result has 77 places, 82 transitions, 383 flow
[2023-10-27 12:50:57,195 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-27 12:50:57,196 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 13 predicate places.
[2023-10-27 12:50:57,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 383 flow
[2023-10-27 12:50:57,196 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-27 12:50:57,196 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:57,198 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-27 12:50:57,198 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-27 12:50:57,199 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-27 12:50:57,199 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:57,199 INFO  L85        PathProgramCache]: Analyzing trace with hash 545280907, now seen corresponding path program 1 times
[2023-10-27 12:50:57,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:57,199 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963204146]
[2023-10-27 12:50:57,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:57,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:57,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:57,355 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-27 12:50:57,355 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:57,355 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963204146]
[2023-10-27 12:50:57,355 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963204146] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:50:57,356 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:50:57,356 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:50:57,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493333233]
[2023-10-27 12:50:57,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:50:57,357 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:50:57,357 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:57,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:50:57,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:50:57,399 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 146 out of 269
[2023-10-27 12:50:57,399 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-27 12:50:57,399 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:57,399 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 269
[2023-10-27 12:50:57,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:57,880 INFO  L130       PetriNetUnfolder]: 1581/3753 cut-off events.
[2023-10-27 12:50:57,881 INFO  L131       PetriNetUnfolder]: For 3378/3613 co-relation queries the response was YES.
[2023-10-27 12:50:57,885 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-27 12:50:57,893 INFO  L137   encePairwiseOnDemand]: 260/269 looper letters, 67 selfloop transitions, 15 changer transitions 0/119 dead transitions.
[2023-10-27 12:50:57,893 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 119 transitions, 732 flow
[2023-10-27 12:50:57,893 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:50:57,893 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:50:57,900 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions.
[2023-10-27 12:50:57,900 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6146220570012392
[2023-10-27 12:50:57,900 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 496 transitions.
[2023-10-27 12:50:57,900 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions.
[2023-10-27 12:50:57,912 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:57,913 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions.
[2023-10-27 12:50:57,914 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-27 12:50:57,915 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-27 12:50:57,915 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-27 12:50:57,915 INFO  L175             Difference]: Start difference. First operand has 77 places, 82 transitions, 383 flow. Second operand 3 states and 496 transitions.
[2023-10-27 12:50:57,915 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 119 transitions, 732 flow
[2023-10-27 12:50:57,922 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 119 transitions, 704 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:50:57,933 INFO  L231             Difference]: Finished difference. Result has 78 places, 95 transitions, 505 flow
[2023-10-27 12:50:57,933 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-27 12:50:57,934 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 14 predicate places.
[2023-10-27 12:50:57,934 INFO  L495      AbstractCegarLoop]: Abstraction has has 78 places, 95 transitions, 505 flow
[2023-10-27 12:50:57,934 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-27 12:50:57,935 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:57,935 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-27 12:50:57,935 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-27 12:50:57,935 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-27 12:50:57,935 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:57,935 INFO  L85        PathProgramCache]: Analyzing trace with hash 2143255471, now seen corresponding path program 2 times
[2023-10-27 12:50:57,936 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:57,936 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496879381]
[2023-10-27 12:50:57,936 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:57,936 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:57,965 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:50:58,156 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-27 12:50:58,157 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:50:58,157 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496879381]
[2023-10-27 12:50:58,157 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496879381] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:50:58,157 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905996605]
[2023-10-27 12:50:58,157 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:50:58,157 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:50:58,158 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:50:58,174 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-27 12:50:58,204 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-27 12:50:58,304 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-27 12:50:58,304 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:50:58,305 INFO  L263         TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-27 12:50:58,307 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:50:58,475 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-27 12:50:58,522 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:50:58,523 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-27 12:50:58,537 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-27 12:50:58,537 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:50:58,607 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:50:58,607 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-27 12:50:58,612 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-27 12:50:58,654 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-27 12:50:58,654 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905996605] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:50:58,654 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:50:58,654 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-27 12:50:58,655 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293723105]
[2023-10-27 12:50:58,655 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:50:58,656 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:50:58,656 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:50:58,656 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:50:58,657 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90
[2023-10-27 12:50:58,891 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 269
[2023-10-27 12:50:58,893 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-27 12:50:58,893 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:50:58,893 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 269
[2023-10-27 12:50:58,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:50:59,310 INFO  L130       PetriNetUnfolder]: 800/2211 cut-off events.
[2023-10-27 12:50:59,311 INFO  L131       PetriNetUnfolder]: For 2345/2426 co-relation queries the response was YES.
[2023-10-27 12:50:59,314 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-27 12:50:59,318 INFO  L137   encePairwiseOnDemand]: 264/269 looper letters, 61 selfloop transitions, 13 changer transitions 1/111 dead transitions.
[2023-10-27 12:50:59,333 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 719 flow
[2023-10-27 12:50:59,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:50:59,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:50:59,334 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 631 transitions.
[2023-10-27 12:50:59,335 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5864312267657993
[2023-10-27 12:50:59,335 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 631 transitions.
[2023-10-27 12:50:59,335 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 631 transitions.
[2023-10-27 12:50:59,335 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:50:59,335 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 631 transitions.
[2023-10-27 12:50:59,336 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-27 12:50:59,337 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-27 12:50:59,338 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-27 12:50:59,338 INFO  L175             Difference]: Start difference. First operand has 78 places, 95 transitions, 505 flow. Second operand 4 states and 631 transitions.
[2023-10-27 12:50:59,338 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 719 flow
[2023-10-27 12:50:59,342 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 111 transitions, 703 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-10-27 12:50:59,343 INFO  L231             Difference]: Finished difference. Result has 80 places, 90 transitions, 478 flow
[2023-10-27 12:50:59,344 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-27 12:50:59,344 INFO  L288   CegarLoopForPetriNet]: 64 programPoint places, 16 predicate places.
[2023-10-27 12:50:59,344 INFO  L495      AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 478 flow
[2023-10-27 12:50:59,344 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-27 12:50:59,345 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:50:59,345 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-27 12:50:59,361 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-10-27 12:50:59,548 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-27 12:50:59,549 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-27 12:50:59,549 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:50:59,549 INFO  L85        PathProgramCache]: Analyzing trace with hash -1802055890, now seen corresponding path program 1 times
[2023-10-27 12:50:59,550 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:50:59,550 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333141043]
[2023-10-27 12:50:59,550 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:50:59,550 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:50:59,572 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:50:59,589 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-27 12:50:59,615 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-27 12:50:59,625 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-27 12:50:59,625 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-27 12:50:59,625 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining)
[2023-10-27 12:50:59,625 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining)
[2023-10-27 12:50:59,626 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining)
[2023-10-27 12:50:59,627 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining)
[2023-10-27 12:50:59,641 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining)
[2023-10-27 12:50:59,641 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining)
[2023-10-27 12:50:59,642 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining)
[2023-10-27 12:50:59,642 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining)
[2023-10-27 12:50:59,642 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining)
[2023-10-27 12:50:59,642 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining)
[2023-10-27 12:50:59,642 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-10-27 12:50:59,642 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:50:59,643 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-27 12:50:59,643 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-27 12:50:59,663 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-10-27 12:50:59,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,717 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-27 12:50:59,717 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-27 12:50:59,718 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-27 12:50:59,718 INFO  L82        GeneralOperation]: Start removeDead. Operand has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,722 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,737 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-27 12:50:59,737 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,737 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,738 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 191 places, 188 transitions, 397 flow
[2023-10-27 12:50:59,788 INFO  L130       PetriNetUnfolder]: 13/344 cut-off events.
[2023-10-27 12:50:59,788 INFO  L131       PetriNetUnfolder]: For 7/7 co-relation queries the response was YES.
[2023-10-27 12:50:59,789 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-27 12:50:59,795 INFO  L119        LiptonReduction]: Number of co-enabled transitions 13416
[2023-10-27 12:51:04,632 INFO  L134        LiptonReduction]: Checked pairs total: 63011
[2023-10-27 12:51:04,632 INFO  L136        LiptonReduction]: Total number of compositions: 119
[2023-10-27 12:51:04,633 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-27 12:51:04,634 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;@40f6b251, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-27 12:51:04,634 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2023-10-27 12:51:04,635 INFO  L130       PetriNetUnfolder]: 0/6 cut-off events.
[2023-10-27 12:51:04,635 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-27 12:51:04,635 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:51:04,635 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1]
[2023-10-27 12:51:04,635 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-27 12:51:04,635 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:51:04,635 INFO  L85        PathProgramCache]: Analyzing trace with hash 33015180, now seen corresponding path program 1 times
[2023-10-27 12:51:04,635 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:51:04,635 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819364313]
[2023-10-27 12:51:04,635 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:51:04,635 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:51:04,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:51:04,677 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-27 12:51:04,677 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:51:04,677 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819364313]
[2023-10-27 12:51:04,677 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819364313] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:51:04,677 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:51:04,677 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:51:04,678 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499509048]
[2023-10-27 12:51:04,678 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:51:04,678 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:51:04,678 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:51:04,679 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:51:04,679 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:51:04,724 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 307
[2023-10-27 12:51:04,726 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-27 12:51:04,726 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:51:04,726 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 307
[2023-10-27 12:51:04,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:51:16,199 INFO  L130       PetriNetUnfolder]: 72169/116333 cut-off events.
[2023-10-27 12:51:16,200 INFO  L131       PetriNetUnfolder]: For 1881/1881 co-relation queries the response was YES.
[2023-10-27 12:51:16,388 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-27 12:51:16,831 INFO  L137   encePairwiseOnDemand]: 286/307 looper letters, 77 selfloop transitions, 14 changer transitions 0/117 dead transitions.
[2023-10-27 12:51:16,831 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 117 transitions, 449 flow
[2023-10-27 12:51:16,831 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:51:16,831 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:51:16,841 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 589 transitions.
[2023-10-27 12:51:16,842 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6395222584147665
[2023-10-27 12:51:16,842 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 589 transitions.
[2023-10-27 12:51:16,842 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 589 transitions.
[2023-10-27 12:51:16,843 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:51:16,843 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 589 transitions.
[2023-10-27 12:51:16,849 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-27 12:51:16,853 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-27 12:51:16,854 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-27 12:51:16,854 INFO  L175             Difference]: Start difference. First operand has 82 places, 77 transitions, 175 flow. Second operand 3 states and 589 transitions.
[2023-10-27 12:51:16,854 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 117 transitions, 449 flow
[2023-10-27 12:51:16,872 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 441 flow, removed 4 selfloop flow, removed 0 redundant places.
[2023-10-27 12:51:16,873 INFO  L231             Difference]: Finished difference. Result has 85 places, 89 transitions, 287 flow
[2023-10-27 12:51:16,874 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-27 12:51:16,874 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 3 predicate places.
[2023-10-27 12:51:16,874 INFO  L495      AbstractCegarLoop]: Abstraction has has 85 places, 89 transitions, 287 flow
[2023-10-27 12:51:16,874 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-27 12:51:16,874 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:51:16,875 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:51:16,875 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-27 12:51:16,875 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-27 12:51:16,875 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:51:16,875 INFO  L85        PathProgramCache]: Analyzing trace with hash 265562788, now seen corresponding path program 1 times
[2023-10-27 12:51:16,875 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:51:16,876 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386999325]
[2023-10-27 12:51:16,876 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:51:16,876 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:51:16,881 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:51:16,903 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-27 12:51:16,903 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:51:16,903 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386999325]
[2023-10-27 12:51:16,903 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386999325] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:51:16,903 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:51:16,903 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:51:16,904 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440118259]
[2023-10-27 12:51:16,904 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:51:16,905 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:51:16,905 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:51:16,905 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:51:16,905 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:51:16,954 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-27 12:51:16,955 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-27 12:51:16,955 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:51:16,955 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-27 12:51:16,955 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:51:21,641 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-27 12:51:21,642 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:51:21,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:21,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:21,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:21,642 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-27 12:51:21,642 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:51:21,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:51:21,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:51:21,643 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:51:21,643 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-27 12:51:21,643 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:51:21,643 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:21,643 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:21,643 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:23,174 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-27 12:51:23,175 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,175 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-27 12:51:23,175 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:23,175 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:51:23,176 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-27 12:51:23,176 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:23,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,176 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,648 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-27 12:51:23,648 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:23,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:23,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:23,649 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-27 12:51:23,649 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:51:23,649 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-27 12:51:23,649 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:23,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:23,650 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:51:24,454 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-27 12:51:24,454 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:51:24,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,454 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,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][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-27 12:51:24,454 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:24,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:24,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:24,455 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:24,455 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-27 12:51:24,464 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:51:24,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,464 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:51:24,464 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-27 12:51:24,464 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:24,474 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:24,474 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:24,474 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:51:26,245 INFO  L130       PetriNetUnfolder]: 61911/103015 cut-off events.
[2023-10-27 12:51:26,245 INFO  L131       PetriNetUnfolder]: For 48263/52767 co-relation queries the response was YES.
[2023-10-27 12:51:26,456 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-27 12:51:26,871 INFO  L137   encePairwiseOnDemand]: 297/307 looper letters, 65 selfloop transitions, 16 changer transitions 0/121 dead transitions.
[2023-10-27 12:51:26,871 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 121 transitions, 549 flow
[2023-10-27 12:51:26,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:51:26,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:51:26,872 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions.
[2023-10-27 12:51:26,872 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6199782844733985
[2023-10-27 12:51:26,872 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 571 transitions.
[2023-10-27 12:51:26,872 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 571 transitions.
[2023-10-27 12:51:26,873 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:51:26,873 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 571 transitions.
[2023-10-27 12:51:26,888 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-27 12:51:26,889 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-27 12:51:26,892 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-27 12:51:26,893 INFO  L175             Difference]: Start difference. First operand has 85 places, 89 transitions, 287 flow. Second operand 3 states and 571 transitions.
[2023-10-27 12:51:26,893 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 121 transitions, 549 flow
[2023-10-27 12:51:27,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 509 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:51:27,105 INFO  L231             Difference]: Finished difference. Result has 87 places, 103 transitions, 405 flow
[2023-10-27 12:51:27,105 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-27 12:51:27,105 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 5 predicate places.
[2023-10-27 12:51:27,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 405 flow
[2023-10-27 12:51:27,106 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-27 12:51:27,106 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:51:27,106 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:51:27,107 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-27 12:51:27,107 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-27 12:51:27,107 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:51:27,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -1657692777, now seen corresponding path program 1 times
[2023-10-27 12:51:27,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:51:27,107 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664507128]
[2023-10-27 12:51:27,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:51:27,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:51:27,127 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:51:27,135 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-27 12:51:27,136 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:51:27,136 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664507128]
[2023-10-27 12:51:27,136 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664507128] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:51:27,136 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:51:27,136 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:51:27,136 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871338342]
[2023-10-27 12:51:27,136 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:51:27,137 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:51:27,137 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:51:27,137 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:51:27,137 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:51:27,149 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 176 out of 307
[2023-10-27 12:51:27,149 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-27 12:51:27,149 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:51:27,149 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 307
[2023-10-27 12:51:27,150 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:51:34,015 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-27 12:51:34,015 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,015 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,016 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,023 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-27 12:51:34,023 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,023 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,024 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,024 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:34,398 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-27 12:51:34,398 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,399 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,403 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-27 12:51:34,404 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,404 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,404 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:34,404 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:35,021 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-27 12:51:35,022 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,022 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,022 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,022 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,026 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-27 12:51:35,026 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,027 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,027 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,027 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:35,368 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-27 12:51:35,368 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:51:35,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:35,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:35,369 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:35,905 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-27 12:51:35,905 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,906 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,909 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-27 12:51:35,909 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:35,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:37,730 INFO  L130       PetriNetUnfolder]: 70720/120727 cut-off events.
[2023-10-27 12:51:37,730 INFO  L131       PetriNetUnfolder]: For 84139/95985 co-relation queries the response was YES.
[2023-10-27 12:51:38,040 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-27 12:51:38,751 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 76 selfloop transitions, 5 changer transitions 0/131 dead transitions.
[2023-10-27 12:51:38,751 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 131 transitions, 655 flow
[2023-10-27 12:51:38,752 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:51:38,752 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:51:38,753 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 591 transitions.
[2023-10-27 12:51:38,753 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6416938110749185
[2023-10-27 12:51:38,754 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 591 transitions.
[2023-10-27 12:51:38,754 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 591 transitions.
[2023-10-27 12:51:38,754 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:51:38,754 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 591 transitions.
[2023-10-27 12:51:38,755 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-27 12:51:38,770 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-27 12:51:38,770 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-27 12:51:38,779 INFO  L175             Difference]: Start difference. First operand has 87 places, 103 transitions, 405 flow. Second operand 3 states and 591 transitions.
[2023-10-27 12:51:38,779 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 131 transitions, 655 flow
[2023-10-27 12:51:38,941 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 131 transitions, 623 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:51:38,942 INFO  L231             Difference]: Finished difference. Result has 89 places, 107 transitions, 411 flow
[2023-10-27 12:51:38,942 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-27 12:51:38,943 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 7 predicate places.
[2023-10-27 12:51:38,943 INFO  L495      AbstractCegarLoop]: Abstraction has has 89 places, 107 transitions, 411 flow
[2023-10-27 12:51:38,943 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-27 12:51:38,943 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:51:38,943 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:51:38,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-10-27 12:51:38,944 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-27 12:51:38,944 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:51:38,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -2092777545, now seen corresponding path program 1 times
[2023-10-27 12:51:38,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:51:38,946 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710024446]
[2023-10-27 12:51:38,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:51:38,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:51:38,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:51:39,010 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-27 12:51:39,011 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:51:39,011 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710024446]
[2023-10-27 12:51:39,011 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710024446] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:51:39,011 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:51:39,011 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:51:39,012 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825926010]
[2023-10-27 12:51:39,012 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:51:39,012 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:51:39,013 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:51:39,013 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:51:39,013 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:51:39,026 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-27 12:51:39,027 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-27 12:51:39,027 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:51:39,027 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-27 12:51:39,027 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:51:46,760 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-27 12:51:46,760 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,769 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-27 12:51:46,769 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,769 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:46,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:51:47,212 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-27 12:51:47,212 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,217 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-27 12:51:47,217 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:51:47,882 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-27 12:51:47,882 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,883 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,883 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,883 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,888 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-27 12:51:47,888 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:47,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:51:48,521 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-27 12:51:48,521 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:51:48,521 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:48,521 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:48,521 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:51:48,889 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-27 12:51:48,889 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,890 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,894 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-27 12:51:48,894 INFO  L383   tUnfolder$Statistics]: this new event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,894 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,894 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:48,895 INFO  L386   tUnfolder$Statistics]:   existing Event has 65 ancestors and is cut-off event
[2023-10-27 12:51:51,101 INFO  L130       PetriNetUnfolder]: 80048/137390 cut-off events.
[2023-10-27 12:51:51,101 INFO  L131       PetriNetUnfolder]: For 90837/104282 co-relation queries the response was YES.
[2023-10-27 12:51:51,506 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-27 12:51:52,106 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 85 selfloop transitions, 9 changer transitions 0/146 dead transitions.
[2023-10-27 12:51:52,107 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 146 transitions, 747 flow
[2023-10-27 12:51:52,107 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:51:52,107 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:51:52,108 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 588 transitions.
[2023-10-27 12:51:52,108 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6384364820846905
[2023-10-27 12:51:52,108 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 588 transitions.
[2023-10-27 12:51:52,108 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 588 transitions.
[2023-10-27 12:51:52,109 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:51:52,109 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 588 transitions.
[2023-10-27 12:51:52,110 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-27 12:51:52,111 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-27 12:51:52,120 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-27 12:51:52,121 INFO  L175             Difference]: Start difference. First operand has 89 places, 107 transitions, 411 flow. Second operand 3 states and 588 transitions.
[2023-10-27 12:51:52,121 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 146 transitions, 747 flow
[2023-10-27 12:51:56,357 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 146 transitions, 731 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:51:56,358 INFO  L231             Difference]: Finished difference. Result has 91 places, 114 transitions, 477 flow
[2023-10-27 12:51:56,358 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-27 12:51:56,359 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-27 12:51:56,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 114 transitions, 477 flow
[2023-10-27 12:51:56,359 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-27 12:51:56,359 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:51:56,359 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-27 12:51:56,360 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-27 12:51:56,360 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-27 12:51:56,360 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:51:56,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -694365201, now seen corresponding path program 1 times
[2023-10-27 12:51:56,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:51:56,360 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102405346]
[2023-10-27 12:51:56,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:51:56,361 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:51:56,393 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:51:56,424 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-27 12:51:56,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:51:56,424 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102405346]
[2023-10-27 12:51:56,424 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102405346] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:51:56,424 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:51:56,425 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:51:56,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884813747]
[2023-10-27 12:51:56,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:51:56,425 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:51:56,425 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:51:56,425 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:51:56,426 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:51:56,470 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-27 12:51:56,471 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-27 12:51:56,471 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:51:56,471 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-27 12:51:56,471 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:52:03,950 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-27 12:52:03,950 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-27 12:52:03,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:03,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:03,950 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:04,589 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-27 12:52:04,589 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:52:04,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:04,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:04,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:04,735 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-27 12:52:04,735 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:04,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:04,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:04,735 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:04,736 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-27 12:52:04,736 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 54 ancestors and is cut-off event
[2023-10-27 12:52:04,736 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-27 12:52:04,736 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:04,736 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:05,689 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-27 12:52:05,689 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is not cut-off event
[2023-10-27 12:52:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-27 12:52:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-27 12:52:05,689 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is not cut-off event
[2023-10-27 12:52:05,804 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-27 12:52:05,804 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:05,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:05,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:05,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:05,804 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-27 12:52:05,805 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 55 ancestors and is cut-off event
[2023-10-27 12:52:05,805 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-27 12:52:05,805 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:05,805 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:08,769 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-27 12:52:08,770 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:52:08,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:08,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:08,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:08,770 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-27 12:52:08,770 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:08,770 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:08,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:08,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 56 ancestors and is cut-off event
[2023-10-27 12:52:08,771 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-27 12:52:08,771 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:52:08,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:08,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:08,771 INFO  L386   tUnfolder$Statistics]:   existing Event has 57 ancestors and is cut-off event
[2023-10-27 12:52:10,468 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-27 12:52:10,468 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:10,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,468 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,469 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-27 12:52:10,469 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:10,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:10,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:10,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:10,469 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-27 12:52:10,469 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:10,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,469 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:10,470 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-27 12:52:10,470 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:10,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:10,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:10,470 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:15,491 INFO  L130       PetriNetUnfolder]: 117057/193039 cut-off events.
[2023-10-27 12:52:15,491 INFO  L131       PetriNetUnfolder]: For 158026/169600 co-relation queries the response was YES.
[2023-10-27 12:52:16,017 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-27 12:52:16,859 INFO  L137   encePairwiseOnDemand]: 296/307 looper letters, 95 selfloop transitions, 28 changer transitions 0/164 dead transitions.
[2023-10-27 12:52:16,860 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 164 transitions, 937 flow
[2023-10-27 12:52:16,860 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:52:16,860 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:52:16,861 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 580 transitions.
[2023-10-27 12:52:16,862 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6297502714440825
[2023-10-27 12:52:16,862 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 580 transitions.
[2023-10-27 12:52:16,862 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 580 transitions.
[2023-10-27 12:52:16,863 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:52:16,863 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 580 transitions.
[2023-10-27 12:52:16,864 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-27 12:52:16,865 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-27 12:52:16,865 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-27 12:52:16,865 INFO  L175             Difference]: Start difference. First operand has 91 places, 114 transitions, 477 flow. Second operand 3 states and 580 transitions.
[2023-10-27 12:52:16,865 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 164 transitions, 937 flow
[2023-10-27 12:52:17,578 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 164 transitions, 919 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:52:17,580 INFO  L231             Difference]: Finished difference. Result has 93 places, 138 transitions, 749 flow
[2023-10-27 12:52:17,580 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-27 12:52:17,585 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-27 12:52:17,586 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 138 transitions, 749 flow
[2023-10-27 12:52:17,586 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-27 12:52:17,586 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:52:17,586 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-27 12:52:17,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-27 12:52:17,595 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-27 12:52:17,596 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:52:17,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -1017840435, now seen corresponding path program 1 times
[2023-10-27 12:52:17,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:52:17,597 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151729740]
[2023-10-27 12:52:17,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:52:17,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:52:17,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:52:17,715 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-27 12:52:17,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:52:17,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151729740]
[2023-10-27 12:52:17,715 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151729740] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:52:17,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [428102697]
[2023-10-27 12:52:17,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:52:17,716 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:52:17,716 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:52:17,731 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-27 12:52:17,793 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-27 12:52:17,884 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:52:17,887 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-10-27 12:52:17,888 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:52:17,923 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-27 12:52:17,924 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-27 12:52:17,924 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [428102697] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:52:17,924 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-10-27 12:52:17,924 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6
[2023-10-27 12:52:17,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283481141]
[2023-10-27 12:52:17,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:52:17,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-27 12:52:17,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:52:17,925 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-27 12:52:17,925 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42
[2023-10-27 12:52:17,961 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 307
[2023-10-27 12:52:17,961 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-27 12:52:17,961 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:52:17,961 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 307
[2023-10-27 12:52:17,962 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:52:29,149 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-27 12:52:29,149 INFO  L383   tUnfolder$Statistics]: this new event has 58 ancestors and is cut-off event
[2023-10-27 12:52:29,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:29,149 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:29,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 58 ancestors and is cut-off event
[2023-10-27 12:52:30,591 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-27 12:52:30,591 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,668 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-27 12:52:30,669 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,669 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-27 12:52:30,669 INFO  L383   tUnfolder$Statistics]: this new event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 59 ancestors and is cut-off event
[2023-10-27 12:52:30,671 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-27 12:52:30,671 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:30,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:30,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:30,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,587 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-27 12:52:32,587 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,587 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,670 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-27 12:52:32,670 INFO  L383   tUnfolder$Statistics]: this new event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,670 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 60 ancestors and is cut-off event
[2023-10-27 12:52:32,672 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-27 12:52:32,672 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:32,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:32,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:32,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:33,516 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-27 12:52:33,516 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:33,516 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:33,516 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:33,517 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:34,247 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-27 12:52:34,247 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,247 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,330 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-27 12:52:34,330 INFO  L383   tUnfolder$Statistics]: this new event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:34,332 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-27 12:52:34,332 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:52:34,332 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:34,332 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:34,332 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:34,433 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-27 12:52:34,434 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:34,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:34,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:34,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:34,437 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:35,553 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-27 12:52:35,553 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:35,553 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:35,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:35,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:35,938 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-27 12:52:35,939 INFO  L383   tUnfolder$Statistics]: this new event has 62 ancestors and is cut-off event
[2023-10-27 12:52:35,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:35,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:35,939 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:37,104 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-27 12:52:37,104 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,104 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,105 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,105 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,105 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,708 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-27 12:52:37,708 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,708 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,708 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,709 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,710 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-27 12:52:37,710 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:37,710 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:37,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:37,711 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:37,794 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-27 12:52:37,794 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,794 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,794 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:37,795 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,803 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-27 12:52:38,803 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,803 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,804 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,874 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-27 12:52:38,874 INFO  L383   tUnfolder$Statistics]: this new event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,874 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,874 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:38,874 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:39,298 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-27 12:52:39,298 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,298 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,363 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-27 12:52:39,363 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,363 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,438 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-27 12:52:39,439 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,439 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,439 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:39,439 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:40,459 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-27 12:52:40,459 INFO  L383   tUnfolder$Statistics]: this new event has 64 ancestors and is cut-off event
[2023-10-27 12:52:40,459 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:40,459 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:40,459 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:41,952 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-27 12:52:41,952 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:41,952 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:41,953 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:41,953 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:42,363 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-27 12:52:42,364 INFO  L383   tUnfolder$Statistics]: this new event has 66 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 61 ancestors and is cut-off event
[2023-10-27 12:52:42,364 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-27 12:52:42,364 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:42,364 INFO  L386   tUnfolder$Statistics]:   existing Event has 62 ancestors and is cut-off event
[2023-10-27 12:52:42,365 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-27 12:52:42,365 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:42,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:42,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:42,365 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:43,329 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-27 12:52:43,329 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,329 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,329 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,329 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,806 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-27 12:52:43,806 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,806 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,806 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,806 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,807 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-27 12:52:43,807 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:43,807 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,147 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-27 12:52:48,148 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,148 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,190 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-27 12:52:48,190 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,190 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,192 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-27 12:52:48,192 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 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-27 12:52:48,192 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,192 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,193 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,212 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-27 12:52:48,220 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,221 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,261 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-27 12:52:48,262 INFO  L383   tUnfolder$Statistics]: this new event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,262 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,262 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,262 INFO  L386   tUnfolder$Statistics]:   existing Event has 67 ancestors and is cut-off event
[2023-10-27 12:52:48,536 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-27 12:52:48,536 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-27 12:52:48,536 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:48,536 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:48,536 INFO  L386   tUnfolder$Statistics]:   existing Event has 64 ancestors and is cut-off event
[2023-10-27 12:52:48,536 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-27 12:52:48,536 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,536 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:48,537 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:48,537 INFO  L386   tUnfolder$Statistics]:   existing Event has 63 ancestors and is cut-off event
[2023-10-27 12:52:48,808 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-27 12:52:48,808 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,808 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,809 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,809 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,855 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-27 12:52:48,855 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,977 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-27 12:52:48,977 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,978 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,990 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-27 12:52:48,990 INFO  L383   tUnfolder$Statistics]: this new event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,990 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,991 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:48,991 INFO  L386   tUnfolder$Statistics]:   existing Event has 68 ancestors and is cut-off event
[2023-10-27 12:52:49,036 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-27 12:52:49,037 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,037 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,586 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-27 12:52:49,586 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,586 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,590 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-27 12:52:49,590 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,591 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-27 12:52:49,591 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,626 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-27 12:52:49,626 INFO  L383   tUnfolder$Statistics]: this new event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,626 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,628 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,628 INFO  L386   tUnfolder$Statistics]:   existing Event has 69 ancestors and is cut-off event
[2023-10-27 12:52:49,760 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-27 12:52:49,760 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:49,760 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,253 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-27 12:52:51,253 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,338 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-27 12:52:51,338 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,338 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,338 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,338 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,340 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-27 12:52:51,340 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,340 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,360 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-27 12:52:51,360 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,367 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-27 12:52:51,367 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,368 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,406 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-27 12:52:51,406 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,406 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,456 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-27 12:52:51,457 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 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-27 12:52:51,457 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,457 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,458 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is cut-off event
[2023-10-27 12:52:51,665 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-27 12:52:51,665 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,665 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,666 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,761 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-27 12:52:51,761 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,761 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,762 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,774 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-27 12:52:51,774 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,774 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,779 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-27 12:52:51,779 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,779 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,780 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-27 12:52:51,780 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,780 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,781 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 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-27 12:52:51,796 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,796 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,797 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-27 12:52:51,797 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,797 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,797 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,797 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,830 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-27 12:52:51,830 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,830 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,831 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,832 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-27 12:52:51,832 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,843 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-27 12:52:51,843 INFO  L383   tUnfolder$Statistics]: this new event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,843 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,844 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,844 INFO  L386   tUnfolder$Statistics]:   existing Event has 70 ancestors and is not cut-off event
[2023-10-27 12:52:51,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][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-27 12:52:51,855 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,879 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-27 12:52:51,879 INFO  L383   tUnfolder$Statistics]: this new event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:51,879 INFO  L386   tUnfolder$Statistics]:   existing Event has 71 ancestors and is cut-off event
[2023-10-27 12:52:52,375 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-27 12:52:52,375 INFO  L383   tUnfolder$Statistics]: this new event has 74 ancestors and is cut-off event
[2023-10-27 12:52:52,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-27 12:52:52,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-27 12:52:52,376 INFO  L386   tUnfolder$Statistics]:   existing Event has 74 ancestors and is cut-off event
[2023-10-27 12:52:52,616 INFO  L130       PetriNetUnfolder]: 190525/317152 cut-off events.
[2023-10-27 12:52:52,616 INFO  L131       PetriNetUnfolder]: For 400239/430783 co-relation queries the response was YES.
[2023-10-27 12:52:54,340 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-27 12:52:55,822 INFO  L137   encePairwiseOnDemand]: 298/307 looper letters, 268 selfloop transitions, 19 changer transitions 3/353 dead transitions.
[2023-10-27 12:52:55,822 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 353 transitions, 2513 flow
[2023-10-27 12:52:55,822 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-10-27 12:52:55,822 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-10-27 12:52:55,824 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1363 transitions.
[2023-10-27 12:52:55,824 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6342484876686831
[2023-10-27 12:52:55,825 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1363 transitions.
[2023-10-27 12:52:55,825 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1363 transitions.
[2023-10-27 12:52:55,825 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:52:55,825 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1363 transitions.
[2023-10-27 12:52:55,827 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-27 12:52:55,829 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-27 12:52:55,829 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-27 12:52:55,829 INFO  L175             Difference]: Start difference. First operand has 93 places, 138 transitions, 749 flow. Second operand 7 states and 1363 transitions.
[2023-10-27 12:52:55,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 353 transitions, 2513 flow
[2023-10-27 12:54:14,773 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 353 transitions, 2361 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:54:14,776 INFO  L231             Difference]: Finished difference. Result has 100 places, 158 transitions, 817 flow
[2023-10-27 12:54:14,776 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-27 12:54:14,777 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 18 predicate places.
[2023-10-27 12:54:14,780 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 158 transitions, 817 flow
[2023-10-27 12:54:14,781 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-27 12:54:14,781 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:54:14,781 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-27 12:54:14,787 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-27 12:54:14,985 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-27 12:54:14,986 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-27 12:54:14,986 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:54:14,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -1277540627, now seen corresponding path program 1 times
[2023-10-27 12:54:14,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:54:14,989 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618900219]
[2023-10-27 12:54:14,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:54:14,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:54:15,033 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:54:15,150 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-27 12:54:15,150 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:54:15,150 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618900219]
[2023-10-27 12:54:15,151 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618900219] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:54:15,151 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:54:15,151 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-10-27 12:54:15,152 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812687202]
[2023-10-27 12:54:15,153 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:54:15,154 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-10-27 12:54:15,154 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:54:15,154 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-10-27 12:54:15,154 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-10-27 12:54:15,283 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 165 out of 307
[2023-10-27 12:54:15,284 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-27 12:54:15,284 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:54:15,284 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 307
[2023-10-27 12:54:15,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:54:17,606 INFO  L130       PetriNetUnfolder]: 15706/31175 cut-off events.
[2023-10-27 12:54:17,606 INFO  L131       PetriNetUnfolder]: For 23101/23856 co-relation queries the response was YES.
[2023-10-27 12:54:17,700 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-27 12:54:17,797 INFO  L137   encePairwiseOnDemand]: 294/307 looper letters, 68 selfloop transitions, 13 changer transitions 0/118 dead transitions.
[2023-10-27 12:54:17,797 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 118 transitions, 663 flow
[2023-10-27 12:54:17,798 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:54:17,798 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:54:17,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 725 transitions.
[2023-10-27 12:54:17,799 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5903908794788274
[2023-10-27 12:54:17,799 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 725 transitions.
[2023-10-27 12:54:17,799 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 725 transitions.
[2023-10-27 12:54:17,800 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:54:17,800 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 725 transitions.
[2023-10-27 12:54:17,801 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-27 12:54:17,802 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-27 12:54:17,802 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-27 12:54:17,803 INFO  L175             Difference]: Start difference. First operand has 100 places, 158 transitions, 817 flow. Second operand 4 states and 725 transitions.
[2023-10-27 12:54:17,803 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 118 transitions, 663 flow
[2023-10-27 12:54:18,420 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 118 transitions, 599 flow, removed 28 selfloop flow, removed 5 redundant places.
[2023-10-27 12:54:18,423 INFO  L231             Difference]: Finished difference. Result has 90 places, 93 transitions, 363 flow
[2023-10-27 12:54:18,423 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-27 12:54:18,424 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places.
[2023-10-27 12:54:18,424 INFO  L495      AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 363 flow
[2023-10-27 12:54:18,424 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-27 12:54:18,424 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:54:18,424 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:54:18,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23
[2023-10-27 12:54:18,425 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-27 12:54:18,425 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:54:18,425 INFO  L85        PathProgramCache]: Analyzing trace with hash 928932594, now seen corresponding path program 1 times
[2023-10-27 12:54:18,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:54:18,425 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682400417]
[2023-10-27 12:54:18,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:54:18,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:54:18,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:54:18,490 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-27 12:54:18,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:54:18,490 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682400417]
[2023-10-27 12:54:18,491 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682400417] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:54:18,491 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:54:18,491 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:54:18,491 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459334109]
[2023-10-27 12:54:18,491 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:54:18,491 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:54:18,491 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:54:18,492 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:54:18,492 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:54:18,505 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 307
[2023-10-27 12:54:18,506 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-27 12:54:18,506 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:54:18,506 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 307
[2023-10-27 12:54:18,506 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:54:20,669 INFO  L130       PetriNetUnfolder]: 12340/24716 cut-off events.
[2023-10-27 12:54:20,670 INFO  L131       PetriNetUnfolder]: For 11913/12428 co-relation queries the response was YES.
[2023-10-27 12:54:20,706 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-27 12:54:20,773 INFO  L137   encePairwiseOnDemand]: 301/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-10-27 12:54:20,773 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 129 transitions, 687 flow
[2023-10-27 12:54:20,773 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:54:20,773 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:54:20,774 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 587 transitions.
[2023-10-27 12:54:20,774 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6373507057546145
[2023-10-27 12:54:20,774 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 587 transitions.
[2023-10-27 12:54:20,774 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 587 transitions.
[2023-10-27 12:54:20,775 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:54:20,775 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 587 transitions.
[2023-10-27 12:54:20,776 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-27 12:54:20,776 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-27 12:54:20,777 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-27 12:54:20,777 INFO  L175             Difference]: Start difference. First operand has 90 places, 93 transitions, 363 flow. Second operand 3 states and 587 transitions.
[2023-10-27 12:54:20,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 129 transitions, 687 flow
[2023-10-27 12:54:20,790 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 667 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-27 12:54:20,792 INFO  L231             Difference]: Finished difference. Result has 91 places, 101 transitions, 448 flow
[2023-10-27 12:54:20,792 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-27 12:54:20,792 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 9 predicate places.
[2023-10-27 12:54:20,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 91 places, 101 transitions, 448 flow
[2023-10-27 12:54:20,793 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-27 12:54:20,793 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:54:20,793 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-27 12:54:20,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2023-10-27 12:54:20,793 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-27 12:54:20,793 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:54:20,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -683014751, now seen corresponding path program 1 times
[2023-10-27 12:54:20,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:54:20,794 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415985126]
[2023-10-27 12:54:20,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:54:20,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:54:20,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:54:20,899 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-27 12:54:20,899 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:54:20,899 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415985126]
[2023-10-27 12:54:20,899 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415985126] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:54:20,899 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:54:20,900 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-27 12:54:20,900 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931913001]
[2023-10-27 12:54:20,900 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:54:20,900 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:54:20,901 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:54:20,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:54:20,901 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:54:20,942 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-27 12:54:20,942 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-27 12:54:20,942 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:54:20,942 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-27 12:54:20,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:54:25,445 INFO  L130       PetriNetUnfolder]: 25377/49342 cut-off events.
[2023-10-27 12:54:25,445 INFO  L131       PetriNetUnfolder]: For 44120/46312 co-relation queries the response was YES.
[2023-10-27 12:54:25,567 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-27 12:54:25,721 INFO  L137   encePairwiseOnDemand]: 295/307 looper letters, 101 selfloop transitions, 13 changer transitions 0/155 dead transitions.
[2023-10-27 12:54:25,721 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 155 transitions, 941 flow
[2023-10-27 12:54:25,721 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-27 12:54:25,721 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-27 12:54:25,722 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 583 transitions.
[2023-10-27 12:54:25,722 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6330076004343105
[2023-10-27 12:54:25,723 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 583 transitions.
[2023-10-27 12:54:25,723 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 583 transitions.
[2023-10-27 12:54:25,723 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:54:25,723 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 583 transitions.
[2023-10-27 12:54:25,725 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-27 12:54:25,726 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-27 12:54:25,726 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-27 12:54:25,726 INFO  L175             Difference]: Start difference. First operand has 91 places, 101 transitions, 448 flow. Second operand 3 states and 583 transitions.
[2023-10-27 12:54:25,726 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 155 transitions, 941 flow
[2023-10-27 12:54:25,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 155 transitions, 919 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-27 12:54:25,935 INFO  L231             Difference]: Finished difference. Result has 93 places, 111 transitions, 525 flow
[2023-10-27 12:54:25,935 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-27 12:54:25,936 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places.
[2023-10-27 12:54:25,936 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 111 transitions, 525 flow
[2023-10-27 12:54:25,937 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-27 12:54:25,937 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:54:25,937 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-27 12:54:25,937 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2023-10-27 12:54:25,937 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-27 12:54:25,938 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:54:25,938 INFO  L85        PathProgramCache]: Analyzing trace with hash 74336075, now seen corresponding path program 2 times
[2023-10-27 12:54:25,938 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:54:25,938 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402143769]
[2023-10-27 12:54:25,938 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:54:25,938 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:54:25,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:54:26,094 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-27 12:54:26,095 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:54:26,095 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402143769]
[2023-10-27 12:54:26,095 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402143769] provided 0 perfect and 1 imperfect interpolant sequences
[2023-10-27 12:54:26,095 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915637039]
[2023-10-27 12:54:26,095 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-10-27 12:54:26,095 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:54:26,095 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-27 12:54:26,110 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-27 12:54:26,163 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-27 12:54:26,256 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2023-10-27 12:54:26,257 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-10-27 12:54:26,266 INFO  L263         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 9 conjunts are in the unsatisfiable core
[2023-10-27 12:54:26,270 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-27 12:54:26,367 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-27 12:54:26,395 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2023-10-27 12:54:26,395 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-27 12:54:26,422 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-27 12:54:26,423 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2023-10-27 12:54:26,455 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-27 12:54:26,466 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-27 12:54:26,469 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-27 12:54:26,509 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-27 12:54:26,510 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915637039] provided 0 perfect and 2 imperfect interpolant sequences
[2023-10-27 12:54:26,510 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-10-27 12:54:26,510 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9
[2023-10-27 12:54:26,510 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975398086]
[2023-10-27 12:54:26,510 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-10-27 12:54:26,510 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2023-10-27 12:54:26,511 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:54:26,511 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2023-10-27 12:54:26,511 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=55, Unknown=1, NotChecked=0, Total=90
[2023-10-27 12:54:26,769 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 307
[2023-10-27 12:54:26,770 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-27 12:54:26,770 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:54:26,771 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 307
[2023-10-27 12:54:26,771 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-27 12:54:28,027 INFO  L130       PetriNetUnfolder]: 6946/16038 cut-off events.
[2023-10-27 12:54:28,028 INFO  L131       PetriNetUnfolder]: For 15357/16081 co-relation queries the response was YES.
[2023-10-27 12:54:28,067 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45751 conditions, 16038 events. 6946/16038 cut-off events. For 15357/16081 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 155470 event pairs, 2433 based on Foata normal form. 935/16109 useless extension candidates. Maximal degree in co-relation 23210. Up to 9699 conditions per place. 
[2023-10-27 12:54:28,108 INFO  L137   encePairwiseOnDemand]: 300/307 looper letters, 77 selfloop transitions, 12 changer transitions 0/129 dead transitions.
[2023-10-27 12:54:28,108 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 129 transitions, 740 flow
[2023-10-27 12:54:28,109 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-10-27 12:54:28,109 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-10-27 12:54:28,110 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2023-10-27 12:54:28,110 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6001628664495114
[2023-10-27 12:54:28,110 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2023-10-27 12:54:28,110 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2023-10-27 12:54:28,111 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-27 12:54:28,111 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2023-10-27 12:54:28,112 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 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-27 12:54:28,113 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-27 12:54:28,113 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-27 12:54:28,113 INFO  L175             Difference]: Start difference. First operand has 93 places, 111 transitions, 525 flow. Second operand 4 states and 737 transitions.
[2023-10-27 12:54:28,113 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 129 transitions, 740 flow
[2023-10-27 12:54:28,129 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 723 flow, removed 2 selfloop flow, removed 1 redundant places.
[2023-10-27 12:54:28,131 INFO  L231             Difference]: Finished difference. Result has 95 places, 101 transitions, 454 flow
[2023-10-27 12:54:28,132 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=454, PETRI_PLACES=95, PETRI_TRANSITIONS=101}
[2023-10-27 12:54:28,132 INFO  L288   CegarLoopForPetriNet]: 82 programPoint places, 13 predicate places.
[2023-10-27 12:54:28,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 95 places, 101 transitions, 454 flow
[2023-10-27 12:54:28,133 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  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-27 12:54:28,133 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-27 12:54:28,133 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-27 12:54:28,140 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-10-27 12:54:28,338 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-27 12:54:28,339 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2023-10-27 12:54:28,339 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-27 12:54:28,340 INFO  L85        PathProgramCache]: Analyzing trace with hash 1830676315, now seen corresponding path program 1 times
[2023-10-27 12:54:28,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-27 12:54:28,340 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044777342]
[2023-10-27 12:54:28,340 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-27 12:54:28,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-27 12:54:28,373 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-27 12:54:28,415 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-27 12:54:28,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-27 12:54:28,415 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044777342]
[2023-10-27 12:54:28,415 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044777342] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-27 12:54:28,416 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-27 12:54:28,416 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-27 12:54:28,416 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493885366]
[2023-10-27 12:54:28,416 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-27 12:54:28,416 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-27 12:54:28,416 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-27 12:54:28,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-27 12:54:28,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-27 12:54:28,447 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 169 out of 307
[2023-10-27 12:54:28,447 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 101 transitions, 454 flow. Second operand  has 3 states, 3 states have (on average 174.33333333333334) internal successors, (523), 3 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-27 12:54:28,447 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-27 12:54:28,447 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 307
[2023-10-27 12:54:28,447 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
