./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-binomial.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-binomial.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 8d59f7b3ab30276df996310184a58d579a3078c4527e23fb32e4ae2f7989de00
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-10-25 15:23:41,531 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-10-25 15:23:41,533 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-10-25 15:23:41,582 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-10-25 15:23:41,597 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-10-25 15:23:41,600 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-10-25 15:23:41,601 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-10-25 15:23:41,603 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-10-25 15:23:41,605 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-10-25 15:23:41,608 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-10-25 15:23:41,609 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-10-25 15:23:41,610 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-10-25 15:23:41,611 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-10-25 15:23:41,612 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-10-25 15:23:41,614 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-10-25 15:23:41,615 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-10-25 15:23:41,616 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-10-25 15:23:41,616 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-10-25 15:23:41,617 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-10-25 15:23:41,621 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-10-25 15:23:41,622 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-10-25 15:23:41,623 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-10-25 15:23:41,624 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-10-25 15:23:41,638 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-10-25 15:23:41,644 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-10-25 15:23:41,644 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-10-25 15:23:41,644 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-10-25 15:23:41,649 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-10-25 15:23:41,649 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-10-25 15:23:41,650 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-10-25 15:23:41,650 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-10-25 15:23:41,652 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-10-25 15:23:41,653 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-10-25 15:23:41,654 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-10-25 15:23:41,654 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-10-25 15:23:41,654 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-10-25 15:23:41,655 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-10-25 15:23:41,655 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-10-25 15:23:41,655 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-10-25 15:23:41,656 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-10-25 15:23:41,657 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-10-25 15:23:41,657 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-10-25 15:23:41,717 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-10-25 15:23:41,718 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-10-25 15:23:41,718 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-10-25 15:23:41,718 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-10-25 15:23:41,719 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-10-25 15:23:41,719 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-10-25 15:23:41,720 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-10-25 15:23:41,720 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-10-25 15:23:41,720 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-10-25 15:23:41,720 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-10-25 15:23:41,721 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-10-25 15:23:41,721 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-10-25 15:23:41,721 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-10-25 15:23:41,722 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-10-25 15:23:41,723 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-10-25 15:23:41,723 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-10-25 15:23:41,723 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-10-25 15:23:41,723 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-10-25 15:23:41,723 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-10-25 15:23:41,723 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-10-25 15:23:41,724 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-10-25 15:23:41,724 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:23:41,724 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-10-25 15:23:41,724 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-10-25 15:23:41,724 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-10-25 15:23:41,724 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-10-25 15:23:41,725 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-10-25 15:23:41,725 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-10-25 15:23:41,725 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-10-25 15:23:41,726 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-10-25 15:23:41,726 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-10-25 15:23:41,726 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-10-25 15:23:41,726 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 -> 8d59f7b3ab30276df996310184a58d579a3078c4527e23fb32e4ae2f7989de00
[2023-10-25 15:23:42,117 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-10-25 15:23:42,144 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-10-25 15:23:42,146 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-10-25 15:23:42,150 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-10-25 15:23:42,150 INFO  L275        PluginConnector]: CDTParser initialized
[2023-10-25 15:23:42,152 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial.i
[2023-10-25 15:23:43,895 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-10-25 15:23:44,313 INFO  L351              CDTParser]: Found 1 translation units.
[2023-10-25 15:23:44,314 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial.i
[2023-10-25 15:23:44,339 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/06fef57f6/446dcaab0a834c13ad60669f186e1410/FLAGfa1b5cbb9
[2023-10-25 15:23:44,365 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/06fef57f6/446dcaab0a834c13ad60669f186e1410
[2023-10-25 15:23:44,368 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-10-25 15:23:44,369 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-10-25 15:23:44,371 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-10-25 15:23:44,372 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-10-25 15:23:44,381 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-10-25 15:23:44,382 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:23:44" (1/1) ...
[2023-10-25 15:23:44,384 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@274bae7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:44, skipping insertion in model container
[2023-10-25 15:23:44,388 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 03:23:44" (1/1) ...
[2023-10-25 15:23:44,394 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-10-25 15:23:44,474 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-10-25 15:23:44,744 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:23:45,142 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:23:45,173 INFO  L203         MainTranslator]: Completed pre-run
[2023-10-25 15:23:45,210 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-10-25 15:23:45,254 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-10-25 15:23:45,358 INFO  L208         MainTranslator]: Completed translation
[2023-10-25 15:23:45,373 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45 WrapperNode
[2023-10-25 15:23:45,374 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-10-25 15:23:45,375 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-10-25 15:23:45,375 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-10-25 15:23:45,375 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-10-25 15:23:45,381 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,404 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,449 INFO  L138                Inliner]: procedures = 268, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92
[2023-10-25 15:23:45,464 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-10-25 15:23:45,465 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-10-25 15:23:45,465 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-10-25 15:23:45,465 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-10-25 15:23:45,478 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,478 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,497 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,497 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,505 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,531 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,537 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,538 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,543 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-10-25 15:23:45,557 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-10-25 15:23:45,557 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-10-25 15:23:45,557 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-10-25 15:23:45,558 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (1/1) ...
[2023-10-25 15:23:45,563 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-10-25 15:23:45,581 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:23:45,595 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-10-25 15:23:45,623 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-10-25 15:23:45,631 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-10-25 15:23:45,631 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-10-25 15:23:45,631 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-10-25 15:23:45,635 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-10-25 15:23:45,636 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-10-25 15:23:45,637 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-10-25 15:23:45,637 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-10-25 15:23:45,637 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-10-25 15:23:45,638 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-10-25 15:23:45,845 INFO  L235             CfgBuilder]: Building ICFG
[2023-10-25 15:23:45,847 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-10-25 15:23:46,435 INFO  L276             CfgBuilder]: Performing block encoding
[2023-10-25 15:23:46,442 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-10-25 15:23:46,455 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-10-25 15:23:46,458 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:23:46 BoogieIcfgContainer
[2023-10-25 15:23:46,458 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-10-25 15:23:46,459 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-10-25 15:23:46,459 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-10-25 15:23:46,462 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-10-25 15:23:46,462 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 03:23:44" (1/3) ...
[2023-10-25 15:23:46,463 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dbbaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:23:46, skipping insertion in model container
[2023-10-25 15:23:46,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 03:23:45" (2/3) ...
[2023-10-25 15:23:46,463 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8dbbaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 03:23:46, skipping insertion in model container
[2023-10-25 15:23:46,463 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 03:23:46" (3/3) ...
[2023-10-25 15:23:46,464 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-binomial.i
[2023-10-25 15:23:46,485 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-10-25 15:23:46,498 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-10-25 15:23:46,498 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations.
[2023-10-25 15:23:46,499 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-10-25 15:23:46,677 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-10-25 15:23:46,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 185 places, 191 transitions, 396 flow
[2023-10-25 15:23:46,851 INFO  L130       PetriNetUnfolder]: 6/179 cut-off events.
[2023-10-25 15:23:46,852 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:23:46,857 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 185 conditions, 179 events. 6/179 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 192 event pairs, 0 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. 
[2023-10-25 15:23:46,865 INFO  L82        GeneralOperation]: Start removeDead. Operand has 185 places, 191 transitions, 396 flow
[2023-10-25 15:23:46,893 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2023-10-25 15:23:46,896 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:23:46,922 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-25 15:23:46,930 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2023-10-25 15:23:46,933 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-10-25 15:23:47,009 INFO  L130       PetriNetUnfolder]: 6/174 cut-off events.
[2023-10-25 15:23:47,010 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:23:47,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 180 conditions, 174 events. 6/174 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 191 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 84. Up to 4 conditions per place. 
[2023-10-25 15:23:47,029 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2788
[2023-10-25 15:23:56,023 INFO  L134        LiptonReduction]: Checked pairs total: 13927
[2023-10-25 15:23:56,024 INFO  L136        LiptonReduction]: Total number of compositions: 146
[2023-10-25 15:23:56,061 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:23:56,085 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;@1502e3d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:23:56,085 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 19 error locations.
[2023-10-25 15:23:56,088 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 15:23:56,088 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:23:56,089 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:56,089 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 15:23:56,090 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2023-10-25 15:23:56,094 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:56,094 INFO  L85        PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times
[2023-10-25 15:23:56,101 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:56,110 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534531242]
[2023-10-25 15:23:56,110 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:56,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:56,248 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:56,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:56,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:56,302 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534531242]
[2023-10-25 15:23:56,303 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534531242] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:56,303 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:56,303 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 15:23:56,304 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244583481]
[2023-10-25 15:23:56,305 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:56,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:23:56,335 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:56,371 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:23:56,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:23:56,382 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 337
[2023-10-25 15:23:56,392 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 104 flow. Second operand  has 2 states, 2 states have (on average 181.5) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:56,392 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:56,392 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 337
[2023-10-25 15:23:56,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:56,501 INFO  L130       PetriNetUnfolder]: 8/126 cut-off events.
[2023-10-25 15:23:56,501 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2023-10-25 15:23:56,502 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 161 conditions, 126 events. 8/126 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 496 event pairs, 8 based on Foata normal form. 1/102 useless extension candidates. Maximal degree in co-relation 125. Up to 29 conditions per place. 
[2023-10-25 15:23:56,504 INFO  L137   encePairwiseOnDemand]: 328/337 looper letters, 8 selfloop transitions, 0 changer transitions 1/39 dead transitions.
[2023-10-25 15:23:56,511 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 104 flow
[2023-10-25 15:23:56,512 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:23:56,514 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:23:56,539 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 380 transitions.
[2023-10-25 15:23:56,543 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637982195845698
[2023-10-25 15:23:56,544 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 380 transitions.
[2023-10-25 15:23:56,545 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 380 transitions.
[2023-10-25 15:23:56,553 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:56,555 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 380 transitions.
[2023-10-25 15:23:56,562 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 190.0) internal successors, (380), 2 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:56,572 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:56,572 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 337.0) internal successors, (1011), 3 states have internal predecessors, (1011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:56,586 INFO  L175             Difference]: Start difference. First operand has 51 places, 48 transitions, 104 flow. Second operand 2 states and 380 transitions.
[2023-10-25 15:23:56,587 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 104 flow
[2023-10-25 15:23:56,590 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:23:56,591 INFO  L231             Difference]: Finished difference. Result has 43 places, 38 transitions, 81 flow
[2023-10-25 15:23:56,593 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=81, PETRI_PLACES=43, PETRI_TRANSITIONS=38}
[2023-10-25 15:23:56,596 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places.
[2023-10-25 15:23:56,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 81 flow
[2023-10-25 15:23:56,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 181.5) internal successors, (363), 2 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:56,597 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:56,598 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:56,598 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-10-25 15:23:56,599 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2023-10-25 15:23:56,601 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:56,601 INFO  L85        PathProgramCache]: Analyzing trace with hash -350454187, now seen corresponding path program 1 times
[2023-10-25 15:23:56,602 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:56,602 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317107533]
[2023-10-25 15:23:56,602 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:56,602 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:56,715 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:57,301 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:57,302 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:57,305 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317107533]
[2023-10-25 15:23:57,305 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317107533] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:57,305 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:57,305 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:23:57,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132969618]
[2023-10-25 15:23:57,306 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:57,313 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:23:57,314 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:57,314 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:23:57,315 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:23:57,794 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 337
[2023-10-25 15:23:57,795 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 38 transitions, 81 flow. Second operand  has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:57,795 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:57,795 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 337
[2023-10-25 15:23:57,795 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:57,922 INFO  L130       PetriNetUnfolder]: 77/323 cut-off events.
[2023-10-25 15:23:57,937 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-10-25 15:23:57,940 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 519 conditions, 323 events. 77/323 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1682 event pairs, 77 based on Foata normal form. 0/283 useless extension candidates. Maximal degree in co-relation 515. Up to 177 conditions per place. 
[2023-10-25 15:23:57,942 INFO  L137   encePairwiseOnDemand]: 326/337 looper letters, 20 selfloop transitions, 8 changer transitions 0/43 dead transitions.
[2023-10-25 15:23:57,942 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 147 flow
[2023-10-25 15:23:57,943 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:23:57,943 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:23:57,945 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 901 transitions.
[2023-10-25 15:23:57,946 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4455984174085064
[2023-10-25 15:23:57,946 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 901 transitions.
[2023-10-25 15:23:57,946 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 901 transitions.
[2023-10-25 15:23:57,946 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:57,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 901 transitions.
[2023-10-25 15:23:57,948 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 150.16666666666666) internal successors, (901), 6 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:57,953 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:57,966 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:57,966 INFO  L175             Difference]: Start difference. First operand has 43 places, 38 transitions, 81 flow. Second operand 6 states and 901 transitions.
[2023-10-25 15:23:57,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 147 flow
[2023-10-25 15:23:57,967 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:23:57,968 INFO  L231             Difference]: Finished difference. Result has 48 places, 43 transitions, 137 flow
[2023-10-25 15:23:57,969 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=48, PETRI_TRANSITIONS=43}
[2023-10-25 15:23:57,969 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places.
[2023-10-25 15:23:57,969 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 137 flow
[2023-10-25 15:23:57,970 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 146.0) internal successors, (876), 6 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:57,970 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:57,970 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:23:57,970 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-10-25 15:23:57,971 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2023-10-25 15:23:57,971 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:57,971 INFO  L85        PathProgramCache]: Analyzing trace with hash 905724532, now seen corresponding path program 1 times
[2023-10-25 15:23:57,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:57,972 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95388325]
[2023-10-25 15:23:57,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:57,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:58,021 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:23:58,443 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:23:58,444 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:23:58,444 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95388325]
[2023-10-25 15:23:58,445 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95388325] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:23:58,445 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:23:58,445 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:23:58,446 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283691371]
[2023-10-25 15:23:58,446 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:23:58,447 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:23:58,447 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:23:58,448 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:23:58,448 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:23:58,945 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 337
[2023-10-25 15:23:58,946 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 137 flow. Second operand  has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:58,946 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:23:58,946 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 337
[2023-10-25 15:23:58,947 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:23:59,138 INFO  L130       PetriNetUnfolder]: 18/116 cut-off events.
[2023-10-25 15:23:59,138 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-10-25 15:23:59,139 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 226 conditions, 116 events. 18/116 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 417 event pairs, 8 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 218. Up to 28 conditions per place. 
[2023-10-25 15:23:59,139 INFO  L137   encePairwiseOnDemand]: 332/337 looper letters, 14 selfloop transitions, 4 changer transitions 8/50 dead transitions.
[2023-10-25 15:23:59,139 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 197 flow
[2023-10-25 15:23:59,141 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:23:59,142 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:23:59,143 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1030 transitions.
[2023-10-25 15:23:59,143 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5093966369930761
[2023-10-25 15:23:59,144 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1030 transitions.
[2023-10-25 15:23:59,144 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1030 transitions.
[2023-10-25 15:23:59,144 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:23:59,144 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1030 transitions.
[2023-10-25 15:23:59,146 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 171.66666666666666) internal successors, (1030), 6 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:59,149 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:59,149 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 337.0) internal successors, (2359), 7 states have internal predecessors, (2359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:59,150 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 137 flow. Second operand 6 states and 1030 transitions.
[2023-10-25 15:23:59,150 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 197 flow
[2023-10-25 15:23:59,152 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:23:59,153 INFO  L231             Difference]: Finished difference. Result has 52 places, 38 transitions, 120 flow
[2023-10-25 15:23:59,153 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=337, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=38}
[2023-10-25 15:23:59,154 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places.
[2023-10-25 15:23:59,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 120 flow
[2023-10-25 15:23:59,158 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 169.33333333333334) internal successors, (1016), 6 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:23:59,158 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:23:59,158 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:23:59,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-10-25 15:23:59,158 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 16 more)] ===
[2023-10-25 15:23:59,159 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:23:59,159 INFO  L85        PathProgramCache]: Analyzing trace with hash 1477162438, now seen corresponding path program 1 times
[2023-10-25 15:23:59,159 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:23:59,160 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637728281]
[2023-10-25 15:23:59,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:23:59,160 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:23:59,223 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:23:59,223 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:23:59,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:23:59,290 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:23:59,291 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:23:59,292 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining)
[2023-10-25 15:23:59,293 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining)
[2023-10-25 15:23:59,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining)
[2023-10-25 15:23:59,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining)
[2023-10-25 15:23:59,294 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining)
[2023-10-25 15:23:59,295 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining)
[2023-10-25 15:23:59,295 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining)
[2023-10-25 15:23:59,295 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining)
[2023-10-25 15:23:59,295 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining)
[2023-10-25 15:23:59,309 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining)
[2023-10-25 15:23:59,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining)
[2023-10-25 15:23:59,310 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining)
[2023-10-25 15:23:59,313 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining)
[2023-10-25 15:23:59,313 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining)
[2023-10-25 15:23:59,313 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining)
[2023-10-25 15:23:59,313 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining)
[2023-10-25 15:23:59,313 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining)
[2023-10-25 15:23:59,314 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining)
[2023-10-25 15:23:59,314 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining)
[2023-10-25 15:23:59,314 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-10-25 15:23:59,314 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-10-25 15:23:59,317 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:23:59,318 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-10-25 15:23:59,389 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2023-10-25 15:23:59,396 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 231 places, 243 transitions, 522 flow
[2023-10-25 15:23:59,538 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2023-10-25 15:23:59,538 INFO  L131       PetriNetUnfolder]: For 20/22 co-relation queries the response was YES.
[2023-10-25 15:23:59,540 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 627 conditions, 593 events. 34/593 cut-off events. For 20/22 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2088 event pairs, 0 based on Foata normal form. 2/499 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. 
[2023-10-25 15:23:59,546 INFO  L82        GeneralOperation]: Start removeDead. Operand has 231 places, 243 transitions, 522 flow
[2023-10-25 15:23:59,549 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 201 places, 207 transitions, 438 flow
[2023-10-25 15:23:59,549 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:23:59,549 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 207 transitions, 438 flow
[2023-10-25 15:23:59,550 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 207 transitions, 438 flow
[2023-10-25 15:23:59,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 201 places, 207 transitions, 438 flow
[2023-10-25 15:23:59,674 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2023-10-25 15:23:59,674 INFO  L131       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2023-10-25 15:23:59,687 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 627 conditions, 593 events. 34/593 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2086 event pairs, 0 based on Foata normal form. 0/497 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. 
[2023-10-25 15:23:59,698 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14222
[2023-10-25 15:24:05,531 INFO  L134        LiptonReduction]: Checked pairs total: 90933
[2023-10-25 15:24:05,532 INFO  L136        LiptonReduction]: Total number of compositions: 148
[2023-10-25 15:24:05,533 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:24:05,534 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;@1502e3d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:24:05,534 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 23 error locations.
[2023-10-25 15:24:05,534 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 15:24:05,535 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:24:05,535 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:05,535 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 15:24:05,535 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:05,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:05,535 INFO  L85        PathProgramCache]: Analyzing trace with hash 968, now seen corresponding path program 1 times
[2023-10-25 15:24:05,535 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:05,535 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795481793]
[2023-10-25 15:24:05,535 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:05,535 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:05,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:05,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:05,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:05,557 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795481793]
[2023-10-25 15:24:05,557 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795481793] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:05,557 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:05,558 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 15:24:05,558 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720816365]
[2023-10-25 15:24:05,558 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:05,558 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:24:05,558 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:05,559 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:24:05,559 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:24:05,560 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 391
[2023-10-25 15:24:05,574 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 218 flow. Second operand  has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:05,574 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:05,574 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 391
[2023-10-25 15:24:05,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:06,219 INFO  L130       PetriNetUnfolder]: 980/2946 cut-off events.
[2023-10-25 15:24:06,220 INFO  L131       PetriNetUnfolder]: For 154/202 co-relation queries the response was YES.
[2023-10-25 15:24:06,229 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4637 conditions, 2946 events. 980/2946 cut-off events. For 154/202 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 21467 event pairs, 758 based on Foata normal form. 0/2461 useless extension candidates. Maximal degree in co-relation 3594. Up to 1610 conditions per place. 
[2023-10-25 15:24:06,255 INFO  L137   encePairwiseOnDemand]: 386/391 looper letters, 34 selfloop transitions, 0 changer transitions 0/92 dead transitions.
[2023-10-25 15:24:06,255 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 276 flow
[2023-10-25 15:24:06,256 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:24:06,256 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:24:06,256 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 489 transitions.
[2023-10-25 15:24:06,257 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6253196930946292
[2023-10-25 15:24:06,257 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 489 transitions.
[2023-10-25 15:24:06,257 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 489 transitions.
[2023-10-25 15:24:06,257 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:06,257 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 489 transitions.
[2023-10-25 15:24:06,258 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 244.5) internal successors, (489), 2 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:06,260 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:06,260 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 391.0) internal successors, (1173), 3 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:06,260 INFO  L175             Difference]: Start difference. First operand has 97 places, 97 transitions, 218 flow. Second operand 2 states and 489 transitions.
[2023-10-25 15:24:06,260 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 276 flow
[2023-10-25 15:24:06,263 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:06,264 INFO  L231             Difference]: Finished difference. Result has 93 places, 92 transitions, 208 flow
[2023-10-25 15:24:06,264 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=208, PETRI_PLACES=93, PETRI_TRANSITIONS=92}
[2023-10-25 15:24:06,266 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places.
[2023-10-25 15:24:06,266 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 208 flow
[2023-10-25 15:24:06,267 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 225.5) internal successors, (451), 2 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:06,267 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:06,267 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:06,267 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-10-25 15:24:06,267 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:06,267 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:06,268 INFO  L85        PathProgramCache]: Analyzing trace with hash -1080939081, now seen corresponding path program 1 times
[2023-10-25 15:24:06,269 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:06,270 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563446090]
[2023-10-25 15:24:06,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:06,270 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:06,286 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:06,548 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:06,549 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:06,550 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563446090]
[2023-10-25 15:24:06,551 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563446090] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:06,551 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:06,551 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:24:06,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901566108]
[2023-10-25 15:24:06,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:06,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:24:06,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:06,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:24:06,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:24:07,071 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 183 out of 391
[2023-10-25 15:24:07,073 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 92 transitions, 208 flow. Second operand  has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:07,073 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:07,073 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 391
[2023-10-25 15:24:07,073 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:08,974 INFO  L130       PetriNetUnfolder]: 5355/11139 cut-off events.
[2023-10-25 15:24:08,974 INFO  L131       PetriNetUnfolder]: For 286/364 co-relation queries the response was YES.
[2023-10-25 15:24:08,984 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19721 conditions, 11139 events. 5355/11139 cut-off events. For 286/364 co-relation queries the response was YES. Maximal size of possible extension queue 270. Compared 83369 event pairs, 4603 based on Foata normal form. 0/9978 useless extension candidates. Maximal degree in co-relation 19716. Up to 8415 conditions per place. 
[2023-10-25 15:24:09,071 INFO  L137   encePairwiseOnDemand]: 378/391 looper letters, 54 selfloop transitions, 8 changer transitions 0/95 dead transitions.
[2023-10-25 15:24:09,071 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 338 flow
[2023-10-25 15:24:09,072 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:24:09,072 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:24:09,073 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions.
[2023-10-25 15:24:09,074 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49658994032395565
[2023-10-25 15:24:09,074 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions.
[2023-10-25 15:24:09,074 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions.
[2023-10-25 15:24:09,075 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:09,089 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions.
[2023-10-25 15:24:09,091 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 194.16666666666666) internal successors, (1165), 6 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:09,094 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:09,095 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:09,095 INFO  L175             Difference]: Start difference. First operand has 93 places, 92 transitions, 208 flow. Second operand 6 states and 1165 transitions.
[2023-10-25 15:24:09,095 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 338 flow
[2023-10-25 15:24:09,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:09,099 INFO  L231             Difference]: Finished difference. Result has 97 places, 95 transitions, 260 flow
[2023-10-25 15:24:09,100 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=97, PETRI_TRANSITIONS=95}
[2023-10-25 15:24:09,103 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places.
[2023-10-25 15:24:09,103 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 260 flow
[2023-10-25 15:24:09,104 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 184.0) internal successors, (1104), 6 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:09,104 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:09,104 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:09,104 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-10-25 15:24:09,104 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:09,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:09,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 597553700, now seen corresponding path program 1 times
[2023-10-25 15:24:09,105 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:09,106 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596157816]
[2023-10-25 15:24:09,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:09,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:09,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:09,512 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:09,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:09,514 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596157816]
[2023-10-25 15:24:09,514 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596157816] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:09,515 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:09,515 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:24:09,515 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822990176]
[2023-10-25 15:24:09,515 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:09,515 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:24:09,515 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:09,516 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:24:09,516 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:24:10,297 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 391
[2023-10-25 15:24:10,298 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 95 transitions, 260 flow. Second operand  has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:10,298 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:10,299 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 391
[2023-10-25 15:24:10,299 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:11,374 INFO  L130       PetriNetUnfolder]: 1969/4372 cut-off events.
[2023-10-25 15:24:11,383 INFO  L131       PetriNetUnfolder]: For 309/396 co-relation queries the response was YES.
[2023-10-25 15:24:11,388 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7919 conditions, 4372 events. 1969/4372 cut-off events. For 309/396 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 29711 event pairs, 758 based on Foata normal form. 0/3858 useless extension candidates. Maximal degree in co-relation 7910. Up to 1609 conditions per place. 
[2023-10-25 15:24:11,416 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 120 selfloop transitions, 5 changer transitions 4/178 dead transitions.
[2023-10-25 15:24:11,416 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 178 transitions, 702 flow
[2023-10-25 15:24:11,416 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:24:11,417 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:24:11,421 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1397 transitions.
[2023-10-25 15:24:11,435 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5954816709292413
[2023-10-25 15:24:11,435 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1397 transitions.
[2023-10-25 15:24:11,435 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1397 transitions.
[2023-10-25 15:24:11,438 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:11,438 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1397 transitions.
[2023-10-25 15:24:11,441 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 232.83333333333334) internal successors, (1397), 6 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:11,445 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:11,445 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 391.0) internal successors, (2737), 7 states have internal predecessors, (2737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:11,445 INFO  L175             Difference]: Start difference. First operand has 97 places, 95 transitions, 260 flow. Second operand 6 states and 1397 transitions.
[2023-10-25 15:24:11,446 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 178 transitions, 702 flow
[2023-10-25 15:24:11,450 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 178 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:11,451 INFO  L231             Difference]: Finished difference. Result has 101 places, 90 transitions, 245 flow
[2023-10-25 15:24:11,465 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=101, PETRI_TRANSITIONS=90}
[2023-10-25 15:24:11,467 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-10-25 15:24:11,467 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 90 transitions, 245 flow
[2023-10-25 15:24:11,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:11,467 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:11,467 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:11,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-10-25 15:24:11,468 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:11,468 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:11,468 INFO  L85        PathProgramCache]: Analyzing trace with hash 419820616, now seen corresponding path program 1 times
[2023-10-25 15:24:11,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:11,469 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932532366]
[2023-10-25 15:24:11,469 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:11,469 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:11,479 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:11,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:11,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:11,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932532366]
[2023-10-25 15:24:11,518 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932532366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:11,518 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:11,518 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:24:11,518 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692332540]
[2023-10-25 15:24:11,518 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:11,519 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:24:11,519 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:11,519 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:24:11,519 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:24:11,545 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 391
[2023-10-25 15:24:11,545 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 90 transitions, 245 flow. Second operand  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:11,546 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:11,546 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 391
[2023-10-25 15:24:11,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:12,121 INFO  L130       PetriNetUnfolder]: 1257/3440 cut-off events.
[2023-10-25 15:24:12,122 INFO  L131       PetriNetUnfolder]: For 324/391 co-relation queries the response was YES.
[2023-10-25 15:24:12,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6012 conditions, 3440 events. 1257/3440 cut-off events. For 324/391 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 25152 event pairs, 769 based on Foata normal form. 0/2918 useless extension candidates. Maximal degree in co-relation 6002. Up to 1707 conditions per place. 
[2023-10-25 15:24:12,161 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 54 selfloop transitions, 5 changer transitions 0/112 dead transitions.
[2023-10-25 15:24:12,161 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 419 flow
[2023-10-25 15:24:12,162 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:24:12,162 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:24:12,163 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions.
[2023-10-25 15:24:12,164 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6078431372549019
[2023-10-25 15:24:12,164 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 713 transitions.
[2023-10-25 15:24:12,164 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 713 transitions.
[2023-10-25 15:24:12,164 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:12,164 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 713 transitions.
[2023-10-25 15:24:12,165 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 237.66666666666666) internal successors, (713), 3 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:12,167 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:12,167 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:12,167 INFO  L175             Difference]: Start difference. First operand has 101 places, 90 transitions, 245 flow. Second operand 3 states and 713 transitions.
[2023-10-25 15:24:12,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 419 flow
[2023-10-25 15:24:12,170 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 112 transitions, 403 flow, removed 3 selfloop flow, removed 5 redundant places.
[2023-10-25 15:24:12,173 INFO  L231             Difference]: Finished difference. Result has 100 places, 94 transitions, 267 flow
[2023-10-25 15:24:12,174 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=267, PETRI_PLACES=100, PETRI_TRANSITIONS=94}
[2023-10-25 15:24:12,175 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places.
[2023-10-25 15:24:12,175 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 267 flow
[2023-10-25 15:24:12,175 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:12,175 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:12,175 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:12,175 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-10-25 15:24:12,186 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:12,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:12,187 INFO  L85        PathProgramCache]: Analyzing trace with hash -63257529, now seen corresponding path program 1 times
[2023-10-25 15:24:12,187 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:12,187 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818940060]
[2023-10-25 15:24:12,187 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:12,187 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:12,200 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-10-25 15:24:12,213 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [248135061]
[2023-10-25 15:24:12,213 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:12,225 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:24:12,225 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:24:12,241 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:24:12,286 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-10-25 15:24:12,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:12,443 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-10-25 15:24:12,455 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:24:12,468 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:12,469 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:24:12,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:12,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818940060]
[2023-10-25 15:24:12,469 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-10-25 15:24:12,469 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248135061]
[2023-10-25 15:24:12,469 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [248135061] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:12,470 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:12,470 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:24:12,470 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008089939]
[2023-10-25 15:24:12,470 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:12,471 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:24:12,471 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:12,471 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:24:12,471 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:24:12,532 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 206 out of 391
[2023-10-25 15:24:12,533 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 267 flow. Second operand  has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:12,533 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:12,533 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 391
[2023-10-25 15:24:12,533 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:13,264 INFO  L130       PetriNetUnfolder]: 1323/3542 cut-off events.
[2023-10-25 15:24:13,264 INFO  L131       PetriNetUnfolder]: For 731/898 co-relation queries the response was YES.
[2023-10-25 15:24:13,278 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6568 conditions, 3542 events. 1323/3542 cut-off events. For 731/898 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 25643 event pairs, 987 based on Foata normal form. 55/3039 useless extension candidates. Maximal degree in co-relation 6557. Up to 2152 conditions per place. 
[2023-10-25 15:24:13,285 INFO  L137   encePairwiseOnDemand]: 388/391 looper letters, 40 selfloop transitions, 1 changer transitions 0/92 dead transitions.
[2023-10-25 15:24:13,285 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 345 flow
[2023-10-25 15:24:13,285 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:24:13,285 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:24:13,287 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions.
[2023-10-25 15:24:13,287 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5592497868712702
[2023-10-25 15:24:13,287 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 656 transitions.
[2023-10-25 15:24:13,287 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions.
[2023-10-25 15:24:13,288 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:13,288 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions.
[2023-10-25 15:24:13,289 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:13,303 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:13,303 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:13,304 INFO  L175             Difference]: Start difference. First operand has 100 places, 94 transitions, 267 flow. Second operand 3 states and 656 transitions.
[2023-10-25 15:24:13,304 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 345 flow
[2023-10-25 15:24:13,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-10-25 15:24:13,308 INFO  L231             Difference]: Finished difference. Result has 98 places, 92 transitions, 255 flow
[2023-10-25 15:24:13,308 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=98, PETRI_TRANSITIONS=92}
[2023-10-25 15:24:13,309 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places.
[2023-10-25 15:24:13,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 255 flow
[2023-10-25 15:24:13,310 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:13,310 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:13,310 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:13,330 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2023-10-25 15:24:13,515 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:24:13,516 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:13,516 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:13,516 INFO  L85        PathProgramCache]: Analyzing trace with hash -903058524, now seen corresponding path program 1 times
[2023-10-25 15:24:13,517 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:13,517 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674045695]
[2023-10-25 15:24:13,517 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:13,517 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:13,550 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:13,565 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:24:13,566 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:13,566 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674045695]
[2023-10-25 15:24:13,566 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674045695] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:13,566 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:13,566 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:24:13,566 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766613055]
[2023-10-25 15:24:13,566 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:13,567 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:24:13,567 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:13,568 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:24:13,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:24:13,589 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 391
[2023-10-25 15:24:13,590 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 255 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:13,590 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:13,590 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 391
[2023-10-25 15:24:13,590 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:14,110 INFO  L130       PetriNetUnfolder]: 1367/3769 cut-off events.
[2023-10-25 15:24:14,111 INFO  L131       PetriNetUnfolder]: For 541/642 co-relation queries the response was YES.
[2023-10-25 15:24:14,115 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6800 conditions, 3769 events. 1367/3769 cut-off events. For 541/642 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 28435 event pairs, 804 based on Foata normal form. 6/3293 useless extension candidates. Maximal degree in co-relation 6789. Up to 1870 conditions per place. 
[2023-10-25 15:24:14,146 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 58 selfloop transitions, 6 changer transitions 0/115 dead transitions.
[2023-10-25 15:24:14,146 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 448 flow
[2023-10-25 15:24:14,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:24:14,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:24:14,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions.
[2023-10-25 15:24:14,149 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6069906223358909
[2023-10-25 15:24:14,149 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 712 transitions.
[2023-10-25 15:24:14,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions.
[2023-10-25 15:24:14,149 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:14,149 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions.
[2023-10-25 15:24:14,150 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,166 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,167 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,167 INFO  L175             Difference]: Start difference. First operand has 98 places, 92 transitions, 255 flow. Second operand 3 states and 712 transitions.
[2023-10-25 15:24:14,167 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 448 flow
[2023-10-25 15:24:14,179 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 115 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:24:14,181 INFO  L231             Difference]: Finished difference. Result has 101 places, 96 transitions, 300 flow
[2023-10-25 15:24:14,181 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=101, PETRI_TRANSITIONS=96}
[2023-10-25 15:24:14,182 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-10-25 15:24:14,182 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 300 flow
[2023-10-25 15:24:14,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,182 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:14,183 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:14,183 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-10-25 15:24:14,183 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:14,183 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:14,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -284586499, now seen corresponding path program 1 times
[2023-10-25 15:24:14,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:14,183 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65398138]
[2023-10-25 15:24:14,184 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:14,184 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:14,208 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:14,316 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:14,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:14,317 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65398138]
[2023-10-25 15:24:14,318 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65398138] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:14,318 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:14,318 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:24:14,319 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173294431]
[2023-10-25 15:24:14,319 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:14,319 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:24:14,319 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:14,320 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:24:14,320 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:24:14,331 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 391
[2023-10-25 15:24:14,331 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 300 flow. Second operand  has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,332 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:14,332 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 391
[2023-10-25 15:24:14,332 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:14,883 INFO  L130       PetriNetUnfolder]: 842/2819 cut-off events.
[2023-10-25 15:24:14,883 INFO  L131       PetriNetUnfolder]: For 501/752 co-relation queries the response was YES.
[2023-10-25 15:24:14,886 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 2819 events. 842/2819 cut-off events. For 501/752 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 20946 event pairs, 327 based on Foata normal form. 54/2514 useless extension candidates. Maximal degree in co-relation 5017. Up to 756 conditions per place. 
[2023-10-25 15:24:14,915 INFO  L137   encePairwiseOnDemand]: 387/391 looper letters, 56 selfloop transitions, 6 changer transitions 0/115 dead transitions.
[2023-10-25 15:24:14,916 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 115 transitions, 469 flow
[2023-10-25 15:24:14,916 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:24:14,917 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:24:14,918 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions.
[2023-10-25 15:24:14,918 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112531969309463
[2023-10-25 15:24:14,919 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 717 transitions.
[2023-10-25 15:24:14,919 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions.
[2023-10-25 15:24:14,919 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:14,919 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions.
[2023-10-25 15:24:14,920 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 239.0) internal successors, (717), 3 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,922 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,923 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 391.0) internal successors, (1564), 4 states have internal predecessors, (1564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,923 INFO  L175             Difference]: Start difference. First operand has 101 places, 96 transitions, 300 flow. Second operand 3 states and 717 transitions.
[2023-10-25 15:24:14,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 115 transitions, 469 flow
[2023-10-25 15:24:14,938 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 115 transitions, 459 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-10-25 15:24:14,940 INFO  L231             Difference]: Finished difference. Result has 101 places, 94 transitions, 286 flow
[2023-10-25 15:24:14,941 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=391, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=101, PETRI_TRANSITIONS=94}
[2023-10-25 15:24:14,941 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-10-25 15:24:14,941 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 286 flow
[2023-10-25 15:24:14,942 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:14,942 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:14,942 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-10-25 15:24:14,942 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-10-25 15:24:14,942 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 20 more)] ===
[2023-10-25 15:24:14,942 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:14,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 966542179, now seen corresponding path program 1 times
[2023-10-25 15:24:14,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:14,943 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802942846]
[2023-10-25 15:24:14,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:14,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:15,002 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:24:15,002 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:24:15,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:24:15,046 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:24:15,047 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:24:15,047 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining)
[2023-10-25 15:24:15,047 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining)
[2023-10-25 15:24:15,047 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining)
[2023-10-25 15:24:15,047 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining)
[2023-10-25 15:24:15,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining)
[2023-10-25 15:24:15,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining)
[2023-10-25 15:24:15,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining)
[2023-10-25 15:24:15,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining)
[2023-10-25 15:24:15,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining)
[2023-10-25 15:24:15,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining)
[2023-10-25 15:24:15,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining)
[2023-10-25 15:24:15,051 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-10-25 15:24:15,052 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:15,053 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:24:15,053 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-10-25 15:24:15,127 INFO  L144    ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions.
[2023-10-25 15:24:15,129 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 277 places, 297 transitions, 660 flow
[2023-10-25 15:24:15,571 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1260] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][99], [threadThread1of3ForFork0NotInUse, 34#$Ultimate##0true, 27#L1028-13true, 156#L1037-10true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse])
[2023-10-25 15:24:15,571 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:24:15,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:24:15,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:24:15,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:24:15,652 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1260] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][99], [34#$Ultimate##0true, threadThread1of3ForFork0NotInUse, 27#L1028-13true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 191#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2023-10-25 15:24:15,652 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:24:15,652 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1268] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][6], [34#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 233#L1028-13true, 191#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2023-10-25 15:24:15,653 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:15,653 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:24:15,676 INFO  L130       PetriNetUnfolder]: 194/1950 cut-off events.
[2023-10-25 15:24:15,676 INFO  L131       PetriNetUnfolder]: For 164/180 co-relation queries the response was YES.
[2023-10-25 15:24:15,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 1950 events. 194/1950 cut-off events. For 164/180 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12045 event pairs, 4 based on Foata normal form. 16/1635 useless extension candidates. Maximal degree in co-relation 937. Up to 52 conditions per place. 
[2023-10-25 15:24:15,682 INFO  L82        GeneralOperation]: Start removeDead. Operand has 277 places, 297 transitions, 660 flow
[2023-10-25 15:24:15,717 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 247 places, 259 transitions, 566 flow
[2023-10-25 15:24:15,718 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:24:15,718 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 259 transitions, 566 flow
[2023-10-25 15:24:15,718 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 259 transitions, 566 flow
[2023-10-25 15:24:15,718 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 247 places, 259 transitions, 566 flow
[2023-10-25 15:24:16,058 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1260] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][85], [threadThread1of3ForFork0NotInUse, 34#$Ultimate##0true, 27#L1028-13true, 156#L1037-10true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse])
[2023-10-25 15:24:16,058 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:24:16,058 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:24:16,058 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:24:16,059 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:24:16,132 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1260] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of3ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of3ForFork0_thidvar0_8)  InVars {threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  OutVars{threadThread1of3ForFork0_thidvar0=v_threadThread1of3ForFork0_thidvar0_8, threadThread3of3ForFork0_#t~mem8=|v_threadThread3of3ForFork0_#t~mem8_8|}  AuxVars[]  AssignedVars[][85], [34#$Ultimate##0true, threadThread1of3ForFork0NotInUse, 27#L1028-13true, threadThread2of3ForFork0InUse, threadThread3of3ForFork0InUse, 191#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2023-10-25 15:24:16,132 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:24:16,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:16,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:24:16,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:16,133 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1268] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of3ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of3ForFork0_thidvar0_12)  InVars {threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  OutVars{threadThread3of3ForFork0_thidvar0=v_threadThread3of3ForFork0_thidvar0_12, threadThread1of3ForFork0_#t~mem8=|v_threadThread1of3ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][3], [34#$Ultimate##0true, threadThread1of3ForFork0InUse, threadThread2of3ForFork0InUse, threadThread3of3ForFork0NotInUse, 233#L1028-13true, 191#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue])
[2023-10-25 15:24:16,133 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:24:16,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:16,134 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:24:16,134 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:24:16,198 INFO  L130       PetriNetUnfolder]: 194/1950 cut-off events.
[2023-10-25 15:24:16,199 INFO  L131       PetriNetUnfolder]: For 164/164 co-relation queries the response was YES.
[2023-10-25 15:24:16,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2142 conditions, 1950 events. 194/1950 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12056 event pairs, 4 based on Foata normal form. 0/1619 useless extension candidates. Maximal degree in co-relation 937. Up to 52 conditions per place. 
[2023-10-25 15:24:16,264 INFO  L119        LiptonReduction]: Number of co-enabled transitions 29334
[2023-10-25 15:24:22,730 INFO  L134        LiptonReduction]: Checked pairs total: 198761
[2023-10-25 15:24:22,730 INFO  L136        LiptonReduction]: Total number of compositions: 170
[2023-10-25 15:24:22,731 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:24:22,732 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;@1502e3d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:24:22,732 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 27 error locations.
[2023-10-25 15:24:22,732 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 15:24:22,732 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:24:22,732 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:22,732 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 15:24:22,732 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:24:22,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:22,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 1455, now seen corresponding path program 1 times
[2023-10-25 15:24:22,733 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:22,733 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782179133]
[2023-10-25 15:24:22,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:22,733 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:22,736 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:22,737 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:22,737 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:22,737 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782179133]
[2023-10-25 15:24:22,737 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782179133] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:22,737 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:22,738 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 15:24:22,738 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888975664]
[2023-10-25 15:24:22,738 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:22,738 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:24:22,738 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:22,738 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:24:22,739 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:24:22,739 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 269 out of 467
[2023-10-25 15:24:22,739 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 312 flow. Second operand  has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:22,739 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:22,740 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 467
[2023-10-25 15:24:22,740 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:27,087 INFO  L130       PetriNetUnfolder]: 18642/41700 cut-off events.
[2023-10-25 15:24:27,088 INFO  L131       PetriNetUnfolder]: For 3712/5967 co-relation queries the response was YES.
[2023-10-25 15:24:27,161 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 69475 conditions, 41700 events. 18642/41700 cut-off events. For 3712/5967 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 417629 event pairs, 14355 based on Foata normal form. 0/34681 useless extension candidates. Maximal degree in co-relation 58147. Up to 26197 conditions per place. 
[2023-10-25 15:24:27,423 INFO  L137   encePairwiseOnDemand]: 462/467 looper letters, 50 selfloop transitions, 0 changer transitions 0/127 dead transitions.
[2023-10-25 15:24:27,423 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 402 flow
[2023-10-25 15:24:27,424 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-10-25 15:24:27,424 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-10-25 15:24:27,446 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 593 transitions.
[2023-10-25 15:24:27,447 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6349036402569593
[2023-10-25 15:24:27,447 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 593 transitions.
[2023-10-25 15:24:27,447 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 593 transitions.
[2023-10-25 15:24:27,447 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:27,447 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 593 transitions.
[2023-10-25 15:24:27,448 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 296.5) internal successors, (593), 2 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:27,450 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:27,450 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 467.0) internal successors, (1401), 3 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:27,450 INFO  L175             Difference]: Start difference. First operand has 128 places, 132 transitions, 312 flow. Second operand 2 states and 593 transitions.
[2023-10-25 15:24:27,450 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 127 transitions, 402 flow
[2023-10-25 15:24:27,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 127 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:27,455 INFO  L231             Difference]: Finished difference. Result has 124 places, 127 transitions, 302 flow
[2023-10-25 15:24:27,455 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=302, PETRI_PLACES=124, PETRI_TRANSITIONS=127}
[2023-10-25 15:24:27,457 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -4 predicate places.
[2023-10-25 15:24:27,457 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 302 flow
[2023-10-25 15:24:27,458 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 269.5) internal successors, (539), 2 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:27,458 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:27,458 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:27,473 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-10-25 15:24:27,473 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:24:27,474 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:27,474 INFO  L85        PathProgramCache]: Analyzing trace with hash 394491682, now seen corresponding path program 1 times
[2023-10-25 15:24:27,474 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:27,474 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235241594]
[2023-10-25 15:24:27,474 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:27,474 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:27,483 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:27,691 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:27,691 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:27,691 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235241594]
[2023-10-25 15:24:27,691 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235241594] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:27,691 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:27,691 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:24:27,692 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885520246]
[2023-10-25 15:24:27,692 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:27,692 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:24:27,692 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:27,692 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:24:27,693 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:24:28,257 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 221 out of 467
[2023-10-25 15:24:28,258 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 302 flow. Second operand  has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:28,258 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:28,258 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 467
[2023-10-25 15:24:28,258 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:24:54,813 INFO  L130       PetriNetUnfolder]: 137604/235791 cut-off events.
[2023-10-25 15:24:54,813 INFO  L131       PetriNetUnfolder]: For 8827/10783 co-relation queries the response was YES.
[2023-10-25 15:24:55,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 429232 conditions, 235791 events. 137604/235791 cut-off events. For 8827/10783 co-relation queries the response was YES. Maximal size of possible extension queue 3696. Compared 2229156 event pairs, 117782 based on Foata normal form. 0/209921 useless extension candidates. Maximal degree in co-relation 429226. Up to 189146 conditions per place. 
[2023-10-25 15:24:56,162 INFO  L137   encePairwiseOnDemand]: 453/467 looper letters, 75 selfloop transitions, 8 changer transitions 0/129 dead transitions.
[2023-10-25 15:24:56,163 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 472 flow
[2023-10-25 15:24:56,163 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:24:56,163 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:24:56,179 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1415 transitions.
[2023-10-25 15:24:56,182 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5049964311206281
[2023-10-25 15:24:56,182 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1415 transitions.
[2023-10-25 15:24:56,182 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1415 transitions.
[2023-10-25 15:24:56,183 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:24:56,183 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1415 transitions.
[2023-10-25 15:24:56,185 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 235.83333333333334) internal successors, (1415), 6 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:56,199 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:56,199 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:56,200 INFO  L175             Difference]: Start difference. First operand has 124 places, 127 transitions, 302 flow. Second operand 6 states and 1415 transitions.
[2023-10-25 15:24:56,200 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 472 flow
[2023-10-25 15:24:56,234 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 129 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:24:56,235 INFO  L231             Difference]: Finished difference. Result has 127 places, 129 transitions, 352 flow
[2023-10-25 15:24:56,236 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=352, PETRI_PLACES=127, PETRI_TRANSITIONS=129}
[2023-10-25 15:24:56,237 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2023-10-25 15:24:56,237 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 129 transitions, 352 flow
[2023-10-25 15:24:56,237 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 222.0) internal successors, (1332), 6 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:56,237 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:24:56,237 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:24:56,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-10-25 15:24:56,238 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:24:56,238 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:24:56,238 INFO  L85        PathProgramCache]: Analyzing trace with hash 2033105086, now seen corresponding path program 1 times
[2023-10-25 15:24:56,238 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:24:56,238 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437162249]
[2023-10-25 15:24:56,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:24:56,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:24:56,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:24:56,972 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:24:56,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:24:56,972 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437162249]
[2023-10-25 15:24:56,972 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437162249] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:24:56,972 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:24:56,972 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:24:56,974 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517242132]
[2023-10-25 15:24:56,974 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:24:56,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:24:56,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:24:56,975 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:24:56,975 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:24:57,753 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 467
[2023-10-25 15:24:57,754 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 352 flow. Second operand  has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:24:57,754 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:24:57,754 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 467
[2023-10-25 15:24:57,755 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:03,410 INFO  L130       PetriNetUnfolder]: 35492/63537 cut-off events.
[2023-10-25 15:25:03,411 INFO  L131       PetriNetUnfolder]: For 6202/10100 co-relation queries the response was YES.
[2023-10-25 15:25:03,583 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 117244 conditions, 63537 events. 35492/63537 cut-off events. For 6202/10100 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 550057 event pairs, 14355 based on Foata normal form. 0/54885 useless extension candidates. Maximal degree in co-relation 117234. Up to 26166 conditions per place. 
[2023-10-25 15:25:03,807 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 192 selfloop transitions, 5 changer transitions 4/268 dead transitions.
[2023-10-25 15:25:03,808 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 268 transitions, 1098 flow
[2023-10-25 15:25:03,808 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:25:03,808 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:25:03,817 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1733 transitions.
[2023-10-25 15:25:03,828 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6184867951463241
[2023-10-25 15:25:03,828 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1733 transitions.
[2023-10-25 15:25:03,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1733 transitions.
[2023-10-25 15:25:03,829 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:03,829 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1733 transitions.
[2023-10-25 15:25:03,832 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 288.8333333333333) internal successors, (1733), 6 states have internal predecessors, (1733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:03,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:03,846 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:03,847 INFO  L175             Difference]: Start difference. First operand has 127 places, 129 transitions, 352 flow. Second operand 6 states and 1733 transitions.
[2023-10-25 15:25:03,847 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 268 transitions, 1098 flow
[2023-10-25 15:25:03,853 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 268 transitions, 1098 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-10-25 15:25:03,876 INFO  L231             Difference]: Finished difference. Result has 131 places, 124 transitions, 337 flow
[2023-10-25 15:25:03,876 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=337, PETRI_PLACES=131, PETRI_TRANSITIONS=124}
[2023-10-25 15:25:03,877 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places.
[2023-10-25 15:25:03,877 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 337 flow
[2023-10-25 15:25:03,878 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 257.3333333333333) internal successors, (1544), 6 states have internal predecessors, (1544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:03,878 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:03,878 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:03,878 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-10-25 15:25:03,878 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:03,878 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:03,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -328208307, now seen corresponding path program 1 times
[2023-10-25 15:25:03,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:03,879 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413615458]
[2023-10-25 15:25:03,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:03,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:03,891 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:03,918 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:03,919 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:03,919 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413615458]
[2023-10-25 15:25:03,919 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413615458] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:03,919 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:03,919 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:25:03,919 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694727446]
[2023-10-25 15:25:03,920 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:03,920 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:25:03,920 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:03,921 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:25:03,921 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:25:03,934 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-10-25 15:25:03,942 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 124 transitions, 337 flow. Second operand  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:03,942 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:03,942 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-10-25 15:25:03,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:09,158 INFO  L130       PetriNetUnfolder]: 23636/50202 cut-off events.
[2023-10-25 15:25:09,159 INFO  L131       PetriNetUnfolder]: For 5807/9277 co-relation queries the response was YES.
[2023-10-25 15:25:09,268 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88933 conditions, 50202 events. 23636/50202 cut-off events. For 5807/9277 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 496936 event pairs, 16449 based on Foata normal form. 17/42285 useless extension candidates. Maximal degree in co-relation 88922. Up to 30787 conditions per place. 
[2023-10-25 15:25:09,419 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 83 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2023-10-25 15:25:09,419 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 159 transitions, 611 flow
[2023-10-25 15:25:09,419 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:25:09,419 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:25:09,420 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2023-10-25 15:25:09,421 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6216987865810135
[2023-10-25 15:25:09,421 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2023-10-25 15:25:09,421 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2023-10-25 15:25:09,421 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:09,422 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2023-10-25 15:25:09,434 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 290.3333333333333) internal successors, (871), 3 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:09,439 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:09,440 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:09,440 INFO  L175             Difference]: Start difference. First operand has 131 places, 124 transitions, 337 flow. Second operand 3 states and 871 transitions.
[2023-10-25 15:25:09,440 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 159 transitions, 611 flow
[2023-10-25 15:25:09,451 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 159 transitions, 595 flow, removed 3 selfloop flow, removed 5 redundant places.
[2023-10-25 15:25:09,462 INFO  L231             Difference]: Finished difference. Result has 129 places, 128 transitions, 354 flow
[2023-10-25 15:25:09,462 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=129, PETRI_TRANSITIONS=128}
[2023-10-25 15:25:09,463 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places.
[2023-10-25 15:25:09,463 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 354 flow
[2023-10-25 15:25:09,464 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:09,464 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:09,464 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:09,464 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-10-25 15:25:09,464 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:09,464 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:09,465 INFO  L85        PathProgramCache]: Analyzing trace with hash 1992771771, now seen corresponding path program 1 times
[2023-10-25 15:25:09,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:09,465 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052194169]
[2023-10-25 15:25:09,465 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:09,465 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:09,499 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-10-25 15:25:09,499 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [649882428]
[2023-10-25 15:25:09,499 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:09,499 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:25:09,500 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:25:09,514 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:25:09,549 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-10-25 15:25:09,765 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:09,766 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-10-25 15:25:09,767 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:25:09,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:09,772 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:25:09,776 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:09,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052194169]
[2023-10-25 15:25:09,776 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-10-25 15:25:09,776 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [649882428]
[2023-10-25 15:25:09,776 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [649882428] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:09,776 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:09,777 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:25:09,777 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149642411]
[2023-10-25 15:25:09,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:09,778 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:25:09,778 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:09,778 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:25:09,778 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:25:09,819 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 247 out of 467
[2023-10-25 15:25:09,820 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 354 flow. Second operand  has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:09,820 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:09,820 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 467
[2023-10-25 15:25:09,820 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:15,242 INFO  L130       PetriNetUnfolder]: 26090/54005 cut-off events.
[2023-10-25 15:25:15,243 INFO  L131       PetriNetUnfolder]: For 9973/13484 co-relation queries the response was YES.
[2023-10-25 15:25:15,377 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 100895 conditions, 54005 events. 26090/54005 cut-off events. For 9973/13484 co-relation queries the response was YES. Maximal size of possible extension queue 1108. Compared 528322 event pairs, 19834 based on Foata normal form. 0/44930 useless extension candidates. Maximal degree in co-relation 100883. Up to 36612 conditions per place. 
[2023-10-25 15:25:15,547 INFO  L137   encePairwiseOnDemand]: 463/467 looper letters, 55 selfloop transitions, 1 changer transitions 0/125 dead transitions.
[2023-10-25 15:25:15,547 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 460 flow
[2023-10-25 15:25:15,547 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:25:15,547 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:25:15,548 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions.
[2023-10-25 15:25:15,549 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5681655960028551
[2023-10-25 15:25:15,549 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 796 transitions.
[2023-10-25 15:25:15,549 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions.
[2023-10-25 15:25:15,549 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:15,550 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions.
[2023-10-25 15:25:15,552 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:15,553 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:15,553 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:15,553 INFO  L175             Difference]: Start difference. First operand has 129 places, 128 transitions, 354 flow. Second operand 3 states and 796 transitions.
[2023-10-25 15:25:15,553 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 460 flow
[2023-10-25 15:25:15,632 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:25:15,633 INFO  L231             Difference]: Finished difference. Result has 127 places, 125 transitions, 345 flow
[2023-10-25 15:25:15,634 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=127, PETRI_TRANSITIONS=125}
[2023-10-25 15:25:15,635 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2023-10-25 15:25:15,635 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 345 flow
[2023-10-25 15:25:15,635 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 250.33333333333334) internal successors, (751), 3 states have internal predecessors, (751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:15,637 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:15,637 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:15,647 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-25 15:25:15,842 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:25:15,842 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:15,843 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:15,843 INFO  L85        PathProgramCache]: Analyzing trace with hash -1529971120, now seen corresponding path program 1 times
[2023-10-25 15:25:15,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:15,843 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235648940]
[2023-10-25 15:25:15,843 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:15,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:15,867 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:15,897 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-10-25 15:25:15,901 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:15,901 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235648940]
[2023-10-25 15:25:15,901 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235648940] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:15,901 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:15,902 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:25:15,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463110539]
[2023-10-25 15:25:15,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:15,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:25:15,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:15,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:25:15,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:25:15,918 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-10-25 15:25:15,926 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 345 flow. Second operand  has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:15,926 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:15,926 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-10-25 15:25:15,926 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:21,604 INFO  L130       PetriNetUnfolder]: 27791/57540 cut-off events.
[2023-10-25 15:25:21,604 INFO  L131       PetriNetUnfolder]: For 9347/12239 co-relation queries the response was YES.
[2023-10-25 15:25:21,760 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107255 conditions, 57540 events. 27791/57540 cut-off events. For 9347/12239 co-relation queries the response was YES. Maximal size of possible extension queue 1280. Compared 572461 event pairs, 16113 based on Foata normal form. 10/49191 useless extension candidates. Maximal degree in co-relation 107243. Up to 33367 conditions per place. 
[2023-10-25 15:25:21,938 INFO  L137   encePairwiseOnDemand]: 460/467 looper letters, 87 selfloop transitions, 9 changer transitions 0/164 dead transitions.
[2023-10-25 15:25:21,938 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 164 transitions, 655 flow
[2023-10-25 15:25:21,938 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:25:21,939 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:25:21,940 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions.
[2023-10-25 15:25:21,940 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.622412562455389
[2023-10-25 15:25:21,940 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 872 transitions.
[2023-10-25 15:25:21,940 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions.
[2023-10-25 15:25:21,940 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:21,941 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions.
[2023-10-25 15:25:21,942 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 290.6666666666667) internal successors, (872), 3 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:21,943 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:21,943 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:21,943 INFO  L175             Difference]: Start difference. First operand has 127 places, 125 transitions, 345 flow. Second operand 3 states and 872 transitions.
[2023-10-25 15:25:21,947 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 164 transitions, 655 flow
[2023-10-25 15:25:21,952 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 164 transitions, 654 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:25:21,954 INFO  L231             Difference]: Finished difference. Result has 130 places, 132 transitions, 420 flow
[2023-10-25 15:25:21,954 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=420, PETRI_PLACES=130, PETRI_TRANSITIONS=132}
[2023-10-25 15:25:21,959 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places.
[2023-10-25 15:25:21,959 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 132 transitions, 420 flow
[2023-10-25 15:25:21,959 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:21,959 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:21,959 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:21,959 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-10-25 15:25:21,959 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:21,960 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:21,973 INFO  L85        PathProgramCache]: Analyzing trace with hash -456087400, now seen corresponding path program 1 times
[2023-10-25 15:25:21,973 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:21,973 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321667839]
[2023-10-25 15:25:21,973 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:21,973 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:21,992 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:22,081 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:22,081 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:22,081 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321667839]
[2023-10-25 15:25:22,081 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321667839] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:22,082 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:22,082 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-10-25 15:25:22,082 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434677720]
[2023-10-25 15:25:22,082 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:22,083 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:25:22,083 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:22,083 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:25:22,083 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:25:22,112 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 467
[2023-10-25 15:25:22,112 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 132 transitions, 420 flow. Second operand  has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:22,113 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:22,113 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 467
[2023-10-25 15:25:22,113 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:25,343 INFO  L130       PetriNetUnfolder]: 13397/30583 cut-off events.
[2023-10-25 15:25:25,343 INFO  L131       PetriNetUnfolder]: For 6534/7626 co-relation queries the response was YES.
[2023-10-25 15:25:25,414 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 57223 conditions, 30583 events. 13397/30583 cut-off events. For 6534/7626 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 299768 event pairs, 3636 based on Foata normal form. 929/26739 useless extension candidates. Maximal degree in co-relation 57210. Up to 11131 conditions per place. 
[2023-10-25 15:25:25,497 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 84 selfloop transitions, 7 changer transitions 0/161 dead transitions.
[2023-10-25 15:25:25,497 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 161 transitions, 676 flow
[2023-10-25 15:25:25,498 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:25:25,498 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:25:25,499 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions.
[2023-10-25 15:25:25,499 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6238401142041399
[2023-10-25 15:25:25,500 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 874 transitions.
[2023-10-25 15:25:25,500 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions.
[2023-10-25 15:25:25,500 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:25,500 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions.
[2023-10-25 15:25:25,501 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 291.3333333333333) internal successors, (874), 3 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:25,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:25,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:25,503 INFO  L175             Difference]: Start difference. First operand has 130 places, 132 transitions, 420 flow. Second operand 3 states and 874 transitions.
[2023-10-25 15:25:25,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 161 transitions, 676 flow
[2023-10-25 15:25:25,517 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 161 transitions, 664 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-10-25 15:25:25,518 INFO  L231             Difference]: Finished difference. Result has 130 places, 126 transitions, 376 flow
[2023-10-25 15:25:25,519 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=130, PETRI_TRANSITIONS=126}
[2023-10-25 15:25:25,519 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places.
[2023-10-25 15:25:25,520 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 126 transitions, 376 flow
[2023-10-25 15:25:25,520 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 265.6666666666667) internal successors, (797), 3 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:25,520 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:25,520 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, 1, 1]
[2023-10-25 15:25:25,520 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-10-25 15:25:25,529 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:25,529 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:25,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -436455586, now seen corresponding path program 1 times
[2023-10-25 15:25:25,530 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:25,530 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088480651]
[2023-10-25 15:25:25,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:25,531 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:25,555 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-10-25 15:25:25,556 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118940212]
[2023-10-25 15:25:25,556 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:25,556 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:25:25,556 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-10-25 15:25:25,557 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-10-25 15:25:25,582 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-10-25 15:25:25,741 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:25,743 INFO  L263         TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjunts are in the unsatisfiable core
[2023-10-25 15:25:25,744 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-10-25 15:25:25,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 45
[2023-10-25 15:25:25,867 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 15 treesize of output 14
[2023-10-25 15:25:25,876 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 13
[2023-10-25 15:25:25,956 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 92 treesize of output 83
[2023-10-25 15:25:25,967 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:25:25,967 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 156
[2023-10-25 15:25:26,072 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 3
[2023-10-25 15:25:26,127 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 120 treesize of output 107
[2023-10-25 15:25:26,141 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:25:26,141 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 106 treesize of output 210
[2023-10-25 15:25:26,234 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 21
[2023-10-25 15:25:26,311 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 148 treesize of output 131
[2023-10-25 15:25:26,320 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-10-25 15:25:26,321 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 130 treesize of output 264
[2023-10-25 15:25:26,376 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 263 treesize of output 143
[2023-10-25 15:25:26,517 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:26,518 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-10-25 15:25:26,518 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:26,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088480651]
[2023-10-25 15:25:26,518 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-10-25 15:25:26,518 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118940212]
[2023-10-25 15:25:26,518 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118940212] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:26,520 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:26,520 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-10-25 15:25:26,520 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540141416]
[2023-10-25 15:25:26,520 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:26,521 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-10-25 15:25:26,521 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:26,521 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-10-25 15:25:26,521 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-10-25 15:25:27,889 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 467
[2023-10-25 15:25:27,890 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 126 transitions, 376 flow. Second operand  has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:27,890 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:27,890 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 467
[2023-10-25 15:25:27,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:32,898 INFO  L130       PetriNetUnfolder]: 22299/44622 cut-off events.
[2023-10-25 15:25:32,899 INFO  L131       PetriNetUnfolder]: For 11922/13636 co-relation queries the response was YES.
[2023-10-25 15:25:33,001 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 89050 conditions, 44622 events. 22299/44622 cut-off events. For 11922/13636 co-relation queries the response was YES. Maximal size of possible extension queue 932. Compared 418738 event pairs, 9786 based on Foata normal form. 407/38559 useless extension candidates. Maximal degree in co-relation 89037. Up to 19801 conditions per place. 
[2023-10-25 15:25:33,159 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 201 selfloop transitions, 5 changer transitions 0/269 dead transitions.
[2023-10-25 15:25:33,159 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 269 transitions, 1298 flow
[2023-10-25 15:25:33,160 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-10-25 15:25:33,160 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-10-25 15:25:33,162 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1725 transitions.
[2023-10-25 15:25:33,162 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6156316916488223
[2023-10-25 15:25:33,162 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1725 transitions.
[2023-10-25 15:25:33,162 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1725 transitions.
[2023-10-25 15:25:33,163 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:33,163 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1725 transitions.
[2023-10-25 15:25:33,166 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 287.5) internal successors, (1725), 6 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:33,170 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:33,171 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 467.0) internal successors, (3269), 7 states have internal predecessors, (3269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:33,171 INFO  L175             Difference]: Start difference. First operand has 130 places, 126 transitions, 376 flow. Second operand 6 states and 1725 transitions.
[2023-10-25 15:25:33,171 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 269 transitions, 1298 flow
[2023-10-25 15:25:33,186 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 269 transitions, 1271 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-10-25 15:25:33,189 INFO  L231             Difference]: Finished difference. Result has 133 places, 125 transitions, 377 flow
[2023-10-25 15:25:33,189 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=377, PETRI_PLACES=133, PETRI_TRANSITIONS=125}
[2023-10-25 15:25:33,190 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places.
[2023-10-25 15:25:33,190 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 377 flow
[2023-10-25 15:25:33,190 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:33,190 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:33,190 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:33,198 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-10-25 15:25:33,395 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-10-25 15:25:33,397 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:33,397 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:33,398 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108499910, now seen corresponding path program 1 times
[2023-10-25 15:25:33,398 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:33,398 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707968736]
[2023-10-25 15:25:33,398 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:33,399 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:33,453 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:33,486 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2023-10-25 15:25:33,486 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:33,486 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707968736]
[2023-10-25 15:25:33,486 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707968736] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:33,487 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:33,487 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-10-25 15:25:33,487 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296008603]
[2023-10-25 15:25:33,487 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:33,488 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-10-25 15:25:33,488 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:33,488 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-10-25 15:25:33,488 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-10-25 15:25:33,502 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-10-25 15:25:33,503 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 125 transitions, 377 flow. Second operand  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:33,503 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:33,503 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-10-25 15:25:33,503 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-10-25 15:25:37,329 INFO  L130       PetriNetUnfolder]: 14170/32886 cut-off events.
[2023-10-25 15:25:37,330 INFO  L131       PetriNetUnfolder]: For 8002/10889 co-relation queries the response was YES.
[2023-10-25 15:25:37,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 61656 conditions, 32886 events. 14170/32886 cut-off events. For 8002/10889 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 327425 event pairs, 8922 based on Foata normal form. 55/28027 useless extension candidates. Maximal degree in co-relation 61642. Up to 18515 conditions per place. 
[2023-10-25 15:25:37,518 INFO  L137   encePairwiseOnDemand]: 462/467 looper letters, 80 selfloop transitions, 4 changer transitions 0/151 dead transitions.
[2023-10-25 15:25:37,518 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 151 transitions, 626 flow
[2023-10-25 15:25:37,518 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-10-25 15:25:37,518 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-10-25 15:25:37,520 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions.
[2023-10-25 15:25:37,520 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6152748037116346
[2023-10-25 15:25:37,521 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 862 transitions.
[2023-10-25 15:25:37,521 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions.
[2023-10-25 15:25:37,521 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-10-25 15:25:37,521 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions.
[2023-10-25 15:25:37,522 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 287.3333333333333) internal successors, (862), 3 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:37,523 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:37,537 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 467.0) internal successors, (1868), 4 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:37,537 INFO  L175             Difference]: Start difference. First operand has 133 places, 125 transitions, 377 flow. Second operand 3 states and 862 transitions.
[2023-10-25 15:25:37,537 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 151 transitions, 626 flow
[2023-10-25 15:25:37,543 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 616 flow, removed 0 selfloop flow, removed 5 redundant places.
[2023-10-25 15:25:37,558 INFO  L231             Difference]: Finished difference. Result has 132 places, 128 transitions, 402 flow
[2023-10-25 15:25:37,558 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=467, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=402, PETRI_PLACES=132, PETRI_TRANSITIONS=128}
[2023-10-25 15:25:37,559 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places.
[2023-10-25 15:25:37,559 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 402 flow
[2023-10-25 15:25:37,559 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:37,559 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:37,559 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2023-10-25 15:25:37,559 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-10-25 15:25:37,560 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] ===
[2023-10-25 15:25:37,560 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:37,560 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174659505, now seen corresponding path program 1 times
[2023-10-25 15:25:37,560 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:37,560 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485574557]
[2023-10-25 15:25:37,560 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:37,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:37,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:25:37,615 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-10-25 15:25:37,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-10-25 15:25:37,673 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-10-25 15:25:37,673 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-10-25 15:25:37,673 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining)
[2023-10-25 15:25:37,674 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining)
[2023-10-25 15:25:37,675 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining)
[2023-10-25 15:25:37,676 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining)
[2023-10-25 15:25:37,676 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining)
[2023-10-25 15:25:37,676 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining)
[2023-10-25 15:25:37,676 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining)
[2023-10-25 15:25:37,676 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining)
[2023-10-25 15:25:37,677 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining)
[2023-10-25 15:25:37,678 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining)
[2023-10-25 15:25:37,678 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining)
[2023-10-25 15:25:37,678 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-10-25 15:25:37,678 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-10-25 15:25:37,682 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-10-25 15:25:37,682 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-10-25 15:25:37,770 INFO  L144    ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions.
[2023-10-25 15:25:37,773 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 323 places, 353 transitions, 810 flow
[2023-10-25 15:25:38,083 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,084 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,084 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:38,084 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,084 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,096 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,096 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,097 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,097 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:38,102 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,102 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,102 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:38,102 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,110 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,111 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,111 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,111 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,111 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:38,111 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:38,668 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,669 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,669 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,675 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,676 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,676 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,676 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,676 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,678 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1800] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][189], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 144#L1028-13true, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,678 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,678 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,680 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,680 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,680 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,680 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,681 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,681 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:38,746 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,746 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,746 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:38,746 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:38,746 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:38,784 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1811] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][186], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,785 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:38,785 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:38,785 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,786 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,786 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,786 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,789 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_8 (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][133], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,789 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,789 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,789 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,789 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,789 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,790 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,790 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:38,790 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,790 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,791 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,791 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,791 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1800] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][189], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,791 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,791 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,791 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,792 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,792 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,792 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,793 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:38,793 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,793 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,793 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,793 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,801 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,801 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,841 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:38,841 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:38,841 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,842 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:38,842 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,847 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,847 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:38,847 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:38,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:38,854 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:38,855 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,855 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:38,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:38,855 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:38,934 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][301], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,934 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,935 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1811] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][186], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,935 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,935 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,935 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,935 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,936 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][184], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,936 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,949 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1807] threadEXIT-->L1028-13: Formula: (= v_threadThread3of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][185], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:38,949 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,958 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:38,978 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse])
[2023-10-25 15:25:38,979 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,979 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,979 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:38,979 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,979 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:38,979 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,980 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 48#$Ultimate##0true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:38,982 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 48#$Ultimate##0true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,982 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,982 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,983 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:38,985 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:38,985 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:38,985 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,985 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:38,985 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:38,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:38,986 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:39,081 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][184], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,082 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,082 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,082 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,082 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,083 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,083 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,083 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,086 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,086 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,086 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,087 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,088 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,088 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,089 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:39,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:39,089 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:39,144 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][301], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,144 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,144 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,146 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,146 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,147 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,147 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,147 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,147 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,150 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,150 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,150 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,152 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,152 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:39,153 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,153 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:39,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:39,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:39,153 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,163 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][184], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,163 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,163 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,164 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,164 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,165 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,165 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,167 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:39,167 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,178 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,179 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,179 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,179 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,179 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,180 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,210 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, 144#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,210 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-10-25 15:25:39,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-10-25 15:25:39,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:39,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:39,226 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][301], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,227 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,227 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,227 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,227 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,227 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,228 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,228 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,228 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,229 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,229 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,229 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,229 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,229 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,229 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,230 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,230 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,231 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:39,234 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 43#L1028-13true, 144#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,234 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,235 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,236 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,236 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,236 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,237 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,237 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,253 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:39,253 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,253 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,254 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,257 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,257 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-10-25 15:25:39,257 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,258 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,258 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,259 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,260 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,260 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,260 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,260 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,260 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,260 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:39,260 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,261 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:39,261 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:39,303 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0InUse])
[2023-10-25 15:25:39,303 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,303 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,303 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,303 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,304 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:39,304 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,305 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 48#$Ultimate##0true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:39,305 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,305 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,305 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,305 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,306 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 48#$Ultimate##0true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,306 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 43#L1028-13true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,307 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,308 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:39,308 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,312 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][190], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:39,312 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][134], [threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,313 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,313 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][191], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:39,314 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][136], [threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,314 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][304], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:39,315 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,315 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,316 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:39,316 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:39,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:39,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:39,374 INFO  L130       PetriNetUnfolder]: 924/6411 cut-off events.
[2023-10-25 15:25:39,374 INFO  L131       PetriNetUnfolder]: For 877/952 co-relation queries the response was YES.
[2023-10-25 15:25:39,450 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6411 events. 924/6411 cut-off events. For 877/952 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 54912 event pairs, 29 based on Foata normal form. 57/5304 useless extension candidates. Maximal degree in co-relation 2109. Up to 189 conditions per place. 
[2023-10-25 15:25:39,450 INFO  L82        GeneralOperation]: Start removeDead. Operand has 323 places, 353 transitions, 810 flow
[2023-10-25 15:25:39,575 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 293 places, 313 transitions, 706 flow
[2023-10-25 15:25:39,583 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-10-25 15:25:39,583 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 313 transitions, 706 flow
[2023-10-25 15:25:39,584 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 313 transitions, 706 flow
[2023-10-25 15:25:39,584 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 293 places, 313 transitions, 706 flow
[2023-10-25 15:25:39,964 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,977 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:39,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,977 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,984 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,989 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,989 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,989 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,989 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:39,993 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:39,993 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,993 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:39,993 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,993 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,993 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,998 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:39,998 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,999 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:39,999 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,999 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:39,999 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:40,375 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,384 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,389 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,405 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,405 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,407 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1800] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][166], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 144#L1028-13true, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,407 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,407 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,407 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,407 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,409 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,409 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,409 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,410 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:40,410 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,410 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:40,501 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,501 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:40,501 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:40,502 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:40,541 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1811] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][164], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,542 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:40,542 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:40,542 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:40,542 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-10-25 15:25:40,542 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,543 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,543 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,543 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,543 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,544 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,546 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1798] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_8 (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][118], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,546 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,546 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,546 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,547 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,547 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,547 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,547 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,547 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:40,547 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,547 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,548 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,548 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1800] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread4of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][166], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,548 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,549 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,550 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,551 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,551 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,551 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,551 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,551 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,552 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:40,552 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,552 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,553 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,561 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,562 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:40,562 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:40,562 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,562 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,602 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:40,602 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:40,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:40,603 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,608 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:40,608 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-10-25 15:25:40,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:40,608 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:40,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:40,609 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:40,609 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-10-25 15:25:40,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-10-25 15:25:40,609 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-10-25 15:25:40,908 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][268], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,908 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,909 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,909 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,909 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,910 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1811] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread3of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_12|, threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][164], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,910 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,910 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,910 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][162], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,911 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,911 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1807] threadEXIT-->L1028-13: Formula: (= v_threadThread3of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_12, threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][163], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:40,911 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,911 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,912 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-10-25 15:25:40,933 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse])
[2023-10-25 15:25:40,933 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,933 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:40,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,934 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [146#$Ultimate##0true, threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:40,934 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,934 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,935 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:40,937 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 48#$Ultimate##0true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:40,937 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:40,938 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 48#$Ultimate##0true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,938 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,938 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:40,940 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:40,941 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:40,941 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,941 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-10-25 15:25:40,942 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-10-25 15:25:41,061 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][162], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,061 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,062 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,063 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,063 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,063 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,063 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,063 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,063 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,066 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,066 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,066 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,067 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,068 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,068 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,069 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,069 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:41,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:41,069 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:41,130 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][268], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,130 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,131 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,133 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,133 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,133 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,136 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,136 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,136 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,138 INFO  L381   tUnfolder$Statistics]: inserting event number 6 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,138 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-10-25 15:25:41,138 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,140 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,140 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-10-25 15:25:41,140 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-10-25 15:25:41,140 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-10-25 15:25:41,140 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,140 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,141 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-10-25 15:25:41,141 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:41,141 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-10-25 15:25:41,145 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,155 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1803] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_12| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread3of4ForFork0_thidvar0_10)  InVars {threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  OutVars{threadThread3of4ForFork0_thidvar0=v_threadThread3of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_12|}  AuxVars[]  AssignedVars[][162], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,156 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,156 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,156 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,156 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,156 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,156 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,157 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,157 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,159 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:41,159 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,159 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,160 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,160 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,160 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,187 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, 144#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,188 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-10-25 15:25:41,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-10-25 15:25:41,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:41,188 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:41,206 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1797] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread3of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_8)  InVars {threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  OutVars{threadThread3of4ForFork0_#t~mem8=|v_threadThread3of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_8}  AuxVars[]  AssignedVars[][268], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,206 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,206 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,207 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,207 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,208 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,208 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0NotInUse, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,208 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,209 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,209 INFO  L381   tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,210 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-10-25 15:25:41,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,210 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-10-25 15:25:41,214 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 43#L1028-13true, 144#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,214 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,215 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,215 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,216 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,216 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,217 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,217 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,234 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:41,234 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,234 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,237 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,237 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-10-25 15:25:41,237 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 190#L1037-10true, 160#$Ultimate##0true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,238 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,238 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,240 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread2of4ForFork0InUse, 9#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 190#L1037-10true, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,240 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-10-25 15:25:41,240 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-10-25 15:25:41,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,241 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-10-25 15:25:41,285 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0InUse])
[2023-10-25 15:25:41,286 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,286 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread2of4ForFork0InUse, 146#$Ultimate##0true, threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 144#L1028-13true, threadThread1of4ForFork0NotInUse])
[2023-10-25 15:25:41,286 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,286 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,288 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0NotInUse, 48#$Ultimate##0true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:41,288 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,288 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,292 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,292 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,293 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0InUse, 235#L1028-13true, threadThread4of4ForFork0InUse, 48#$Ultimate##0true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,293 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,293 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,293 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,293 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,295 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 43#L1028-13true, 144#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,295 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,295 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,296 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,296 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, threadThread4of4ForFork0InUse, 160#$Ultimate##0true, 144#L1028-13true, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:41,299 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,300 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,303 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1804] threadEXIT-->L1028-13: Formula: (= v_threadThread4of4ForFork0_thidvar0_10 (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  OutVars{threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_10}  AuxVars[]  AssignedVars[][167], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:41,304 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,304 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,305 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1808] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_14| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))) v_threadThread4of4ForFork0_thidvar0_12)  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_14|, threadThread4of4ForFork0_thidvar0=v_threadThread4of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][168], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, threadThread4of4ForFork0NotInUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, 212#L1028-13true])
[2023-10-25 15:25:41,306 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,306 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1802] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread1of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread2of4ForFork0_thidvar0_10)  InVars {threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  OutVars{threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_10, threadThread1of4ForFork0_#t~mem8=|v_threadThread1of4ForFork0_#t~mem8_10|}  AuxVars[]  AssignedVars[][119], [threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,306 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,306 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1809] threadEXIT-->L1028-13: Formula: (= (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_threadThread1of4ForFork0_thidvar0_14)  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][270], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0NotInUse, 212#L1028-13true])
[2023-10-25 15:25:41,307 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,307 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1810] threadEXIT-->L1028-13: Formula: (= v_threadThread2of4ForFork0_thidvar0_14 (let ((.cse0 (mod |v_threadThread4of4ForFork0_#t~mem8_10| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ (- 4294967296) .cse0))))  InVars {threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  OutVars{threadThread4of4ForFork0_#t~mem8=|v_threadThread4of4ForFork0_#t~mem8_10|, threadThread2of4ForFork0_thidvar0=v_threadThread2of4ForFork0_thidvar0_14}  AuxVars[]  AssignedVars[][120], [threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, 43#L1028-13true, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-10-25 15:25:41,308 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L381   tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([1805] threadEXIT-->L1028-13: Formula: (= v_threadThread1of4ForFork0_thidvar0_12 (let ((.cse0 (mod |v_threadThread2of4ForFork0_#t~mem8_8| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))))  InVars {threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  OutVars{threadThread2of4ForFork0_#t~mem8=|v_threadThread2of4ForFork0_#t~mem8_8|, threadThread1of4ForFork0_thidvar0=v_threadThread1of4ForFork0_thidvar0_12}  AuxVars[]  AssignedVars[][269], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0InUse, 9#$Ultimate##0true, 235#L1028-13true, threadThread4of4ForFork0InUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-10-25 15:25:41,308 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,308 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-10-25 15:25:41,309 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-10-25 15:25:41,358 INFO  L130       PetriNetUnfolder]: 924/6411 cut-off events.
[2023-10-25 15:25:41,358 INFO  L131       PetriNetUnfolder]: For 877/895 co-relation queries the response was YES.
[2023-10-25 15:25:41,418 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7319 conditions, 6411 events. 924/6411 cut-off events. For 877/895 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 54685 event pairs, 29 based on Foata normal form. 0/5247 useless extension candidates. Maximal degree in co-relation 2109. Up to 189 conditions per place. 
[2023-10-25 15:25:41,614 INFO  L119        LiptonReduction]: Number of co-enabled transitions 50264
[2023-10-25 15:25:48,045 INFO  L134        LiptonReduction]: Checked pairs total: 354859
[2023-10-25 15:25:48,053 INFO  L136        LiptonReduction]: Total number of compositions: 195
[2023-10-25 15:25:48,056 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-10-25 15:25:48,056 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;@1502e3d0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-10-25 15:25:48,056 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 31 error locations.
[2023-10-25 15:25:48,057 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-10-25 15:25:48,057 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-10-25 15:25:48,057 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-10-25 15:25:48,057 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-10-25 15:25:48,057 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2023-10-25 15:25:48,057 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-10-25 15:25:48,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 2027, now seen corresponding path program 1 times
[2023-10-25 15:25:48,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-10-25 15:25:48,057 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689522911]
[2023-10-25 15:25:48,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-10-25 15:25:48,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-10-25 15:25:48,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-10-25 15:25:48,076 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-10-25 15:25:48,076 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-10-25 15:25:48,076 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689522911]
[2023-10-25 15:25:48,076 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689522911] provided 1 perfect and 0 imperfect interpolant sequences
[2023-10-25 15:25:48,076 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-10-25 15:25:48,076 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-10-25 15:25:48,076 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6875096]
[2023-10-25 15:25:48,077 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-10-25 15:25:48,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-10-25 15:25:48,078 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-10-25 15:25:48,078 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-10-25 15:25:48,078 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-10-25 15:25:48,078 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 313 out of 548
[2023-10-25 15:25:48,079 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 167 transitions, 414 flow. Second operand  has 2 states, 2 states have (on average 313.5) internal successors, (627), 2 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-10-25 15:25:48,079 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-10-25 15:25:48,079 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 548
[2023-10-25 15:25:48,079 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
