./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-race-3.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-race-3.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 6e23a733a0ff6349360c2cce73db246c67b4c8edd8aa7941d4e8c63ac8efa03e
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2023-11-03 13:26:11,285 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2023-11-03 13:26:11,287 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2023-11-03 13:26:11,312 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2023-11-03 13:26:11,313 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2023-11-03 13:26:11,314 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2023-11-03 13:26:11,316 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2023-11-03 13:26:11,318 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2023-11-03 13:26:11,320 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2023-11-03 13:26:11,321 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2023-11-03 13:26:11,322 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2023-11-03 13:26:11,323 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2023-11-03 13:26:11,323 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2023-11-03 13:26:11,324 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2023-11-03 13:26:11,325 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2023-11-03 13:26:11,326 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2023-11-03 13:26:11,327 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2023-11-03 13:26:11,327 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2023-11-03 13:26:11,328 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2023-11-03 13:26:11,330 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2023-11-03 13:26:11,331 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2023-11-03 13:26:11,332 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2023-11-03 13:26:11,333 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2023-11-03 13:26:11,333 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2023-11-03 13:26:11,336 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2023-11-03 13:26:11,336 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2023-11-03 13:26:11,336 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2023-11-03 13:26:11,337 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2023-11-03 13:26:11,337 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2023-11-03 13:26:11,338 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2023-11-03 13:26:11,338 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2023-11-03 13:26:11,339 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2023-11-03 13:26:11,339 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2023-11-03 13:26:11,340 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2023-11-03 13:26:11,340 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2023-11-03 13:26:11,340 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2023-11-03 13:26:11,341 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2023-11-03 13:26:11,341 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2023-11-03 13:26:11,341 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2023-11-03 13:26:11,342 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2023-11-03 13:26:11,342 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2023-11-03 13:26:11,343 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2023-11-03 13:26:11,359 INFO  L113        SettingsManager]: Loading preferences was successful
[2023-11-03 13:26:11,359 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-03 13:26:11,359 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-11-03 13:26:11,359 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-11-03 13:26:11,360 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-03 13:26:11,360 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-03 13:26:11,361 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-03 13:26:11,361 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-03 13:26:11,361 INFO  L138        SettingsManager]:  * Use SBE=true
[2023-11-03 13:26:11,361 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-03 13:26:11,361 INFO  L138        SettingsManager]:  * sizeof long=4
[2023-11-03 13:26:11,361 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2023-11-03 13:26:11,361 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * sizeof long double=12
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-03 13:26:11,362 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-03 13:26:11,363 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:26:11,363 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-03 13:26:11,363 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2023-11-03 13:26:11,364 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2023-11-03 13:26:11,364 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 -> 6e23a733a0ff6349360c2cce73db246c67b4c8edd8aa7941d4e8c63ac8efa03e
[2023-11-03 13:26:11,565 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-03 13:26:11,583 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-03 13:26:11,585 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-03 13:26:11,586 INFO  L271        PluginConnector]: Initializing CDTParser...
[2023-11-03 13:26:11,587 INFO  L275        PluginConnector]: CDTParser initialized
[2023-11-03 13:26:11,588 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial-race-3.i
[2023-11-03 13:26:13,145 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2023-11-03 13:26:13,386 INFO  L351              CDTParser]: Found 1 translation units.
[2023-11-03 13:26:13,386 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/thread-join-binomial-race-3.i
[2023-11-03 13:26:13,398 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/91b6cf08c/ba476352b4634b38910d0197d9e1fbe8/FLAG851451dad
[2023-11-03 13:26:13,695 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/91b6cf08c/ba476352b4634b38910d0197d9e1fbe8
[2023-11-03 13:26:13,697 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-03 13:26:13,698 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2023-11-03 13:26:13,699 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-03 13:26:13,699 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-03 13:26:13,702 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-03 13:26:13,703 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:26:13" (1/1) ...
[2023-11-03 13:26:13,704 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d516 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:13, skipping insertion in model container
[2023-11-03 13:26:13,704 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 01:26:13" (1/1) ...
[2023-11-03 13:26:13,710 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2023-11-03 13:26:13,752 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2023-11-03 13:26:13,876 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:26:14,088 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:26:14,096 INFO  L203         MainTranslator]: Completed pre-run
[2023-11-03 13:26:14,145 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2023-11-03 13:26:14,173 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2023-11-03 13:26:14,212 INFO  L208         MainTranslator]: Completed translation
[2023-11-03 13:26:14,213 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14 WrapperNode
[2023-11-03 13:26:14,213 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-03 13:26:14,214 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-03 13:26:14,214 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-03 13:26:14,214 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-03 13:26:14,254 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,272 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,291 INFO  L138                Inliner]: procedures = 268, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92
[2023-11-03 13:26:14,292 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-03 13:26:14,292 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-03 13:26:14,292 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-03 13:26:14,293 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2023-11-03 13:26:14,300 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,300 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,304 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,304 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,314 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,317 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,319 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,320 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,323 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-03 13:26:14,324 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-03 13:26:14,324 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2023-11-03 13:26:14,324 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2023-11-03 13:26:14,324 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (1/1) ...
[2023-11-03 13:26:14,365 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-03 13:26:14,447 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:26:14,465 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-03 13:26:14,468 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-03 13:26:14,513 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2023-11-03 13:26:14,514 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2023-11-03 13:26:14,515 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-03 13:26:14,515 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2023-11-03 13:26:14,515 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-03 13:26:14,515 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2023-11-03 13:26:14,515 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2023-11-03 13:26:14,515 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-03 13:26:14,516 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-03 13:26:14,517 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2023-11-03 13:26:14,644 INFO  L235             CfgBuilder]: Building ICFG
[2023-11-03 13:26:14,645 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-03 13:26:14,972 INFO  L276             CfgBuilder]: Performing block encoding
[2023-11-03 13:26:14,979 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-03 13:26:14,979 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2023-11-03 13:26:14,980 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:26:14 BoogieIcfgContainer
[2023-11-03 13:26:14,981 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-03 13:26:14,982 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-03 13:26:14,983 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2023-11-03 13:26:14,985 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2023-11-03 13:26:14,985 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 01:26:13" (1/3) ...
[2023-11-03 13:26:14,985 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733a1a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:26:14, skipping insertion in model container
[2023-11-03 13:26:14,986 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 01:26:14" (2/3) ...
[2023-11-03 13:26:14,986 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733a1a72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 01:26:14, skipping insertion in model container
[2023-11-03 13:26:14,986 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 01:26:14" (3/3) ...
[2023-11-03 13:26:14,987 INFO  L112   eAbstractionObserver]: Analyzing ICFG thread-join-binomial-race-3.i
[2023-11-03 13:26:14,993 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-11-03 13:26:15,001 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-03 13:26:15,001 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations.
[2023-11-03 13:26:15,001 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-03 13:26:15,119 INFO  L144    ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions.
[2023-11-03 13:26:15,148 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 185 places, 191 transitions, 396 flow
[2023-11-03 13:26:15,200 INFO  L130       PetriNetUnfolder]: 6/179 cut-off events.
[2023-11-03 13:26:15,200 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:26:15,205 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-11-03 13:26:15,206 INFO  L82        GeneralOperation]: Start removeDead. Operand has 185 places, 191 transitions, 396 flow
[2023-11-03 13:26:15,210 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 145 places, 147 transitions, 302 flow
[2023-11-03 13:26:15,213 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:26:15,222 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 147 transitions, 302 flow
[2023-11-03 13:26:15,224 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 147 transitions, 302 flow
[2023-11-03 13:26:15,225 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 145 places, 147 transitions, 302 flow
[2023-11-03 13:26:15,249 INFO  L130       PetriNetUnfolder]: 6/174 cut-off events.
[2023-11-03 13:26:15,249 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:26:15,250 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-11-03 13:26:15,252 INFO  L119        LiptonReduction]: Number of co-enabled transitions 2788
[2023-11-03 13:26:22,000 INFO  L134        LiptonReduction]: Checked pairs total: 13927
[2023-11-03 13:26:22,000 INFO  L136        LiptonReduction]: Total number of compositions: 146
[2023-11-03 13:26:22,014 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:26:22,020 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;@334cb16b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:26:22,020 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 19 error locations.
[2023-11-03 13:26:22,021 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 13:26:22,022 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:26:22,022 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:22,022 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 13:26:22,023 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-11-03 13:26:22,026 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:22,027 INFO  L85        PathProgramCache]: Analyzing trace with hash 567, now seen corresponding path program 1 times
[2023-11-03 13:26:22,033 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:22,033 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809730740]
[2023-11-03 13:26:22,034 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:22,034 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:22,096 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:22,111 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:22,111 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:22,111 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809730740]
[2023-11-03 13:26:22,112 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809730740] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:22,112 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:22,112 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 13:26:22,113 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351850560]
[2023-11-03 13:26:22,114 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:22,120 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:26:22,120 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:22,134 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:26:22,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:26:22,137 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 337
[2023-11-03 13:26:22,139 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-11-03 13:26:22,139 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:22,139 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 337
[2023-11-03 13:26:22,140 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:22,219 INFO  L130       PetriNetUnfolder]: 8/126 cut-off events.
[2023-11-03 13:26:22,220 INFO  L131       PetriNetUnfolder]: For 6/8 co-relation queries the response was YES.
[2023-11-03 13:26:22,220 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-11-03 13:26:22,221 INFO  L137   encePairwiseOnDemand]: 328/337 looper letters, 8 selfloop transitions, 0 changer transitions 1/39 dead transitions.
[2023-11-03 13:26:22,221 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 104 flow
[2023-11-03 13:26:22,223 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:26:22,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:26:22,236 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 380 transitions.
[2023-11-03 13:26:22,238 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5637982195845698
[2023-11-03 13:26:22,238 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 380 transitions.
[2023-11-03 13:26:22,239 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 380 transitions.
[2023-11-03 13:26:22,240 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:22,241 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 380 transitions.
[2023-11-03 13:26:22,244 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-11-03 13:26:22,249 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-11-03 13:26:22,249 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-11-03 13:26:22,251 INFO  L175             Difference]: Start difference. First operand has 51 places, 48 transitions, 104 flow. Second operand 2 states and 380 transitions.
[2023-11-03 13:26:22,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 104 flow
[2023-11-03 13:26:22,253 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:22,254 INFO  L231             Difference]: Finished difference. Result has 43 places, 38 transitions, 81 flow
[2023-11-03 13:26:22,256 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-11-03 13:26:22,259 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places.
[2023-11-03 13:26:22,259 INFO  L495      AbstractCegarLoop]: Abstraction has has 43 places, 38 transitions, 81 flow
[2023-11-03 13:26:22,259 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-11-03 13:26:22,260 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:22,260 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:22,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-03 13:26:22,260 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-11-03 13:26:22,261 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:22,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -350454187, now seen corresponding path program 1 times
[2023-11-03 13:26:22,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:22,261 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112916508]
[2023-11-03 13:26:22,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:22,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:22,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:22,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:22,579 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:22,579 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112916508]
[2023-11-03 13:26:22,579 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112916508] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:22,580 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:22,580 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:26:22,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245802080]
[2023-11-03 13:26:22,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:22,581 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:26:22,581 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:22,582 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:26:22,582 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:26:22,882 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 145 out of 337
[2023-11-03 13:26:22,884 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-11-03 13:26:22,884 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:22,884 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 337
[2023-11-03 13:26:22,884 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:23,008 INFO  L130       PetriNetUnfolder]: 77/323 cut-off events.
[2023-11-03 13:26:23,008 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2023-11-03 13:26:23,009 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-11-03 13:26:23,010 INFO  L137   encePairwiseOnDemand]: 326/337 looper letters, 20 selfloop transitions, 8 changer transitions 0/43 dead transitions.
[2023-11-03 13:26:23,011 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 43 transitions, 147 flow
[2023-11-03 13:26:23,011 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:26:23,012 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:26:23,015 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 901 transitions.
[2023-11-03 13:26:23,017 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4455984174085064
[2023-11-03 13:26:23,017 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 901 transitions.
[2023-11-03 13:26:23,017 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 901 transitions.
[2023-11-03 13:26:23,018 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:23,018 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 901 transitions.
[2023-11-03 13:26:23,020 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-11-03 13:26:23,024 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-11-03 13:26:23,025 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-11-03 13:26:23,025 INFO  L175             Difference]: Start difference. First operand has 43 places, 38 transitions, 81 flow. Second operand 6 states and 901 transitions.
[2023-11-03 13:26:23,025 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 43 transitions, 147 flow
[2023-11-03 13:26:23,026 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 147 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:23,027 INFO  L231             Difference]: Finished difference. Result has 48 places, 43 transitions, 137 flow
[2023-11-03 13:26:23,027 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-11-03 13:26:23,028 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places.
[2023-11-03 13:26:23,028 INFO  L495      AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 137 flow
[2023-11-03 13:26:23,029 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-11-03 13:26:23,029 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:23,029 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:23,029 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-03 13:26:23,029 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-11-03 13:26:23,029 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:23,030 INFO  L85        PathProgramCache]: Analyzing trace with hash 905724532, now seen corresponding path program 1 times
[2023-11-03 13:26:23,030 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:23,030 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459698425]
[2023-11-03 13:26:23,030 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:23,030 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:23,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:23,277 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:23,277 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:23,277 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459698425]
[2023-11-03 13:26:23,277 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459698425] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:23,278 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:23,278 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:26:23,278 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574305158]
[2023-11-03 13:26:23,278 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:23,278 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:26:23,278 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:23,279 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:26:23,279 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:26:23,661 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 337
[2023-11-03 13:26:23,664 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-11-03 13:26:23,664 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:23,664 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 337
[2023-11-03 13:26:23,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:24,085 INFO  L130       PetriNetUnfolder]: 18/116 cut-off events.
[2023-11-03 13:26:24,085 INFO  L131       PetriNetUnfolder]: For 4/4 co-relation queries the response was YES.
[2023-11-03 13:26:24,086 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-11-03 13:26:24,087 INFO  L137   encePairwiseOnDemand]: 332/337 looper letters, 14 selfloop transitions, 4 changer transitions 8/50 dead transitions.
[2023-11-03 13:26:24,087 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 50 transitions, 197 flow
[2023-11-03 13:26:24,088 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:26:24,088 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:26:24,091 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1030 transitions.
[2023-11-03 13:26:24,092 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5093966369930761
[2023-11-03 13:26:24,092 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1030 transitions.
[2023-11-03 13:26:24,092 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1030 transitions.
[2023-11-03 13:26:24,093 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:24,093 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1030 transitions.
[2023-11-03 13:26:24,096 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-11-03 13:26:24,100 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-11-03 13:26:24,101 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-11-03 13:26:24,101 INFO  L175             Difference]: Start difference. First operand has 48 places, 43 transitions, 137 flow. Second operand 6 states and 1030 transitions.
[2023-11-03 13:26:24,101 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 50 transitions, 197 flow
[2023-11-03 13:26:24,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:24,103 INFO  L231             Difference]: Finished difference. Result has 52 places, 38 transitions, 120 flow
[2023-11-03 13:26:24,103 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-11-03 13:26:24,104 INFO  L288   CegarLoopForPetriNet]: 51 programPoint places, 1 predicate places.
[2023-11-03 13:26:24,104 INFO  L495      AbstractCegarLoop]: Abstraction has has 52 places, 38 transitions, 120 flow
[2023-11-03 13:26:24,105 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-11-03 13:26:24,105 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:24,105 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:26:24,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-03 13:26:24,105 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-11-03 13:26:24,105 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:24,105 INFO  L85        PathProgramCache]: Analyzing trace with hash 1477162438, now seen corresponding path program 1 times
[2023-11-03 13:26:24,106 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:24,106 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934697140]
[2023-11-03 13:26:24,106 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:24,106 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:24,133 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:26:24,133 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:26:24,146 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:26:24,167 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:26:24,167 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:26:24,168 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining)
[2023-11-03 13:26:24,169 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining)
[2023-11-03 13:26:24,169 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining)
[2023-11-03 13:26:24,170 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining)
[2023-11-03 13:26:24,171 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining)
[2023-11-03 13:26:24,172 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining)
[2023-11-03 13:26:24,172 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining)
[2023-11-03 13:26:24,172 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-03 13:26:24,172 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2023-11-03 13:26:24,174 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:26:24,174 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2023-11-03 13:26:24,212 INFO  L144    ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions.
[2023-11-03 13:26:24,215 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 231 places, 243 transitions, 522 flow
[2023-11-03 13:26:24,279 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2023-11-03 13:26:24,279 INFO  L131       PetriNetUnfolder]: For 20/22 co-relation queries the response was YES.
[2023-11-03 13:26:24,282 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-11-03 13:26:24,282 INFO  L82        GeneralOperation]: Start removeDead. Operand has 231 places, 243 transitions, 522 flow
[2023-11-03 13:26:24,285 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 201 places, 207 transitions, 438 flow
[2023-11-03 13:26:24,285 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:26:24,285 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 201 places, 207 transitions, 438 flow
[2023-11-03 13:26:24,286 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 201 places, 207 transitions, 438 flow
[2023-11-03 13:26:24,286 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 201 places, 207 transitions, 438 flow
[2023-11-03 13:26:24,375 INFO  L130       PetriNetUnfolder]: 34/593 cut-off events.
[2023-11-03 13:26:24,375 INFO  L131       PetriNetUnfolder]: For 20/20 co-relation queries the response was YES.
[2023-11-03 13:26:24,377 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-11-03 13:26:24,390 INFO  L119        LiptonReduction]: Number of co-enabled transitions 14222
[2023-11-03 13:26:29,018 INFO  L134        LiptonReduction]: Checked pairs total: 90933
[2023-11-03 13:26:29,018 INFO  L136        LiptonReduction]: Total number of compositions: 148
[2023-11-03 13:26:29,021 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:26:29,022 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;@334cb16b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:26:29,023 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 23 error locations.
[2023-11-03 13:26:29,024 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 13:26:29,024 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:26:29,024 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:29,024 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 13:26:29,025 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-11-03 13:26:29,025 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:29,025 INFO  L85        PathProgramCache]: Analyzing trace with hash 968, now seen corresponding path program 1 times
[2023-11-03 13:26:29,025 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:29,026 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008767288]
[2023-11-03 13:26:29,026 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:29,026 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:29,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:29,031 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:29,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:29,032 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008767288]
[2023-11-03 13:26:29,032 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008767288] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:29,032 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:29,032 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 13:26:29,032 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049632561]
[2023-11-03 13:26:29,032 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:29,032 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:26:29,032 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:29,033 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:26:29,033 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:26:29,033 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 391
[2023-11-03 13:26:29,034 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-11-03 13:26:29,034 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:29,034 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 391
[2023-11-03 13:26:29,034 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:29,359 INFO  L130       PetriNetUnfolder]: 980/2946 cut-off events.
[2023-11-03 13:26:29,359 INFO  L131       PetriNetUnfolder]: For 154/202 co-relation queries the response was YES.
[2023-11-03 13:26:29,363 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-11-03 13:26:29,373 INFO  L137   encePairwiseOnDemand]: 386/391 looper letters, 34 selfloop transitions, 0 changer transitions 0/92 dead transitions.
[2023-11-03 13:26:29,373 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 92 transitions, 276 flow
[2023-11-03 13:26:29,376 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:26:29,376 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:26:29,377 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 489 transitions.
[2023-11-03 13:26:29,377 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6253196930946292
[2023-11-03 13:26:29,378 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 489 transitions.
[2023-11-03 13:26:29,378 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 489 transitions.
[2023-11-03 13:26:29,378 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:29,378 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 489 transitions.
[2023-11-03 13:26:29,379 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-11-03 13:26:29,381 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-11-03 13:26:29,381 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-11-03 13:26:29,381 INFO  L175             Difference]: Start difference. First operand has 97 places, 97 transitions, 218 flow. Second operand 2 states and 489 transitions.
[2023-11-03 13:26:29,381 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 92 transitions, 276 flow
[2023-11-03 13:26:29,382 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 92 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:29,384 INFO  L231             Difference]: Finished difference. Result has 93 places, 92 transitions, 208 flow
[2023-11-03 13:26:29,384 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-11-03 13:26:29,385 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, -4 predicate places.
[2023-11-03 13:26:29,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 93 places, 92 transitions, 208 flow
[2023-11-03 13:26:29,386 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-11-03 13:26:29,386 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:29,386 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:29,386 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-03 13:26:29,387 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-11-03 13:26:29,387 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:29,387 INFO  L85        PathProgramCache]: Analyzing trace with hash -1080939081, now seen corresponding path program 1 times
[2023-11-03 13:26:29,387 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:29,387 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396375309]
[2023-11-03 13:26:29,388 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:29,388 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:29,399 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:29,576 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:29,576 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:29,576 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396375309]
[2023-11-03 13:26:29,576 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396375309] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:29,577 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:29,577 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:26:29,577 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315794651]
[2023-11-03 13:26:29,577 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:29,577 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:26:29,577 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:29,577 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:26:29,578 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:26:29,922 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 183 out of 391
[2023-11-03 13:26:29,924 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-11-03 13:26:29,924 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:29,924 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 391
[2023-11-03 13:26:29,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:30,882 INFO  L130       PetriNetUnfolder]: 5355/11139 cut-off events.
[2023-11-03 13:26:30,882 INFO  L131       PetriNetUnfolder]: For 286/364 co-relation queries the response was YES.
[2023-11-03 13:26:30,893 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-11-03 13:26:30,929 INFO  L137   encePairwiseOnDemand]: 378/391 looper letters, 54 selfloop transitions, 8 changer transitions 0/95 dead transitions.
[2023-11-03 13:26:30,930 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 338 flow
[2023-11-03 13:26:30,930 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:26:30,930 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:26:30,932 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1165 transitions.
[2023-11-03 13:26:30,933 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.49658994032395565
[2023-11-03 13:26:30,933 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1165 transitions.
[2023-11-03 13:26:30,933 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1165 transitions.
[2023-11-03 13:26:30,933 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:30,934 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1165 transitions.
[2023-11-03 13:26:30,936 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-11-03 13:26:30,939 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-11-03 13:26:30,940 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-11-03 13:26:30,940 INFO  L175             Difference]: Start difference. First operand has 93 places, 92 transitions, 208 flow. Second operand 6 states and 1165 transitions.
[2023-11-03 13:26:30,940 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 338 flow
[2023-11-03 13:26:30,941 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:30,943 INFO  L231             Difference]: Finished difference. Result has 97 places, 95 transitions, 260 flow
[2023-11-03 13:26:30,943 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-11-03 13:26:30,943 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 0 predicate places.
[2023-11-03 13:26:30,943 INFO  L495      AbstractCegarLoop]: Abstraction has has 97 places, 95 transitions, 260 flow
[2023-11-03 13:26:30,944 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-11-03 13:26:30,944 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:30,944 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:30,944 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-03 13:26:30,944 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-11-03 13:26:30,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:30,945 INFO  L85        PathProgramCache]: Analyzing trace with hash 597553700, now seen corresponding path program 1 times
[2023-11-03 13:26:30,945 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:30,945 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550679817]
[2023-11-03 13:26:30,945 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:30,945 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:30,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:31,107 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:31,107 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:31,107 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550679817]
[2023-11-03 13:26:31,107 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550679817] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:31,108 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:31,108 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:26:31,108 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269539571]
[2023-11-03 13:26:31,108 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:31,108 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:26:31,108 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:31,108 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:26:31,108 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:26:31,693 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 391
[2023-11-03 13:26:31,695 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-11-03 13:26:31,695 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:31,695 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 391
[2023-11-03 13:26:31,695 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:32,652 INFO  L130       PetriNetUnfolder]: 1969/4372 cut-off events.
[2023-11-03 13:26:32,652 INFO  L131       PetriNetUnfolder]: For 309/396 co-relation queries the response was YES.
[2023-11-03 13:26:32,658 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-11-03 13:26:32,668 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 120 selfloop transitions, 5 changer transitions 4/178 dead transitions.
[2023-11-03 13:26:32,668 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 178 transitions, 702 flow
[2023-11-03 13:26:32,671 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:26:32,671 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:26:32,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1397 transitions.
[2023-11-03 13:26:32,673 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5954816709292413
[2023-11-03 13:26:32,673 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1397 transitions.
[2023-11-03 13:26:32,673 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1397 transitions.
[2023-11-03 13:26:32,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:32,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1397 transitions.
[2023-11-03 13:26:32,677 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-11-03 13:26:32,681 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-11-03 13:26:32,683 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-11-03 13:26:32,683 INFO  L175             Difference]: Start difference. First operand has 97 places, 95 transitions, 260 flow. Second operand 6 states and 1397 transitions.
[2023-11-03 13:26:32,683 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 178 transitions, 702 flow
[2023-11-03 13:26:32,686 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 178 transitions, 702 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:32,688 INFO  L231             Difference]: Finished difference. Result has 101 places, 90 transitions, 245 flow
[2023-11-03 13:26:32,688 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-11-03 13:26:32,689 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-11-03 13:26:32,689 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 90 transitions, 245 flow
[2023-11-03 13:26:32,689 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-11-03 13:26:32,689 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:32,689 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:32,690 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-03 13:26:32,690 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-11-03 13:26:32,690 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:32,690 INFO  L85        PathProgramCache]: Analyzing trace with hash 419820616, now seen corresponding path program 1 times
[2023-11-03 13:26:32,690 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:32,690 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853787225]
[2023-11-03 13:26:32,690 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:32,690 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:32,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:32,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:32,715 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:32,715 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853787225]
[2023-11-03 13:26:32,715 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853787225] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:32,715 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:32,715 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:26:32,716 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733819457]
[2023-11-03 13:26:32,716 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:32,716 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:26:32,716 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:32,716 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:26:32,716 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:26:32,730 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 391
[2023-11-03 13:26:32,731 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-11-03 13:26:32,731 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:32,731 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 391
[2023-11-03 13:26:32,731 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:33,153 INFO  L130       PetriNetUnfolder]: 1257/3440 cut-off events.
[2023-11-03 13:26:33,153 INFO  L131       PetriNetUnfolder]: For 324/391 co-relation queries the response was YES.
[2023-11-03 13:26:33,158 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-11-03 13:26:33,165 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 54 selfloop transitions, 5 changer transitions 0/112 dead transitions.
[2023-11-03 13:26:33,166 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 112 transitions, 419 flow
[2023-11-03 13:26:33,166 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:26:33,166 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:26:33,167 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions.
[2023-11-03 13:26:33,168 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6078431372549019
[2023-11-03 13:26:33,168 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 713 transitions.
[2023-11-03 13:26:33,168 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 713 transitions.
[2023-11-03 13:26:33,168 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:33,168 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 713 transitions.
[2023-11-03 13:26:33,170 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-11-03 13:26:33,171 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-11-03 13:26:33,171 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-11-03 13:26:33,171 INFO  L175             Difference]: Start difference. First operand has 101 places, 90 transitions, 245 flow. Second operand 3 states and 713 transitions.
[2023-11-03 13:26:33,172 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 112 transitions, 419 flow
[2023-11-03 13:26:33,174 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 112 transitions, 403 flow, removed 3 selfloop flow, removed 5 redundant places.
[2023-11-03 13:26:33,175 INFO  L231             Difference]: Finished difference. Result has 100 places, 94 transitions, 267 flow
[2023-11-03 13:26:33,175 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-11-03 13:26:33,176 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 3 predicate places.
[2023-11-03 13:26:33,176 INFO  L495      AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 267 flow
[2023-11-03 13:26:33,177 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-11-03 13:26:33,177 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:33,177 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:33,177 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-03 13:26:33,177 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-11-03 13:26:33,177 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:33,177 INFO  L85        PathProgramCache]: Analyzing trace with hash -63257529, now seen corresponding path program 1 times
[2023-11-03 13:26:33,177 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:33,177 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437241843]
[2023-11-03 13:26:33,177 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:33,178 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:33,200 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-11-03 13:26:33,201 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2001589292]
[2023-11-03 13:26:33,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:33,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:26:33,201 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:26:33,203 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:26:33,206 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2023-11-03 13:26:33,344 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:33,348 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-03 13:26:33,350 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:26:33,364 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:33,364 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:26:33,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:33,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437241843]
[2023-11-03 13:26:33,365 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-11-03 13:26:33,365 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001589292]
[2023-11-03 13:26:33,365 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001589292] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:33,365 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:33,365 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:26:33,365 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641734849]
[2023-11-03 13:26:33,366 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:33,366 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:26:33,366 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:33,366 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:26:33,366 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:26:33,396 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 206 out of 391
[2023-11-03 13:26:33,397 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-11-03 13:26:33,397 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:33,397 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 391
[2023-11-03 13:26:33,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:33,701 INFO  L130       PetriNetUnfolder]: 1323/3542 cut-off events.
[2023-11-03 13:26:33,701 INFO  L131       PetriNetUnfolder]: For 731/898 co-relation queries the response was YES.
[2023-11-03 13:26:33,706 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-11-03 13:26:33,713 INFO  L137   encePairwiseOnDemand]: 388/391 looper letters, 40 selfloop transitions, 1 changer transitions 0/92 dead transitions.
[2023-11-03 13:26:33,714 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 345 flow
[2023-11-03 13:26:33,714 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:26:33,714 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:26:33,715 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions.
[2023-11-03 13:26:33,716 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5592497868712702
[2023-11-03 13:26:33,716 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 656 transitions.
[2023-11-03 13:26:33,716 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions.
[2023-11-03 13:26:33,716 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:33,716 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions.
[2023-11-03 13:26:33,717 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-11-03 13:26:33,718 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-11-03 13:26:33,719 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-11-03 13:26:33,719 INFO  L175             Difference]: Start difference. First operand has 100 places, 94 transitions, 267 flow. Second operand 3 states and 656 transitions.
[2023-11-03 13:26:33,719 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 345 flow
[2023-11-03 13:26:33,721 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-03 13:26:33,722 INFO  L231             Difference]: Finished difference. Result has 98 places, 92 transitions, 255 flow
[2023-11-03 13:26:33,722 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-11-03 13:26:33,722 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 1 predicate places.
[2023-11-03 13:26:33,722 INFO  L495      AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 255 flow
[2023-11-03 13:26:33,723 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-11-03 13:26:33,723 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:33,723 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:33,736 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-11-03 13:26:33,923 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-11-03 13:26:33,924 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-11-03 13:26:33,924 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:33,925 INFO  L85        PathProgramCache]: Analyzing trace with hash -903058524, now seen corresponding path program 1 times
[2023-11-03 13:26:33,925 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:33,925 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403894337]
[2023-11-03 13:26:33,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:33,926 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:33,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:33,963 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:26:33,963 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:33,963 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403894337]
[2023-11-03 13:26:33,963 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403894337] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:33,963 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:33,964 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:26:33,964 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490773705]
[2023-11-03 13:26:33,964 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:33,964 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:26:33,965 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:33,965 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:26:33,965 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:26:33,980 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 218 out of 391
[2023-11-03 13:26:33,981 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-11-03 13:26:33,981 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:33,981 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 391
[2023-11-03 13:26:33,981 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:34,440 INFO  L130       PetriNetUnfolder]: 1367/3769 cut-off events.
[2023-11-03 13:26:34,441 INFO  L131       PetriNetUnfolder]: For 541/642 co-relation queries the response was YES.
[2023-11-03 13:26:34,448 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-11-03 13:26:34,459 INFO  L137   encePairwiseOnDemand]: 385/391 looper letters, 58 selfloop transitions, 6 changer transitions 0/115 dead transitions.
[2023-11-03 13:26:34,459 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 115 transitions, 448 flow
[2023-11-03 13:26:34,460 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:26:34,460 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:26:34,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions.
[2023-11-03 13:26:34,462 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6069906223358909
[2023-11-03 13:26:34,462 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 712 transitions.
[2023-11-03 13:26:34,462 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 712 transitions.
[2023-11-03 13:26:34,462 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:34,462 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 712 transitions.
[2023-11-03 13:26:34,464 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-11-03 13:26:34,466 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-11-03 13:26:34,466 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-11-03 13:26:34,467 INFO  L175             Difference]: Start difference. First operand has 98 places, 92 transitions, 255 flow. Second operand 3 states and 712 transitions.
[2023-11-03 13:26:34,467 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 115 transitions, 448 flow
[2023-11-03 13:26:34,468 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 115 transitions, 447 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:26:34,470 INFO  L231             Difference]: Finished difference. Result has 101 places, 96 transitions, 300 flow
[2023-11-03 13:26:34,470 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-11-03 13:26:34,470 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-11-03 13:26:34,471 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 300 flow
[2023-11-03 13:26:34,471 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-11-03 13:26:34,471 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:34,471 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:34,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-03 13:26:34,471 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-11-03 13:26:34,471 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:34,472 INFO  L85        PathProgramCache]: Analyzing trace with hash -284586499, now seen corresponding path program 1 times
[2023-11-03 13:26:34,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:34,472 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096549038]
[2023-11-03 13:26:34,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:34,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:34,488 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:34,550 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:34,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:34,550 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096549038]
[2023-11-03 13:26:34,551 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096549038] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:34,551 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:34,551 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:26:34,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431419184]
[2023-11-03 13:26:34,551 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:34,551 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:26:34,552 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:34,552 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:26:34,552 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:26:34,571 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 391
[2023-11-03 13:26:34,572 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-11-03 13:26:34,572 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:34,572 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 391
[2023-11-03 13:26:34,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:34,990 INFO  L130       PetriNetUnfolder]: 842/2819 cut-off events.
[2023-11-03 13:26:34,990 INFO  L131       PetriNetUnfolder]: For 501/752 co-relation queries the response was YES.
[2023-11-03 13:26:34,995 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-11-03 13:26:35,001 INFO  L137   encePairwiseOnDemand]: 387/391 looper letters, 56 selfloop transitions, 6 changer transitions 0/115 dead transitions.
[2023-11-03 13:26:35,002 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 115 transitions, 469 flow
[2023-11-03 13:26:35,003 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:26:35,003 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:26:35,004 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions.
[2023-11-03 13:26:35,004 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6112531969309463
[2023-11-03 13:26:35,004 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 717 transitions.
[2023-11-03 13:26:35,004 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 717 transitions.
[2023-11-03 13:26:35,004 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:35,004 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 717 transitions.
[2023-11-03 13:26:35,006 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-11-03 13:26:35,007 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-11-03 13:26:35,007 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-11-03 13:26:35,007 INFO  L175             Difference]: Start difference. First operand has 101 places, 96 transitions, 300 flow. Second operand 3 states and 717 transitions.
[2023-11-03 13:26:35,007 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 115 transitions, 469 flow
[2023-11-03 13:26:35,010 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 115 transitions, 459 flow, removed 1 selfloop flow, removed 2 redundant places.
[2023-11-03 13:26:35,011 INFO  L231             Difference]: Finished difference. Result has 101 places, 94 transitions, 286 flow
[2023-11-03 13:26:35,012 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-11-03 13:26:35,012 INFO  L288   CegarLoopForPetriNet]: 97 programPoint places, 4 predicate places.
[2023-11-03 13:26:35,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 101 places, 94 transitions, 286 flow
[2023-11-03 13:26:35,013 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-11-03 13:26:35,013 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:35,013 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1]
[2023-11-03 13:26:35,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-03 13:26:35,013 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-11-03 13:26:35,013 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:35,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 966542179, now seen corresponding path program 1 times
[2023-11-03 13:26:35,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:35,013 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882462084]
[2023-11-03 13:26:35,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:35,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:35,034 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:26:35,034 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:26:35,043 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:26:35,050 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:26:35,050 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining)
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining)
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining)
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining)
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining)
[2023-11-03 13:26:35,050 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining)
[2023-11-03 13:26:35,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining)
[2023-11-03 13:26:35,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining)
[2023-11-03 13:26:35,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-03 13:26:35,052 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:35,053 WARN  L233   ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:26:35,053 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances.
[2023-11-03 13:26:35,093 INFO  L144    ThreadInstanceAdder]: Constructed 15 joinOtherThreadTransitions.
[2023-11-03 13:26:35,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 277 places, 297 transitions, 660 flow
[2023-11-03 13:26:35,287 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-11-03 13:26:35,287 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:26:35,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:26:35,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:26:35,287 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:26:35,329 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-11-03 13:26:35,330 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:26:35,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:26:35,330 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,330 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-11-03 13:26:35,330 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:26:35,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,331 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:26:35,361 INFO  L130       PetriNetUnfolder]: 194/1950 cut-off events.
[2023-11-03 13:26:35,362 INFO  L131       PetriNetUnfolder]: For 164/180 co-relation queries the response was YES.
[2023-11-03 13:26:35,372 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-11-03 13:26:35,372 INFO  L82        GeneralOperation]: Start removeDead. Operand has 277 places, 297 transitions, 660 flow
[2023-11-03 13:26:35,380 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 247 places, 259 transitions, 566 flow
[2023-11-03 13:26:35,381 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:26:35,381 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 247 places, 259 transitions, 566 flow
[2023-11-03 13:26:35,381 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 247 places, 259 transitions, 566 flow
[2023-11-03 13:26:35,381 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 247 places, 259 transitions, 566 flow
[2023-11-03 13:26:35,553 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-11-03 13:26:35,553 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:26:35,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:26:35,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:26:35,554 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:26:35,592 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-11-03 13:26:35,592 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:26:35,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:26:35,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,592 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-11-03 13:26:35,592 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:26:35,592 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:26:35,593 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:26:35,620 INFO  L130       PetriNetUnfolder]: 194/1950 cut-off events.
[2023-11-03 13:26:35,620 INFO  L131       PetriNetUnfolder]: For 164/164 co-relation queries the response was YES.
[2023-11-03 13:26:35,635 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-11-03 13:26:35,682 INFO  L119        LiptonReduction]: Number of co-enabled transitions 29334
[2023-11-03 13:26:41,062 INFO  L134        LiptonReduction]: Checked pairs total: 198761
[2023-11-03 13:26:41,063 INFO  L136        LiptonReduction]: Total number of compositions: 170
[2023-11-03 13:26:41,065 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:26:41,066 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;@334cb16b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:26:41,066 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 27 error locations.
[2023-11-03 13:26:41,066 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 13:26:41,067 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:26:41,067 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:41,067 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 13:26:41,067 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-11-03 13:26:41,067 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:41,067 INFO  L85        PathProgramCache]: Analyzing trace with hash 1455, now seen corresponding path program 1 times
[2023-11-03 13:26:41,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:41,068 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534761945]
[2023-11-03 13:26:41,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:41,068 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:41,071 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:41,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:41,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:41,072 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534761945]
[2023-11-03 13:26:41,073 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534761945] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:41,073 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:41,073 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 13:26:41,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630279272]
[2023-11-03 13:26:41,073 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:41,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:26:41,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:41,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:26:41,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:26:41,074 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 269 out of 467
[2023-11-03 13:26:41,074 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-11-03 13:26:41,074 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:41,074 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 467
[2023-11-03 13:26:41,074 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:26:44,248 INFO  L130       PetriNetUnfolder]: 18642/41700 cut-off events.
[2023-11-03 13:26:44,248 INFO  L131       PetriNetUnfolder]: For 3712/5967 co-relation queries the response was YES.
[2023-11-03 13:26:44,313 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-11-03 13:26:44,470 INFO  L137   encePairwiseOnDemand]: 462/467 looper letters, 50 selfloop transitions, 0 changer transitions 0/127 dead transitions.
[2023-11-03 13:26:44,470 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 402 flow
[2023-11-03 13:26:44,471 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:26:44,471 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:26:44,472 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 593 transitions.
[2023-11-03 13:26:44,472 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6349036402569593
[2023-11-03 13:26:44,472 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 593 transitions.
[2023-11-03 13:26:44,472 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 593 transitions.
[2023-11-03 13:26:44,473 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:26:44,473 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 593 transitions.
[2023-11-03 13:26:44,474 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-11-03 13:26:44,475 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-11-03 13:26:44,475 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-11-03 13:26:44,475 INFO  L175             Difference]: Start difference. First operand has 128 places, 132 transitions, 312 flow. Second operand 2 states and 593 transitions.
[2023-11-03 13:26:44,475 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 127 transitions, 402 flow
[2023-11-03 13:26:44,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 127 transitions, 402 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:26:44,479 INFO  L231             Difference]: Finished difference. Result has 124 places, 127 transitions, 302 flow
[2023-11-03 13:26:44,479 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-11-03 13:26:44,480 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -4 predicate places.
[2023-11-03 13:26:44,480 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 302 flow
[2023-11-03 13:26:44,480 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-11-03 13:26:44,480 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:26:44,480 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:26:44,480 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-03 13:26:44,480 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-11-03 13:26:44,481 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:26:44,481 INFO  L85        PathProgramCache]: Analyzing trace with hash 394491682, now seen corresponding path program 1 times
[2023-11-03 13:26:44,481 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:26:44,481 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594078793]
[2023-11-03 13:26:44,481 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:26:44,481 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:26:44,490 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:26:44,605 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:26:44,605 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:26:44,605 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594078793]
[2023-11-03 13:26:44,605 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594078793] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:26:44,606 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:26:44,606 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:26:44,606 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794313949]
[2023-11-03 13:26:44,606 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:26:44,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:26:44,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:26:44,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:26:44,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:26:45,188 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 221 out of 467
[2023-11-03 13:26:45,190 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-11-03 13:26:45,190 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:26:45,190 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 467
[2023-11-03 13:26:45,190 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:01,662 INFO  L130       PetriNetUnfolder]: 137604/235791 cut-off events.
[2023-11-03 13:27:01,663 INFO  L131       PetriNetUnfolder]: For 8827/10783 co-relation queries the response was YES.
[2023-11-03 13:27:02,079 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-11-03 13:27:02,939 INFO  L137   encePairwiseOnDemand]: 453/467 looper letters, 75 selfloop transitions, 8 changer transitions 0/129 dead transitions.
[2023-11-03 13:27:02,939 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 129 transitions, 472 flow
[2023-11-03 13:27:02,940 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:27:02,940 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:27:02,942 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1415 transitions.
[2023-11-03 13:27:02,943 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5049964311206281
[2023-11-03 13:27:02,943 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1415 transitions.
[2023-11-03 13:27:02,943 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1415 transitions.
[2023-11-03 13:27:02,944 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:02,944 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1415 transitions.
[2023-11-03 13:27:02,946 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-11-03 13:27:02,948 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-11-03 13:27:02,949 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-11-03 13:27:02,949 INFO  L175             Difference]: Start difference. First operand has 124 places, 127 transitions, 302 flow. Second operand 6 states and 1415 transitions.
[2023-11-03 13:27:02,949 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 129 transitions, 472 flow
[2023-11-03 13:27:02,958 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 129 transitions, 472 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:27:02,959 INFO  L231             Difference]: Finished difference. Result has 127 places, 129 transitions, 352 flow
[2023-11-03 13:27:02,960 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-11-03 13:27:02,960 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2023-11-03 13:27:02,960 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 129 transitions, 352 flow
[2023-11-03 13:27:02,961 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-11-03 13:27:02,961 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:02,961 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:02,961 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-03 13:27:02,961 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-11-03 13:27:02,961 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:02,961 INFO  L85        PathProgramCache]: Analyzing trace with hash 2033105086, now seen corresponding path program 1 times
[2023-11-03 13:27:02,961 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:02,962 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329728209]
[2023-11-03 13:27:02,962 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:02,962 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:02,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:03,117 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:27:03,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:03,118 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329728209]
[2023-11-03 13:27:03,118 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329728209] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:03,118 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:03,118 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:27:03,119 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579829559]
[2023-11-03 13:27:03,119 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:03,119 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:27:03,119 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:03,120 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:27:03,120 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:27:03,772 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 467
[2023-11-03 13:27:03,773 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-11-03 13:27:03,773 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:03,774 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 467
[2023-11-03 13:27:03,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:09,116 INFO  L130       PetriNetUnfolder]: 35492/63537 cut-off events.
[2023-11-03 13:27:09,116 INFO  L131       PetriNetUnfolder]: For 6202/10100 co-relation queries the response was YES.
[2023-11-03 13:27:09,314 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-11-03 13:27:09,521 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 192 selfloop transitions, 5 changer transitions 4/268 dead transitions.
[2023-11-03 13:27:09,521 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 268 transitions, 1098 flow
[2023-11-03 13:27:09,522 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:27:09,522 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:27:09,524 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1733 transitions.
[2023-11-03 13:27:09,525 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6184867951463241
[2023-11-03 13:27:09,525 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1733 transitions.
[2023-11-03 13:27:09,525 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1733 transitions.
[2023-11-03 13:27:09,526 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:09,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1733 transitions.
[2023-11-03 13:27:09,529 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-11-03 13:27:09,531 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-11-03 13:27:09,532 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-11-03 13:27:09,532 INFO  L175             Difference]: Start difference. First operand has 127 places, 129 transitions, 352 flow. Second operand 6 states and 1733 transitions.
[2023-11-03 13:27:09,532 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 268 transitions, 1098 flow
[2023-11-03 13:27:09,539 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 268 transitions, 1098 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:27:09,541 INFO  L231             Difference]: Finished difference. Result has 131 places, 124 transitions, 337 flow
[2023-11-03 13:27:09,541 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-11-03 13:27:09,542 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 3 predicate places.
[2023-11-03 13:27:09,542 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 124 transitions, 337 flow
[2023-11-03 13:27:09,543 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-11-03 13:27:09,543 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:09,543 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:09,543 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-11-03 13:27:09,543 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-11-03 13:27:09,543 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:09,543 INFO  L85        PathProgramCache]: Analyzing trace with hash -328208307, now seen corresponding path program 1 times
[2023-11-03 13:27:09,543 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:09,543 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291887095]
[2023-11-03 13:27:09,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:09,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:09,554 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:09,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:27:09,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:09,568 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291887095]
[2023-11-03 13:27:09,568 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291887095] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:09,568 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:09,568 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:27:09,568 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953458315]
[2023-11-03 13:27:09,568 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:09,569 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:09,569 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:09,569 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:09,569 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:09,587 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-11-03 13:27:09,588 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-11-03 13:27:09,588 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:09,588 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-11-03 13:27:09,588 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:13,344 INFO  L130       PetriNetUnfolder]: 23636/50202 cut-off events.
[2023-11-03 13:27:13,344 INFO  L131       PetriNetUnfolder]: For 5807/9277 co-relation queries the response was YES.
[2023-11-03 13:27:13,529 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-11-03 13:27:13,707 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 83 selfloop transitions, 5 changer transitions 0/159 dead transitions.
[2023-11-03 13:27:13,708 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 159 transitions, 611 flow
[2023-11-03 13:27:13,709 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:27:13,709 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:27:13,710 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 871 transitions.
[2023-11-03 13:27:13,710 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6216987865810135
[2023-11-03 13:27:13,710 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 871 transitions.
[2023-11-03 13:27:13,710 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 871 transitions.
[2023-11-03 13:27:13,710 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:13,710 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 871 transitions.
[2023-11-03 13:27:13,712 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-11-03 13:27:13,713 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-11-03 13:27:13,713 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-11-03 13:27:13,713 INFO  L175             Difference]: Start difference. First operand has 131 places, 124 transitions, 337 flow. Second operand 3 states and 871 transitions.
[2023-11-03 13:27:13,713 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 159 transitions, 611 flow
[2023-11-03 13:27:13,726 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 159 transitions, 595 flow, removed 3 selfloop flow, removed 5 redundant places.
[2023-11-03 13:27:13,727 INFO  L231             Difference]: Finished difference. Result has 129 places, 128 transitions, 354 flow
[2023-11-03 13:27:13,727 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-11-03 13:27:13,728 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 1 predicate places.
[2023-11-03 13:27:13,728 INFO  L495      AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 354 flow
[2023-11-03 13:27:13,728 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-11-03 13:27:13,728 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:13,728 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:13,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-11-03 13:27:13,728 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-11-03 13:27:13,728 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:13,728 INFO  L85        PathProgramCache]: Analyzing trace with hash 1992771771, now seen corresponding path program 1 times
[2023-11-03 13:27:13,729 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:13,729 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417464647]
[2023-11-03 13:27:13,729 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:13,729 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:13,740 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-11-03 13:27:13,740 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [672325709]
[2023-11-03 13:27:13,740 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:13,740 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:27:13,740 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:27:13,742 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:27:13,744 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-11-03 13:27:13,898 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:13,899 INFO  L263         TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 3 conjunts are in the unsatisfiable core
[2023-11-03 13:27:13,900 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:27:13,908 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:27:13,908 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:27:13,908 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:13,908 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417464647]
[2023-11-03 13:27:13,908 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-11-03 13:27:13,908 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672325709]
[2023-11-03 13:27:13,908 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [672325709] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:13,909 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:13,909 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:27:13,909 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535264620]
[2023-11-03 13:27:13,909 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:13,909 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:13,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:13,910 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:13,910 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:13,941 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 247 out of 467
[2023-11-03 13:27:13,942 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-11-03 13:27:13,942 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:13,942 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 247 of 467
[2023-11-03 13:27:13,942 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:18,182 INFO  L130       PetriNetUnfolder]: 26090/54005 cut-off events.
[2023-11-03 13:27:18,182 INFO  L131       PetriNetUnfolder]: For 9973/13484 co-relation queries the response was YES.
[2023-11-03 13:27:18,299 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-11-03 13:27:18,468 INFO  L137   encePairwiseOnDemand]: 463/467 looper letters, 55 selfloop transitions, 1 changer transitions 0/125 dead transitions.
[2023-11-03 13:27:18,468 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 125 transitions, 460 flow
[2023-11-03 13:27:18,469 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:27:18,469 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:27:18,470 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 796 transitions.
[2023-11-03 13:27:18,470 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5681655960028551
[2023-11-03 13:27:18,470 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 796 transitions.
[2023-11-03 13:27:18,470 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 796 transitions.
[2023-11-03 13:27:18,471 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:18,471 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 796 transitions.
[2023-11-03 13:27:18,472 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-11-03 13:27:18,473 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-11-03 13:27:18,473 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-11-03 13:27:18,473 INFO  L175             Difference]: Start difference. First operand has 129 places, 128 transitions, 354 flow. Second operand 3 states and 796 transitions.
[2023-11-03 13:27:18,474 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 125 transitions, 460 flow
[2023-11-03 13:27:18,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 455 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:27:18,512 INFO  L231             Difference]: Finished difference. Result has 127 places, 125 transitions, 345 flow
[2023-11-03 13:27:18,512 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-11-03 13:27:18,513 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, -1 predicate places.
[2023-11-03 13:27:18,513 INFO  L495      AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 345 flow
[2023-11-03 13:27:18,513 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-11-03 13:27:18,513 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:18,513 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:18,518 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2023-11-03 13:27:18,714 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-11-03 13:27:18,714 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-11-03 13:27:18,715 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:18,715 INFO  L85        PathProgramCache]: Analyzing trace with hash -1529971120, now seen corresponding path program 1 times
[2023-11-03 13:27:18,715 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:18,715 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340803910]
[2023-11-03 13:27:18,715 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:18,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:18,732 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:18,749 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked.
[2023-11-03 13:27:18,749 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:18,749 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340803910]
[2023-11-03 13:27:18,749 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340803910] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:18,749 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:18,750 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:27:18,750 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872265208]
[2023-11-03 13:27:18,750 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:18,750 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:18,750 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:18,751 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:18,751 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:18,771 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-11-03 13:27:18,772 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-11-03 13:27:18,772 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:18,772 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-11-03 13:27:18,772 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:23,342 INFO  L130       PetriNetUnfolder]: 27791/57540 cut-off events.
[2023-11-03 13:27:23,342 INFO  L131       PetriNetUnfolder]: For 9347/12239 co-relation queries the response was YES.
[2023-11-03 13:27:23,463 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-11-03 13:27:23,628 INFO  L137   encePairwiseOnDemand]: 460/467 looper letters, 87 selfloop transitions, 9 changer transitions 0/164 dead transitions.
[2023-11-03 13:27:23,628 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 164 transitions, 655 flow
[2023-11-03 13:27:23,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:27:23,629 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:27:23,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 872 transitions.
[2023-11-03 13:27:23,631 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.622412562455389
[2023-11-03 13:27:23,631 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 872 transitions.
[2023-11-03 13:27:23,631 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 872 transitions.
[2023-11-03 13:27:23,631 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:23,631 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 872 transitions.
[2023-11-03 13:27:23,632 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-11-03 13:27:23,634 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-11-03 13:27:23,634 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-11-03 13:27:23,634 INFO  L175             Difference]: Start difference. First operand has 127 places, 125 transitions, 345 flow. Second operand 3 states and 872 transitions.
[2023-11-03 13:27:23,634 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 164 transitions, 655 flow
[2023-11-03 13:27:23,638 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 164 transitions, 654 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:27:23,639 INFO  L231             Difference]: Finished difference. Result has 130 places, 132 transitions, 420 flow
[2023-11-03 13:27:23,640 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-11-03 13:27:23,640 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places.
[2023-11-03 13:27:23,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 132 transitions, 420 flow
[2023-11-03 13:27:23,641 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-11-03 13:27:23,641 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:23,641 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:23,641 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-11-03 13:27:23,641 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-11-03 13:27:23,641 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:23,641 INFO  L85        PathProgramCache]: Analyzing trace with hash -456087400, now seen corresponding path program 1 times
[2023-11-03 13:27:23,641 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:23,642 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465521520]
[2023-11-03 13:27:23,642 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:23,642 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:23,663 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:23,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:27:23,704 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:23,705 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465521520]
[2023-11-03 13:27:23,705 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465521520] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:23,705 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:23,705 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-03 13:27:23,705 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178160419]
[2023-11-03 13:27:23,705 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:23,706 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:23,706 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:23,706 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:23,707 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:23,734 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 262 out of 467
[2023-11-03 13:27:23,735 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-11-03 13:27:23,735 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:23,735 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 467
[2023-11-03 13:27:23,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:26,392 INFO  L130       PetriNetUnfolder]: 13397/30583 cut-off events.
[2023-11-03 13:27:26,392 INFO  L131       PetriNetUnfolder]: For 6534/7626 co-relation queries the response was YES.
[2023-11-03 13:27:26,490 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-11-03 13:27:26,588 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 84 selfloop transitions, 7 changer transitions 0/161 dead transitions.
[2023-11-03 13:27:26,588 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 161 transitions, 676 flow
[2023-11-03 13:27:26,588 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:27:26,589 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:27:26,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 874 transitions.
[2023-11-03 13:27:26,590 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6238401142041399
[2023-11-03 13:27:26,590 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 874 transitions.
[2023-11-03 13:27:26,590 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 874 transitions.
[2023-11-03 13:27:26,591 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:26,591 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 874 transitions.
[2023-11-03 13:27:26,592 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-11-03 13:27:26,593 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-11-03 13:27:26,593 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-11-03 13:27:26,593 INFO  L175             Difference]: Start difference. First operand has 130 places, 132 transitions, 420 flow. Second operand 3 states and 874 transitions.
[2023-11-03 13:27:26,593 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 161 transitions, 676 flow
[2023-11-03 13:27:26,606 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 161 transitions, 664 flow, removed 2 selfloop flow, removed 2 redundant places.
[2023-11-03 13:27:26,607 INFO  L231             Difference]: Finished difference. Result has 130 places, 126 transitions, 376 flow
[2023-11-03 13:27:26,607 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-11-03 13:27:26,608 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 2 predicate places.
[2023-11-03 13:27:26,608 INFO  L495      AbstractCegarLoop]: Abstraction has has 130 places, 126 transitions, 376 flow
[2023-11-03 13:27:26,608 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-11-03 13:27:26,608 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:26,608 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-11-03 13:27:26,608 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-11-03 13:27:26,608 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-11-03 13:27:26,609 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:26,609 INFO  L85        PathProgramCache]: Analyzing trace with hash -436455586, now seen corresponding path program 1 times
[2023-11-03 13:27:26,609 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:26,609 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764345054]
[2023-11-03 13:27:26,609 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:26,609 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:26,627 ERROR L245   FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic
[2023-11-03 13:27:26,627 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [962231620]
[2023-11-03 13:27:26,627 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:26,627 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-11-03 13:27:26,627 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2023-11-03 13:27:26,629 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-11-03 13:27:26,630 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-11-03 13:27:26,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:26,816 INFO  L263         TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 17 conjunts are in the unsatisfiable core
[2023-11-03 13:27:26,820 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2023-11-03 13:27:26,876 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-11-03 13:27:26,885 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-11-03 13:27:26,896 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-11-03 13:27:26,944 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-11-03 13:27:26,952 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 13:27:26,952 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-11-03 13:27:27,032 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-11-03 13:27:27,080 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-11-03 13:27:27,090 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 13:27:27,090 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-11-03 13:27:27,194 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-11-03 13:27:27,252 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-11-03 13:27:27,263 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2023-11-03 13:27:27,263 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-11-03 13:27:27,307 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-11-03 13:27:27,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-11-03 13:27:27,443 INFO  L324         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-11-03 13:27:27,443 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:27,443 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764345054]
[2023-11-03 13:27:27,443 WARN  L310   FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT
[2023-11-03 13:27:27,443 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962231620]
[2023-11-03 13:27:27,443 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [962231620] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:27,444 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:27,444 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:27:27,444 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766988821]
[2023-11-03 13:27:27,444 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:27,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:27:27,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:27,445 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:27:27,445 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:27:28,395 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 256 out of 467
[2023-11-03 13:27:28,397 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-11-03 13:27:28,397 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:28,397 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 467
[2023-11-03 13:27:28,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:33,041 INFO  L130       PetriNetUnfolder]: 22299/44622 cut-off events.
[2023-11-03 13:27:33,041 INFO  L131       PetriNetUnfolder]: For 11922/13636 co-relation queries the response was YES.
[2023-11-03 13:27:33,195 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-11-03 13:27:33,338 INFO  L137   encePairwiseOnDemand]: 461/467 looper letters, 201 selfloop transitions, 5 changer transitions 0/269 dead transitions.
[2023-11-03 13:27:33,338 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 269 transitions, 1298 flow
[2023-11-03 13:27:33,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-03 13:27:33,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-03 13:27:33,341 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1725 transitions.
[2023-11-03 13:27:33,342 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6156316916488223
[2023-11-03 13:27:33,342 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1725 transitions.
[2023-11-03 13:27:33,342 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1725 transitions.
[2023-11-03 13:27:33,342 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:33,343 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1725 transitions.
[2023-11-03 13:27:33,345 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-11-03 13:27:33,347 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-11-03 13:27:33,347 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-11-03 13:27:33,347 INFO  L175             Difference]: Start difference. First operand has 130 places, 126 transitions, 376 flow. Second operand 6 states and 1725 transitions.
[2023-11-03 13:27:33,347 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 269 transitions, 1298 flow
[2023-11-03 13:27:33,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 269 transitions, 1271 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-03 13:27:33,358 INFO  L231             Difference]: Finished difference. Result has 133 places, 125 transitions, 377 flow
[2023-11-03 13:27:33,358 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-11-03 13:27:33,359 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 5 predicate places.
[2023-11-03 13:27:33,359 INFO  L495      AbstractCegarLoop]: Abstraction has has 133 places, 125 transitions, 377 flow
[2023-11-03 13:27:33,359 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-11-03 13:27:33,359 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:33,359 INFO  L209   CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:33,367 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-11-03 13:27:33,560 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-11-03 13:27:33,560 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-11-03 13:27:33,560 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:33,560 INFO  L85        PathProgramCache]: Analyzing trace with hash -1108499910, now seen corresponding path program 1 times
[2023-11-03 13:27:33,561 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:33,561 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592669799]
[2023-11-03 13:27:33,561 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:33,561 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:33,578 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:33,597 INFO  L134       CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked.
[2023-11-03 13:27:33,597 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:33,597 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592669799]
[2023-11-03 13:27:33,598 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592669799] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:33,598 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:33,598 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-03 13:27:33,598 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617387559]
[2023-11-03 13:27:33,598 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:33,599 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-03 13:27:33,599 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:33,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-03 13:27:33,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-03 13:27:33,619 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 261 out of 467
[2023-11-03 13:27:33,619 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-11-03 13:27:33,619 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:33,619 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 261 of 467
[2023-11-03 13:27:33,619 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:27:36,365 INFO  L130       PetriNetUnfolder]: 14170/32886 cut-off events.
[2023-11-03 13:27:36,365 INFO  L131       PetriNetUnfolder]: For 8002/10889 co-relation queries the response was YES.
[2023-11-03 13:27:36,477 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-11-03 13:27:36,578 INFO  L137   encePairwiseOnDemand]: 462/467 looper letters, 80 selfloop transitions, 4 changer transitions 0/151 dead transitions.
[2023-11-03 13:27:36,578 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 151 transitions, 626 flow
[2023-11-03 13:27:36,579 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-03 13:27:36,579 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-03 13:27:36,580 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 862 transitions.
[2023-11-03 13:27:36,580 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6152748037116346
[2023-11-03 13:27:36,580 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 862 transitions.
[2023-11-03 13:27:36,581 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 862 transitions.
[2023-11-03 13:27:36,581 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:27:36,581 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 862 transitions.
[2023-11-03 13:27:36,582 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-11-03 13:27:36,583 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-11-03 13:27:36,584 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-11-03 13:27:36,584 INFO  L175             Difference]: Start difference. First operand has 133 places, 125 transitions, 377 flow. Second operand 3 states and 862 transitions.
[2023-11-03 13:27:36,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 151 transitions, 626 flow
[2023-11-03 13:27:36,589 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 151 transitions, 616 flow, removed 0 selfloop flow, removed 5 redundant places.
[2023-11-03 13:27:36,590 INFO  L231             Difference]: Finished difference. Result has 132 places, 128 transitions, 402 flow
[2023-11-03 13:27:36,590 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-11-03 13:27:36,591 INFO  L288   CegarLoopForPetriNet]: 128 programPoint places, 4 predicate places.
[2023-11-03 13:27:36,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 402 flow
[2023-11-03 13:27:36,591 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-11-03 13:27:36,591 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:36,591 INFO  L209   CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1]
[2023-11-03 13:27:36,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2023-11-03 13:27:36,591 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-11-03 13:27:36,592 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:36,592 INFO  L85        PathProgramCache]: Analyzing trace with hash 1174659505, now seen corresponding path program 1 times
[2023-11-03 13:27:36,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:36,592 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804472635]
[2023-11-03 13:27:36,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:36,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:36,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:27:36,612 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-03 13:27:36,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-03 13:27:36,630 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-03 13:27:36,630 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining)
[2023-11-03 13:27:36,631 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining)
[2023-11-03 13:27:36,632 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining)
[2023-11-03 13:27:36,632 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2023-11-03 13:27:36,633 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-03 13:27:36,633 WARN  L233   ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis
[2023-11-03 13:27:36,633 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances.
[2023-11-03 13:27:36,672 INFO  L144    ThreadInstanceAdder]: Constructed 24 joinOtherThreadTransitions.
[2023-11-03 13:27:36,674 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 323 places, 353 transitions, 810 flow
[2023-11-03 13:27:36,871 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-11-03 13:27:36,871 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:36,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,872 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,878 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-11-03 13:27:36,878 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,878 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:36,882 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-11-03 13:27:36,882 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:36,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,887 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-11-03 13:27:36,887 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,887 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:36,887 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:36,888 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:37,092 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-11-03 13:27:37,092 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,096 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-11-03 13:27:37,096 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,096 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,098 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-11-03 13:27:37,098 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,098 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,099 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-11-03 13:27:37,099 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,100 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-11-03 13:27:37,100 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,100 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,170 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-11-03 13:27:37,171 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:37,171 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,212 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-11-03 13:27:37,212 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:37,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:37,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:37,212 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:37,213 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-11-03 13:27:37,213 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,213 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-11-03 13:27:37,213 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,213 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,214 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,216 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-11-03 13:27:37,216 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,216 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 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-11-03 13:27:37,217 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,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[][303], [threadThread2of4ForFork0InUse, threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, threadThread1of4ForFork0NotInUse, 228#ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCEStrue, 212#L1028-13true])
[2023-11-03 13:27:37,217 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,217 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,218 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-11-03 13:27:37,218 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,218 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,219 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-11-03 13:27:37,219 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,219 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,219 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,219 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,220 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-11-03 13:27:37,220 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,220 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,220 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,220 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,228 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-11-03 13:27:37,228 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:37,228 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:37,228 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,228 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,273 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-11-03 13:27:37,273 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:37,273 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,273 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:37,273 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,278 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-11-03 13:27:37,279 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,279 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-11-03 13:27:37,279 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:37,279 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:37,360 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-11-03 13:27:37,360 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,360 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 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-11-03 13:27:37,361 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 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-11-03 13:27:37,361 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,361 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,362 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-11-03 13:27:37,362 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,362 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:37,383 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-11-03 13:27:37,384 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,384 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-11-03 13:27:37,384 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,384 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,386 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-11-03 13:27:37,386 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,386 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,386 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-11-03 13:27:37,387 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,387 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,389 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-11-03 13:27:37,389 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,389 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-11-03 13:27:37,389 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:37,389 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:37,503 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-11-03 13:27:37,503 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,503 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,503 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,503 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,504 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-11-03 13:27:37,504 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,504 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,507 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-11-03 13:27:37,507 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,508 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,509 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-11-03 13:27:37,509 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,509 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-11-03 13:27:37,509 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:37,509 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,570 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-11-03 13:27:37,570 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,570 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,570 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,570 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,572 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-11-03 13:27:37,572 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,572 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,575 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-11-03 13:27:37,575 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,575 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,575 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,575 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,575 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,576 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-11-03 13:27:37,576 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:37,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:37,576 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:37,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:37,577 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-11-03 13:27:37,577 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:37,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:37,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,587 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-11-03 13:27:37,588 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 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-11-03 13:27:37,588 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,588 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,590 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-11-03 13:27:37,590 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,590 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,591 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-11-03 13:27:37,591 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,591 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,619 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-11-03 13:27:37,620 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-11-03 13:27:37,620 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-11-03 13:27:37,620 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:37,620 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:37,638 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-11-03 13:27:37,638 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,638 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,640 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-11-03 13:27:37,640 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,640 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,641 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-11-03 13:27:37,641 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,641 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,642 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-11-03 13:27:37,642 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:37,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,642 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:37,646 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-11-03 13:27:37,646 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,646 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,648 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-11-03 13:27:37,648 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,648 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,648 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-11-03 13:27:37,648 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,649 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,667 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-11-03 13:27:37,667 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,667 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,668 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,671 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-11-03 13:27:37,671 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-11-03 13:27:37,671 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-11-03 13:27:37,671 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,671 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,673 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-11-03 13:27:37,673 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,673 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-11-03 13:27:37,673 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:37,673 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:37,674 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:37,724 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-11-03 13:27:37,725 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,725 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-11-03 13:27:37,725 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,725 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,727 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-11-03 13:27:37,727 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,727 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-11-03 13:27:37,727 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,727 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,728 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-11-03 13:27:37,728 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,728 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,729 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-11-03 13:27:37,729 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,729 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,732 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-11-03 13:27:37,732 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 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-11-03 13:27:37,733 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 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-11-03 13:27:37,733 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,733 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-11-03 13:27:37,733 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 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-11-03 13:27:37,734 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 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-11-03 13:27:37,734 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:37,734 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:37,822 INFO  L130       PetriNetUnfolder]: 924/6411 cut-off events.
[2023-11-03 13:27:37,822 INFO  L131       PetriNetUnfolder]: For 877/952 co-relation queries the response was YES.
[2023-11-03 13:27:37,864 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-11-03 13:27:37,865 INFO  L82        GeneralOperation]: Start removeDead. Operand has 323 places, 353 transitions, 810 flow
[2023-11-03 13:27:37,894 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 293 places, 313 transitions, 706 flow
[2023-11-03 13:27:37,894 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-11-03 13:27:37,894 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 293 places, 313 transitions, 706 flow
[2023-11-03 13:27:37,894 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 293 places, 313 transitions, 706 flow
[2023-11-03 13:27:37,895 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 293 places, 313 transitions, 706 flow
[2023-11-03 13:27:38,092 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-11-03 13:27:38,092 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:38,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,092 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,099 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-11-03 13:27:38,099 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,099 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27: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[][119], [threadThread3of4ForFork0NotInUse, threadThread4of4ForFork0NotInUse, 190#L1037-10true, 43#L1028-13true, threadThread1of4ForFork0InUse, threadThread2of4ForFork0NotInUse])
[2023-11-03 13:27:38,102 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,102 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:38,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,103 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,108 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-11-03 13:27:38,109 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,109 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,109 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,109 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,109 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:38,310 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-11-03 13:27:38,310 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,310 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,314 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-11-03 13:27:38,314 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,314 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,315 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-11-03 13:27:38,315 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,316 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,317 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-11-03 13:27:38,317 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,317 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,318 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-11-03 13:27:38,318 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,318 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,388 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-11-03 13:27:38,388 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,388 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,388 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:38,388 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,428 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-11-03 13:27:38,429 INFO  L383   tUnfolder$Statistics]: this new event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:38,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:38,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:38,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is not cut-off event
[2023-11-03 13:27:38,429 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-11-03 13:27:38,429 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,429 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,430 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,430 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-11-03 13:27:38,430 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,430 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,430 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,430 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,432 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-11-03 13:27:38,432 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,432 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,432 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,432 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 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-11-03 13:27:38,433 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 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-11-03 13:27:38,433 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,433 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,434 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-11-03 13:27:38,434 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,434 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,435 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-11-03 13:27:38,435 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,435 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,436 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-11-03 13:27:38,436 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,436 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,436 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,436 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,445 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-11-03 13:27:38,445 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:38,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:38,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,445 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,492 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-11-03 13:27:38,492 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:38,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:38,492 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,498 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-11-03 13:27:38,498 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,498 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-11-03 13:27:38,498 INFO  L383   tUnfolder$Statistics]: this new event has 274 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 160 ancestors and is cut-off event
[2023-11-03 13:27:38,498 INFO  L386   tUnfolder$Statistics]:   existing Event has 217 ancestors and is cut-off event
[2023-11-03 13:27:38,577 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-11-03 13:27:38,577 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,577 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,578 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-11-03 13:27:38,578 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,578 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,578 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 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-11-03 13:27:38,579 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 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-11-03 13:27:38,579 INFO  L383   tUnfolder$Statistics]: this new event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,579 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is not cut-off event
[2023-11-03 13:27:38,599 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-11-03 13:27:38,599 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,599 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-11-03 13:27:38,599 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,599 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,600 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,600 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,601 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-11-03 13:27:38,601 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,602 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-11-03 13:27:38,602 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,602 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,604 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-11-03 13:27:38,604 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,604 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-11-03 13:27:38,604 INFO  L383   tUnfolder$Statistics]: this new event has 291 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 234 ancestors and is cut-off event
[2023-11-03 13:27:38,604 INFO  L386   tUnfolder$Statistics]:   existing Event has 177 ancestors and is cut-off event
[2023-11-03 13:27:38,712 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-11-03 13:27:38,712 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,712 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,713 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-11-03 13:27:38,713 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,713 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,716 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-11-03 13:27:38,716 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,717 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,718 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-11-03 13:27:38,718 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,718 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-11-03 13:27:38,718 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:38,718 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,781 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-11-03 13:27:38,782 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,782 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,783 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-11-03 13:27:38,784 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,784 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,784 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,784 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,784 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,786 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-11-03 13:27:38,786 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,786 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,787 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-11-03 13:27:38,787 INFO  L383   tUnfolder$Statistics]: this new event has 297 ancestors and is cut-off event
[2023-11-03 13:27:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 183 ancestors and is cut-off event
[2023-11-03 13:27:38,787 INFO  L386   tUnfolder$Statistics]:   existing Event has 240 ancestors and is cut-off event
[2023-11-03 13:27:38,788 INFO  L386   tUnfolder$Statistics]:   existing Event has 126 ancestors and is cut-off event
[2023-11-03 13:27:38,788 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-11-03 13:27:38,788 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,788 INFO  L386   tUnfolder$Statistics]:   existing Event has 143 ancestors and is cut-off event
[2023-11-03 13:27:38,788 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,788 INFO  L386   tUnfolder$Statistics]:   existing Event has 200 ancestors and is cut-off event
[2023-11-03 13:27:38,788 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,798 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-11-03 13:27:38,798 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,798 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,799 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-11-03 13:27:38,799 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,799 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,800 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-11-03 13:27:38,800 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 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-11-03 13:27:38,801 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,801 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,831 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-11-03 13:27:38,832 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-11-03 13:27:38,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-11-03 13:27:38,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:38,832 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:38,850 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-11-03 13:27:38,850 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,850 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,850 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,850 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,850 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 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-11-03 13:27:38,852 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 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-11-03 13:27:38,852 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,852 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 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-11-03 13:27:38,853 INFO  L383   tUnfolder$Statistics]: this new event has 314 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,853 INFO  L386   tUnfolder$Statistics]:   existing Event has 257 ancestors and is cut-off event
[2023-11-03 13:27:38,857 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-11-03 13:27:38,857 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,857 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,857 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,857 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,859 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-11-03 13:27:38,859 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,859 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-11-03 13:27:38,859 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,859 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,876 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-11-03 13:27:38,877 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,877 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,880 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-11-03 13:27:38,880 INFO  L383   tUnfolder$Statistics]: this new event has 322 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 265 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 322 ancestors and is cut-off event
[2023-11-03 13:27:38,880 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-11-03 13:27:38,880 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,880 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,882 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-11-03 13:27:38,882 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,882 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-11-03 13:27:38,882 INFO  L383   tUnfolder$Statistics]: this new event has 339 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 225 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,882 INFO  L386   tUnfolder$Statistics]:   existing Event has 282 ancestors and is cut-off event
[2023-11-03 13:27:38,929 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-11-03 13:27:38,929 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,929 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-11-03 13:27:38,929 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,929 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,930 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-11-03 13:27:38,930 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,930 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,930 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,930 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,931 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-11-03 13:27:38,931 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,931 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,932 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-11-03 13:27:38,932 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,932 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-11-03 13:27:38,932 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,932 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,936 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-11-03 13:27:38,936 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,936 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-11-03 13:27:38,936 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,936 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-11-03 13:27:38,936 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,936 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 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-11-03 13:27:38,937 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 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-11-03 13:27:38,937 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 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-11-03 13:27:38,937 INFO  L383   tUnfolder$Statistics]: this new event has 356 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 299 ancestors and is cut-off event
[2023-11-03 13:27:38,937 INFO  L386   tUnfolder$Statistics]:   existing Event has 242 ancestors and is cut-off event
[2023-11-03 13:27:38,987 INFO  L130       PetriNetUnfolder]: 924/6411 cut-off events.
[2023-11-03 13:27:38,987 INFO  L131       PetriNetUnfolder]: For 877/895 co-relation queries the response was YES.
[2023-11-03 13:27:39,071 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-11-03 13:27:39,314 INFO  L119        LiptonReduction]: Number of co-enabled transitions 50264
[2023-11-03 13:27:44,960 INFO  L134        LiptonReduction]: Checked pairs total: 354859
[2023-11-03 13:27:44,960 INFO  L136        LiptonReduction]: Total number of compositions: 195
[2023-11-03 13:27:44,961 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-03 13:27:44,962 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;@334cb16b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-11-03 13:27:44,962 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 31 error locations.
[2023-11-03 13:27:44,962 INFO  L130       PetriNetUnfolder]: 0/0 cut-off events.
[2023-11-03 13:27:44,962 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2023-11-03 13:27:44,962 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:27:44,962 INFO  L209   CegarLoopForPetriNet]: trace histogram [1]
[2023-11-03 13:27:44,962 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-11-03 13:27:44,962 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:27:44,963 INFO  L85        PathProgramCache]: Analyzing trace with hash 2027, now seen corresponding path program 1 times
[2023-11-03 13:27:44,963 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:27:44,963 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241270446]
[2023-11-03 13:27:44,963 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:27:44,963 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:27:44,966 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:27:44,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:27:44,967 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:27:44,967 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241270446]
[2023-11-03 13:27:44,968 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241270446] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:27:44,968 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:27:44,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-11-03 13:27:44,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935555027]
[2023-11-03 13:27:44,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:27:44,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-11-03 13:27:44,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:27:44,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-11-03 13:27:44,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-11-03 13:27:44,969 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 313 out of 548
[2023-11-03 13:27:44,969 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-11-03 13:27:44,969 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:27:44,970 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 313 of 548
[2023-11-03 13:27:44,970 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-03 13:28:25,846 INFO  L130       PetriNetUnfolder]: 254982/505065 cut-off events.
[2023-11-03 13:28:25,846 INFO  L131       PetriNetUnfolder]: For 49495/118234 co-relation queries the response was YES.
[2023-11-03 13:28:27,337 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 860284 conditions, 505065 events. 254982/505065 cut-off events. For 49495/118234 co-relation queries the response was YES. Maximal size of possible extension queue 9090. Compared 6289370 event pairs, 193633 based on Foata normal form. 0/417490 useless extension candidates. Maximal degree in co-relation 714015. Up to 330162 conditions per place. 
[2023-11-03 13:28:29,908 INFO  L137   encePairwiseOnDemand]: 543/548 looper letters, 66 selfloop transitions, 0 changer transitions 0/162 dead transitions.
[2023-11-03 13:28:29,908 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 162 transitions, 536 flow
[2023-11-03 13:28:29,909 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-11-03 13:28:29,909 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-11-03 13:28:29,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 697 transitions.
[2023-11-03 13:28:29,910 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.6359489051094891
[2023-11-03 13:28:29,910 INFO  L72            ComplementDD]: Start complementDD. Operand 2 states and 697 transitions.
[2023-11-03 13:28:29,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 2 states and 697 transitions.
[2023-11-03 13:28:29,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-03 13:28:29,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 697 transitions.
[2023-11-03 13:28:29,912 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 3 states, 2 states have (on average 348.5) internal successors, (697), 2 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:28:29,913 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 3 states, 3 states have (on average 548.0) internal successors, (1644), 3 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:28:29,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 3 states, 3 states have (on average 548.0) internal successors, (1644), 3 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:28:29,913 INFO  L175             Difference]: Start difference. First operand has 157 places, 167 transitions, 414 flow. Second operand 2 states and 697 transitions.
[2023-11-03 13:28:29,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 162 transitions, 536 flow
[2023-11-03 13:28:29,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 162 transitions, 536 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-03 13:28:29,974 INFO  L231             Difference]: Finished difference. Result has 153 places, 162 transitions, 404 flow
[2023-11-03 13:28:29,974 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=548, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=404, PETRI_PLACES=153, PETRI_TRANSITIONS=162}
[2023-11-03 13:28:29,974 INFO  L288   CegarLoopForPetriNet]: 157 programPoint places, -4 predicate places.
[2023-11-03 13:28:29,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 162 transitions, 404 flow
[2023-11-03 13:28:29,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  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-11-03 13:28:29,975 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2023-11-03 13:28:29,975 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1]
[2023-11-03 13:28:29,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2023-11-03 13:28:29,975 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 28 more)] ===
[2023-11-03 13:28:29,975 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-03 13:28:29,975 INFO  L85        PathProgramCache]: Analyzing trace with hash 41390590, now seen corresponding path program 1 times
[2023-11-03 13:28:29,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-03 13:28:29,976 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662862384]
[2023-11-03 13:28:29,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-03 13:28:29,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-03 13:28:29,989 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-03 13:28:30,098 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-03 13:28:30,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-03 13:28:30,099 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662862384]
[2023-11-03 13:28:30,099 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662862384] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-03 13:28:30,099 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-03 13:28:30,099 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-03 13:28:30,099 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970876126]
[2023-11-03 13:28:30,099 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-03 13:28:30,100 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-03 13:28:30,100 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-03 13:28:30,100 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-03 13:28:30,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-03 13:28:30,790 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 259 out of 548
[2023-11-03 13:28:30,791 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 162 transitions, 404 flow. Second operand  has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-03 13:28:30,791 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-03 13:28:30,792 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 548
[2023-11-03 13:28:30,792 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
