./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/per-thread-index-bitmask-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 e2d3f3ab25dd6572e3a89c146cb9ba6a4ca0555d0bd4fd406e95dff5db74317f
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 00:40:42,280 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 00:40:42,322 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 00:40:42,325 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 00:40:42,326 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 00:40:42,347 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 00:40:42,348 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 00:40:42,348 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 00:40:42,349 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 00:40:42,349 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 00:40:42,350 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 00:40:42,350 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 00:40:42,351 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 00:40:42,351 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 00:40:42,351 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 00:40:42,352 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 00:40:42,352 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 00:40:42,352 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 00:40:42,353 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 00:40:42,353 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 00:40:42,353 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 00:40:42,354 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 00:40:42,354 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 00:40:42,354 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 00:40:42,355 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 00:40:42,355 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 00:40:42,355 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 00:40:42,356 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 00:40:42,356 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 00:40:42,356 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 00:40:42,357 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:40:42,357 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 00:40:42,357 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 00:40:42,358 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 00:40:42,358 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 00:40:42,358 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 00:40:42,358 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 00:40:42,359 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 00:40:42,359 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 00:40:42,359 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 00:40:42,359 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 00:40:42,360 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> e2d3f3ab25dd6572e3a89c146cb9ba6a4ca0555d0bd4fd406e95dff5db74317f
[2024-03-12 00:40:42,553 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 00:40:42,577 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 00:40:42,580 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 00:40:42,581 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 00:40:42,584 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 00:40:42,593 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-12 00:40:43,672 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 00:40:43,858 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 00:40:43,859 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race.i
[2024-03-12 00:40:43,878 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c59f4774a/6ebf39bb07db482e88fee85051f50fe3/FLAGe49bba265
[2024-03-12 00:40:43,888 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c59f4774a/6ebf39bb07db482e88fee85051f50fe3
[2024-03-12 00:40:43,891 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 00:40:43,892 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 00:40:43,893 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 00:40:43,893 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 00:40:43,897 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 00:40:43,898 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:40:43" (1/1) ...
[2024-03-12 00:40:43,899 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723468d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:43, skipping insertion in model container
[2024-03-12 00:40:43,899 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:40:43" (1/1) ...
[2024-03-12 00:40:43,942 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 00:40:44,246 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:40:44,253 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 00:40:44,284 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:40:44,318 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-12 00:40:44,323 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 00:40:44,324 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44 WrapperNode
[2024-03-12 00:40:44,324 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 00:40:44,325 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 00:40:44,325 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 00:40:44,325 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 00:40:44,330 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,345 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,372 INFO  L138                Inliner]: procedures = 277, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119
[2024-03-12 00:40:44,372 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 00:40:44,373 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 00:40:44,373 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 00:40:44,373 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 00:40:44,380 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,381 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,396 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,397 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,404 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,407 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,409 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,410 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,413 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 00:40:44,413 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 00:40:44,414 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 00:40:44,414 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 00:40:44,414 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (1/1) ...
[2024-03-12 00:40:44,419 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:40:44,434 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:40:44,444 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 00:40:44,463 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 00:40:44,488 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 00:40:44,489 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 00:40:44,489 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 00:40:44,489 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 00:40:44,490 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 00:40:44,490 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 00:40:44,490 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 00:40:44,490 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-12 00:40:44,491 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 00:40:44,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 00:40:44,491 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 00:40:44,491 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 00:40:44,493 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 00:40:44,650 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 00:40:44,652 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 00:40:44,875 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 00:40:44,884 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 00:40:44,884 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 00:40:44,886 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:40:44 BoogieIcfgContainer
[2024-03-12 00:40:44,886 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 00:40:44,888 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 00:40:44,888 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 00:40:44,890 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 00:40:44,890 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 12:40:43" (1/3) ...
[2024-03-12 00:40:44,891 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ecf828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:40:44, skipping insertion in model container
[2024-03-12 00:40:44,891 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:40:44" (2/3) ...
[2024-03-12 00:40:44,891 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ecf828 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:40:44, skipping insertion in model container
[2024-03-12 00:40:44,891 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:40:44" (3/3) ...
[2024-03-12 00:40:44,892 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race.i
[2024-03-12 00:40:44,898 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 00:40:44,906 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 00:40:44,906 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-12 00:40:44,906 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 00:40:44,953 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 00:40:44,979 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 175 places, 183 transitions, 373 flow
[2024-03-12 00:40:45,040 INFO  L124   PetriNetUnfolderBase]: 16/268 cut-off events.
[2024-03-12 00:40:45,041 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 00:40:45,046 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 273 conditions, 268 events. 16/268 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 603 event pairs, 0 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 136. Up to 6 conditions per place. 
[2024-03-12 00:40:45,046 INFO  L82        GeneralOperation]: Start removeDead. Operand has 175 places, 183 transitions, 373 flow
[2024-03-12 00:40:45,051 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 175 places, 183 transitions, 373 flow
[2024-03-12 00:40:45,058 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:40:45,063 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=LoopHeads, 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;@3531b3fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:40:45,063 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-12 00:40:45,068 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:40:45,069 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-03-12 00:40:45,069 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:40:45,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:45,069 INFO  L208   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, 1, 1, 1, 1]
[2024-03-12 00:40:45,070 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:45,073 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:45,074 INFO  L85        PathProgramCache]: Analyzing trace with hash 492644561, now seen corresponding path program 1 times
[2024-03-12 00:40:45,080 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:45,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111748185]
[2024-03-12 00:40:45,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:45,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:45,162 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:45,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:45,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:45,258 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111748185]
[2024-03-12 00:40:45,259 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111748185] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:45,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:45,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:40:45,261 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937883297]
[2024-03-12 00:40:45,261 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:45,268 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:40:45,272 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:45,291 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:40:45,292 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:40:45,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-12 00:40:45,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 183 transitions, 373 flow. Second operand  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:45,322 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-12 00:40:45,322 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:45,379 INFO  L124   PetriNetUnfolderBase]: 18/349 cut-off events.
[2024-03-12 00:40:45,380 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:40:45,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 371 conditions, 349 events. 18/349 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 929 event pairs, 2 based on Foata normal form. 6/304 useless extension candidates. Maximal degree in co-relation 229. Up to 15 conditions per place. 
[2024-03-12 00:40:45,383 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 8 selfloop transitions, 2 changer transitions 2/178 dead transitions.
[2024-03-12 00:40:45,384 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 178 transitions, 383 flow
[2024-03-12 00:40:45,385 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:40:45,386 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:40:45,393 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions.
[2024-03-12 00:40:45,395 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9453551912568307
[2024-03-12 00:40:45,396 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 519 transitions.
[2024-03-12 00:40:45,396 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions.
[2024-03-12 00:40:45,398 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:45,400 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions.
[2024-03-12 00:40:45,404 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,408 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,409 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,410 INFO  L175             Difference]: Start difference. First operand has 175 places, 183 transitions, 373 flow. Second operand 3 states and 519 transitions.
[2024-03-12 00:40:45,411 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 178 transitions, 383 flow
[2024-03-12 00:40:45,414 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 178 transitions, 383 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:40:45,417 INFO  L231             Difference]: Finished difference. Result has 176 places, 176 transitions, 363 flow
[2024-03-12 00:40:45,418 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=363, PETRI_PLACES=176, PETRI_TRANSITIONS=176}
[2024-03-12 00:40:45,421 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-03-12 00:40:45,422 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 176 transitions, 363 flow
[2024-03-12 00:40:45,422 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,422 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:45,423 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:45,423 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 00:40:45,423 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:45,424 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:45,424 INFO  L85        PathProgramCache]: Analyzing trace with hash 887687438, now seen corresponding path program 1 times
[2024-03-12 00:40:45,424 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:45,424 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990868019]
[2024-03-12 00:40:45,424 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:45,425 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:45,443 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:45,481 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:45,482 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:45,482 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990868019]
[2024-03-12 00:40:45,482 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990868019] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:45,482 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:45,482 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:40:45,483 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841981126]
[2024-03-12 00:40:45,483 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:45,484 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:40:45,484 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:45,485 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:40:45,485 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:40:45,509 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-12 00:40:45,509 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 176 transitions, 363 flow. Second operand  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,510 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:45,510 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-12 00:40:45,510 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:45,565 INFO  L124   PetriNetUnfolderBase]: 46/496 cut-off events.
[2024-03-12 00:40:45,566 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:40:45,567 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 559 conditions, 496 events. 46/496 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2032 event pairs, 7 based on Foata normal form. 0/429 useless extension candidates. Maximal degree in co-relation 520. Up to 36 conditions per place. 
[2024-03-12 00:40:45,569 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 13 selfloop transitions, 8 changer transitions 0/184 dead transitions.
[2024-03-12 00:40:45,569 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 184 transitions, 421 flow
[2024-03-12 00:40:45,570 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:40:45,570 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:40:45,571 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions.
[2024-03-12 00:40:45,572 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9508196721311475
[2024-03-12 00:40:45,572 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 522 transitions.
[2024-03-12 00:40:45,573 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 522 transitions.
[2024-03-12 00:40:45,573 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:45,573 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 522 transitions.
[2024-03-12 00:40:45,575 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,576 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,577 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,577 INFO  L175             Difference]: Start difference. First operand has 176 places, 176 transitions, 363 flow. Second operand 3 states and 522 transitions.
[2024-03-12 00:40:45,577 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 184 transitions, 421 flow
[2024-03-12 00:40:45,579 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 184 transitions, 417 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:40:45,581 INFO  L231             Difference]: Finished difference. Result has 176 places, 184 transitions, 429 flow
[2024-03-12 00:40:45,581 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=176, PETRI_TRANSITIONS=184}
[2024-03-12 00:40:45,582 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 1 predicate places.
[2024-03-12 00:40:45,582 INFO  L495      AbstractCegarLoop]: Abstraction has has 176 places, 184 transitions, 429 flow
[2024-03-12 00:40:45,583 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,583 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:45,583 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:45,583 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 00:40:45,583 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:45,584 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:45,584 INFO  L85        PathProgramCache]: Analyzing trace with hash -1589763451, now seen corresponding path program 1 times
[2024-03-12 00:40:45,584 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:45,585 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928013809]
[2024-03-12 00:40:45,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:45,585 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:45,607 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:45,705 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:45,706 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:45,706 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928013809]
[2024-03-12 00:40:45,706 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928013809] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:45,706 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:45,707 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:40:45,707 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357319582]
[2024-03-12 00:40:45,707 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:45,708 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:40:45,708 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:45,708 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:40:45,709 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:40:45,783 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-12 00:40:45,784 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 184 transitions, 429 flow. Second operand  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,784 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:45,784 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-12 00:40:45,784 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:45,849 INFO  L124   PetriNetUnfolderBase]: 46/507 cut-off events.
[2024-03-12 00:40:45,849 INFO  L125   PetriNetUnfolderBase]: For 18/25 co-relation queries the response was YES.
[2024-03-12 00:40:45,851 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 608 conditions, 507 events. 46/507 cut-off events. For 18/25 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1984 event pairs, 6 based on Foata normal form. 2/448 useless extension candidates. Maximal degree in co-relation 434. Up to 36 conditions per place. 
[2024-03-12 00:40:45,852 INFO  L140   encePairwiseOnDemand]: 175/183 looper letters, 11 selfloop transitions, 6 changer transitions 1/189 dead transitions.
[2024-03-12 00:40:45,852 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 189 transitions, 475 flow
[2024-03-12 00:40:45,853 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:40:45,853 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:40:45,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1015 transitions.
[2024-03-12 00:40:45,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.924408014571949
[2024-03-12 00:40:45,855 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1015 transitions.
[2024-03-12 00:40:45,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1015 transitions.
[2024-03-12 00:40:45,856 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:45,856 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1015 transitions.
[2024-03-12 00:40:45,858 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 169.16666666666666) internal successors, (1015), 6 states have internal predecessors, (1015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,861 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,862 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,862 INFO  L175             Difference]: Start difference. First operand has 176 places, 184 transitions, 429 flow. Second operand 6 states and 1015 transitions.
[2024-03-12 00:40:45,862 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 189 transitions, 475 flow
[2024-03-12 00:40:45,864 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 189 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:40:45,866 INFO  L231             Difference]: Finished difference. Result has 183 places, 188 transitions, 455 flow
[2024-03-12 00:40:45,866 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=183, PETRI_TRANSITIONS=188}
[2024-03-12 00:40:45,867 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 8 predicate places.
[2024-03-12 00:40:45,867 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 188 transitions, 455 flow
[2024-03-12 00:40:45,868 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 167.4) internal successors, (837), 5 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:45,868 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:45,868 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:45,868 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 00:40:45,868 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:45,869 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:45,869 INFO  L85        PathProgramCache]: Analyzing trace with hash 2010357965, now seen corresponding path program 1 times
[2024-03-12 00:40:45,869 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:45,869 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96813069]
[2024-03-12 00:40:45,869 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:45,870 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:45,887 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:46,146 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:46,147 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:46,147 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96813069]
[2024-03-12 00:40:46,147 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96813069] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:46,147 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:46,148 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:40:46,148 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758344755]
[2024-03-12 00:40:46,148 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:46,148 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:40:46,149 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:46,149 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:40:46,150 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:40:46,375 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 151 out of 183
[2024-03-12 00:40:46,376 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 188 transitions, 455 flow. Second operand  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,376 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:46,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 183
[2024-03-12 00:40:46,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:46,594 INFO  L124   PetriNetUnfolderBase]: 212/1375 cut-off events.
[2024-03-12 00:40:46,594 INFO  L125   PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES.
[2024-03-12 00:40:46,597 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1843 conditions, 1375 events. 212/1375 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 9427 event pairs, 16 based on Foata normal form. 1/1210 useless extension candidates. Maximal degree in co-relation 1700. Up to 195 conditions per place. 
[2024-03-12 00:40:46,600 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 38 selfloop transitions, 29 changer transitions 0/227 dead transitions.
[2024-03-12 00:40:46,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 227 transitions, 670 flow
[2024-03-12 00:40:46,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:40:46,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:40:46,603 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions.
[2024-03-12 00:40:46,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-12 00:40:46,603 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 976 transitions.
[2024-03-12 00:40:46,603 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions.
[2024-03-12 00:40:46,604 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:46,604 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions.
[2024-03-12 00:40:46,606 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,608 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,609 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,609 INFO  L175             Difference]: Start difference. First operand has 183 places, 188 transitions, 455 flow. Second operand 6 states and 976 transitions.
[2024-03-12 00:40:46,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 227 transitions, 670 flow
[2024-03-12 00:40:46,611 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 227 transitions, 668 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:40:46,613 INFO  L231             Difference]: Finished difference. Result has 192 places, 217 transitions, 673 flow
[2024-03-12 00:40:46,614 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=192, PETRI_TRANSITIONS=217}
[2024-03-12 00:40:46,615 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places.
[2024-03-12 00:40:46,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 192 places, 217 transitions, 673 flow
[2024-03-12 00:40:46,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.16666666666666) internal successors, (913), 6 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:46,616 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:46,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 00:40:46,616 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:46,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:46,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 818998992, now seen corresponding path program 1 times
[2024-03-12 00:40:46,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:46,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453062496]
[2024-03-12 00:40:46,617 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:46,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:46,628 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:46,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:46,646 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:46,646 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453062496]
[2024-03-12 00:40:46,646 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453062496] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:46,647 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:46,647 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:40:46,647 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804061389]
[2024-03-12 00:40:46,647 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:46,647 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:40:46,648 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:46,648 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:40:46,648 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:40:46,656 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 170 out of 183
[2024-03-12 00:40:46,657 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 217 transitions, 673 flow. Second operand  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,657 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:46,658 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 183
[2024-03-12 00:40:46,658 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:46,775 INFO  L124   PetriNetUnfolderBase]: 178/1313 cut-off events.
[2024-03-12 00:40:46,775 INFO  L125   PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES.
[2024-03-12 00:40:46,778 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 1313 events. 178/1313 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9089 event pairs, 12 based on Foata normal form. 0/1171 useless extension candidates. Maximal degree in co-relation 1657. Up to 106 conditions per place. 
[2024-03-12 00:40:46,781 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 7 selfloop transitions, 2 changer transitions 4/217 dead transitions.
[2024-03-12 00:40:46,781 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 217 transitions, 691 flow
[2024-03-12 00:40:46,782 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:40:46,782 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:40:46,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions.
[2024-03-12 00:40:46,783 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9489981785063752
[2024-03-12 00:40:46,783 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 521 transitions.
[2024-03-12 00:40:46,783 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions.
[2024-03-12 00:40:46,784 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:46,784 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions.
[2024-03-12 00:40:46,785 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,786 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,787 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,787 INFO  L175             Difference]: Start difference. First operand has 192 places, 217 transitions, 673 flow. Second operand 3 states and 521 transitions.
[2024-03-12 00:40:46,787 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 217 transitions, 691 flow
[2024-03-12 00:40:46,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 217 transitions, 691 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:40:46,793 INFO  L231             Difference]: Finished difference. Result has 193 places, 213 transitions, 659 flow
[2024-03-12 00:40:46,793 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=659, PETRI_PLACES=193, PETRI_TRANSITIONS=213}
[2024-03-12 00:40:46,794 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places.
[2024-03-12 00:40:46,794 INFO  L495      AbstractCegarLoop]: Abstraction has has 193 places, 213 transitions, 659 flow
[2024-03-12 00:40:46,795 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:46,795 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:46,795 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 00:40:46,795 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:46,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:46,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1087706299, now seen corresponding path program 1 times
[2024-03-12 00:40:46,796 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:46,796 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546724023]
[2024-03-12 00:40:46,796 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:46,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:46,805 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:46,856 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:46,857 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:46,857 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546724023]
[2024-03-12 00:40:46,857 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546724023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:46,857 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:46,857 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:40:46,858 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282826054]
[2024-03-12 00:40:46,858 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:46,858 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:40:46,858 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:46,859 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:40:46,859 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:40:46,896 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-12 00:40:46,897 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 213 transitions, 659 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:46,897 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:46,897 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-12 00:40:46,897 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:47,040 INFO  L124   PetriNetUnfolderBase]: 166/1210 cut-off events.
[2024-03-12 00:40:47,041 INFO  L125   PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES.
[2024-03-12 00:40:47,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 1210 events. 166/1210 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8101 event pairs, 16 based on Foata normal form. 1/1086 useless extension candidates. Maximal degree in co-relation 1684. Up to 94 conditions per place. 
[2024-03-12 00:40:47,046 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-03-12 00:40:47,046 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 218 transitions, 701 flow
[2024-03-12 00:40:47,046 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:40:47,047 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:40:47,048 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-03-12 00:40:47,048 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-03-12 00:40:47,048 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,048 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,049 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:47,049 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,050 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,051 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,052 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,052 INFO  L175             Difference]: Start difference. First operand has 193 places, 213 transitions, 659 flow. Second operand 4 states and 689 transitions.
[2024-03-12 00:40:47,052 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 218 transitions, 701 flow
[2024-03-12 00:40:47,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 218 transitions, 689 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 00:40:47,058 INFO  L231             Difference]: Finished difference. Result has 191 places, 216 transitions, 672 flow
[2024-03-12 00:40:47,058 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=672, PETRI_PLACES=191, PETRI_TRANSITIONS=216}
[2024-03-12 00:40:47,058 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 16 predicate places.
[2024-03-12 00:40:47,059 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 216 transitions, 672 flow
[2024-03-12 00:40:47,059 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,059 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:47,059 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:47,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 00:40:47,060 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:47,060 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:47,060 INFO  L85        PathProgramCache]: Analyzing trace with hash -213965619, now seen corresponding path program 1 times
[2024-03-12 00:40:47,060 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:47,061 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258860223]
[2024-03-12 00:40:47,061 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:47,061 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:47,069 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:47,116 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:47,117 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:47,117 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258860223]
[2024-03-12 00:40:47,117 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258860223] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:47,117 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:47,117 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:40:47,117 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208059892]
[2024-03-12 00:40:47,118 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:47,118 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:40:47,118 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:47,119 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:40:47,119 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:40:47,162 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-12 00:40:47,163 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 216 transitions, 672 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,163 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:47,163 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-12 00:40:47,163 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:47,260 INFO  L124   PetriNetUnfolderBase]: 165/1208 cut-off events.
[2024-03-12 00:40:47,261 INFO  L125   PetriNetUnfolderBase]: For 102/102 co-relation queries the response was YES.
[2024-03-12 00:40:47,264 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1834 conditions, 1208 events. 165/1208 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8116 event pairs, 16 based on Foata normal form. 1/1081 useless extension candidates. Maximal degree in co-relation 1684. Up to 94 conditions per place. 
[2024-03-12 00:40:47,267 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 11 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-03-12 00:40:47,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 217 transitions, 704 flow
[2024-03-12 00:40:47,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:40:47,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:40:47,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 688 transitions.
[2024-03-12 00:40:47,269 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-03-12 00:40:47,270 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 688 transitions.
[2024-03-12 00:40:47,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 688 transitions.
[2024-03-12 00:40:47,270 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:47,270 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 688 transitions.
[2024-03-12 00:40:47,271 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.0) internal successors, (688), 4 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,273 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,273 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,273 INFO  L175             Difference]: Start difference. First operand has 191 places, 216 transitions, 672 flow. Second operand 4 states and 688 transitions.
[2024-03-12 00:40:47,273 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 217 transitions, 704 flow
[2024-03-12 00:40:47,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 217 transitions, 704 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:40:47,278 INFO  L231             Difference]: Finished difference. Result has 196 places, 217 transitions, 691 flow
[2024-03-12 00:40:47,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=672, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=691, PETRI_PLACES=196, PETRI_TRANSITIONS=217}
[2024-03-12 00:40:47,279 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 21 predicate places.
[2024-03-12 00:40:47,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 196 places, 217 transitions, 691 flow
[2024-03-12 00:40:47,279 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:47,280 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:47,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 00:40:47,280 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:47,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:47,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 1729463404, now seen corresponding path program 1 times
[2024-03-12 00:40:47,281 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:47,281 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382520266]
[2024-03-12 00:40:47,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:47,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:47,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:47,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:47,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:47,349 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382520266]
[2024-03-12 00:40:47,349 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382520266] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:47,349 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:47,349 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:40:47,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321257344]
[2024-03-12 00:40:47,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:47,350 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:40:47,350 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:47,351 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:40:47,351 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:40:47,391 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-12 00:40:47,392 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 217 transitions, 691 flow. Second operand  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,392 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:47,392 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-12 00:40:47,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:47,492 INFO  L124   PetriNetUnfolderBase]: 164/1206 cut-off events.
[2024-03-12 00:40:47,492 INFO  L125   PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES.
[2024-03-12 00:40:47,496 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1206 events. 164/1206 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8113 event pairs, 16 based on Foata normal form. 1/1085 useless extension candidates. Maximal degree in co-relation 1748. Up to 94 conditions per place. 
[2024-03-12 00:40:47,499 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/218 dead transitions.
[2024-03-12 00:40:47,499 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 218 transitions, 725 flow
[2024-03-12 00:40:47,500 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:40:47,500 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:40:47,501 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 689 transitions.
[2024-03-12 00:40:47,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9412568306010929
[2024-03-12 00:40:47,501 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,501 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,502 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:47,502 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 689 transitions.
[2024-03-12 00:40:47,503 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,504 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,505 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,505 INFO  L175             Difference]: Start difference. First operand has 196 places, 217 transitions, 691 flow. Second operand 4 states and 689 transitions.
[2024-03-12 00:40:47,505 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 218 transitions, 725 flow
[2024-03-12 00:40:47,508 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 218 transitions, 722 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:40:47,510 INFO  L231             Difference]: Finished difference. Result has 199 places, 217 transitions, 700 flow
[2024-03-12 00:40:47,510 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=688, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=700, PETRI_PLACES=199, PETRI_TRANSITIONS=217}
[2024-03-12 00:40:47,511 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 24 predicate places.
[2024-03-12 00:40:47,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 199 places, 217 transitions, 700 flow
[2024-03-12 00:40:47,511 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:47,512 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:47,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 00:40:47,512 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:47,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:47,513 INFO  L85        PathProgramCache]: Analyzing trace with hash -1249346588, now seen corresponding path program 1 times
[2024-03-12 00:40:47,513 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:47,513 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777445086]
[2024-03-12 00:40:47,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:47,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:47,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:47,568 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:47,568 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:47,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777445086]
[2024-03-12 00:40:47,569 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777445086] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:47,569 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:47,569 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:40:47,569 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916284127]
[2024-03-12 00:40:47,569 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:47,570 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:40:47,570 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:47,570 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:40:47,570 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:40:47,602 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 167 out of 183
[2024-03-12 00:40:47,603 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 217 transitions, 700 flow. Second operand  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,603 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:47,604 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 183
[2024-03-12 00:40:47,604 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:47,726 INFO  L124   PetriNetUnfolderBase]: 164/1205 cut-off events.
[2024-03-12 00:40:47,726 INFO  L125   PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES.
[2024-03-12 00:40:47,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1862 conditions, 1205 events. 164/1205 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 8087 event pairs, 17 based on Foata normal form. 1/1083 useless extension candidates. Maximal degree in co-relation 1754. Up to 94 conditions per place. 
[2024-03-12 00:40:47,732 INFO  L140   encePairwiseOnDemand]: 179/183 looper letters, 12 selfloop transitions, 4 changer transitions 0/217 dead transitions.
[2024-03-12 00:40:47,732 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 217 transitions, 732 flow
[2024-03-12 00:40:47,733 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:40:47,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:40:47,734 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 685 transitions.
[2024-03-12 00:40:47,734 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357923497267759
[2024-03-12 00:40:47,735 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 685 transitions.
[2024-03-12 00:40:47,735 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 685 transitions.
[2024-03-12 00:40:47,735 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:47,735 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 685 transitions.
[2024-03-12 00:40:47,737 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 171.25) internal successors, (685), 4 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,738 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,738 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 183.0) internal successors, (915), 5 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,738 INFO  L175             Difference]: Start difference. First operand has 199 places, 217 transitions, 700 flow. Second operand 4 states and 685 transitions.
[2024-03-12 00:40:47,738 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 217 transitions, 732 flow
[2024-03-12 00:40:47,741 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 217 transitions, 724 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:40:47,743 INFO  L231             Difference]: Finished difference. Result has 200 places, 217 transitions, 704 flow
[2024-03-12 00:40:47,743 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=692, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=704, PETRI_PLACES=200, PETRI_TRANSITIONS=217}
[2024-03-12 00:40:47,744 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 25 predicate places.
[2024-03-12 00:40:47,744 INFO  L495      AbstractCegarLoop]: Abstraction has has 200 places, 217 transitions, 704 flow
[2024-03-12 00:40:47,744 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 168.25) internal successors, (673), 4 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,744 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:47,745 INFO  L208   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, 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, 1, 1]
[2024-03-12 00:40:47,745 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 00:40:47,745 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:47,745 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:47,745 INFO  L85        PathProgramCache]: Analyzing trace with hash -350592489, now seen corresponding path program 1 times
[2024-03-12 00:40:47,746 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:47,746 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735303695]
[2024-03-12 00:40:47,746 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:47,746 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:47,754 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:47,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:47,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:47,771 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735303695]
[2024-03-12 00:40:47,771 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735303695] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:47,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:47,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:40:47,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579899621]
[2024-03-12 00:40:47,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:47,772 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:40:47,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:47,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:40:47,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:40:47,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 166 out of 183
[2024-03-12 00:40:47,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 217 transitions, 704 flow. Second operand  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:47,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 183
[2024-03-12 00:40:47,796 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:47,890 INFO  L124   PetriNetUnfolderBase]: 177/1243 cut-off events.
[2024-03-12 00:40:47,890 INFO  L125   PetriNetUnfolderBase]: For 169/179 co-relation queries the response was YES.
[2024-03-12 00:40:47,894 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1932 conditions, 1243 events. 177/1243 cut-off events. For 169/179 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 8603 event pairs, 14 based on Foata normal form. 0/1114 useless extension candidates. Maximal degree in co-relation 1884. Up to 94 conditions per place. 
[2024-03-12 00:40:47,897 INFO  L140   encePairwiseOnDemand]: 177/183 looper letters, 16 selfloop transitions, 7 changer transitions 0/222 dead transitions.
[2024-03-12 00:40:47,898 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 222 transitions, 766 flow
[2024-03-12 00:40:47,898 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:40:47,898 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:40:47,899 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions.
[2024-03-12 00:40:47,900 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9398907103825137
[2024-03-12 00:40:47,900 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 516 transitions.
[2024-03-12 00:40:47,900 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 516 transitions.
[2024-03-12 00:40:47,900 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:47,900 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 516 transitions.
[2024-03-12 00:40:47,901 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,902 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,903 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,903 INFO  L175             Difference]: Start difference. First operand has 200 places, 217 transitions, 704 flow. Second operand 3 states and 516 transitions.
[2024-03-12 00:40:47,903 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 222 transitions, 766 flow
[2024-03-12 00:40:47,906 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 222 transitions, 758 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:40:47,908 INFO  L231             Difference]: Finished difference. Result has 201 places, 222 transitions, 752 flow
[2024-03-12 00:40:47,908 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=201, PETRI_TRANSITIONS=222}
[2024-03-12 00:40:47,909 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 26 predicate places.
[2024-03-12 00:40:47,909 INFO  L495      AbstractCegarLoop]: Abstraction has has 201 places, 222 transitions, 752 flow
[2024-03-12 00:40:47,909 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:47,909 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:47,910 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:40:47,910 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 00:40:47,910 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:47,910 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:47,910 INFO  L85        PathProgramCache]: Analyzing trace with hash 1033142490, now seen corresponding path program 1 times
[2024-03-12 00:40:47,910 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:47,911 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457282533]
[2024-03-12 00:40:47,911 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:47,911 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:47,928 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:48,183 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:48,183 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:48,183 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457282533]
[2024-03-12 00:40:48,184 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457282533] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:48,184 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:48,184 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:40:48,184 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657461400]
[2024-03-12 00:40:48,184 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:48,184 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:40:48,185 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:48,185 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:40:48,185 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:40:48,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 150 out of 183
[2024-03-12 00:40:48,283 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 222 transitions, 752 flow. Second operand  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:48,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:48,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 183
[2024-03-12 00:40:48,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:48,587 INFO  L124   PetriNetUnfolderBase]: 452/2089 cut-off events.
[2024-03-12 00:40:48,587 INFO  L125   PetriNetUnfolderBase]: For 543/623 co-relation queries the response was YES.
[2024-03-12 00:40:48,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3943 conditions, 2089 events. 452/2089 cut-off events. For 543/623 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 16237 event pairs, 68 based on Foata normal form. 11/1907 useless extension candidates. Maximal degree in co-relation 3896. Up to 605 conditions per place. 
[2024-03-12 00:40:48,599 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 52 selfloop transitions, 83 changer transitions 0/303 dead transitions.
[2024-03-12 00:40:48,599 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 303 transitions, 1358 flow
[2024-03-12 00:40:48,600 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:40:48,600 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:40:48,601 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 999 transitions.
[2024-03-12 00:40:48,602 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9098360655737705
[2024-03-12 00:40:48,602 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 999 transitions.
[2024-03-12 00:40:48,602 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 999 transitions.
[2024-03-12 00:40:48,603 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:48,603 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 999 transitions.
[2024-03-12 00:40:48,604 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 166.5) internal successors, (999), 6 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:48,606 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:48,606 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:48,607 INFO  L175             Difference]: Start difference. First operand has 201 places, 222 transitions, 752 flow. Second operand 6 states and 999 transitions.
[2024-03-12 00:40:48,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 303 transitions, 1358 flow
[2024-03-12 00:40:48,612 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 303 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:40:48,615 INFO  L231             Difference]: Finished difference. Result has 209 places, 303 transitions, 1474 flow
[2024-03-12 00:40:48,615 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1474, PETRI_PLACES=209, PETRI_TRANSITIONS=303}
[2024-03-12 00:40:48,616 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 34 predicate places.
[2024-03-12 00:40:48,616 INFO  L495      AbstractCegarLoop]: Abstraction has has 209 places, 303 transitions, 1474 flow
[2024-03-12 00:40:48,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:48,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:48,616 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:48,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 00:40:48,617 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:48,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:48,617 INFO  L85        PathProgramCache]: Analyzing trace with hash -1424845874, now seen corresponding path program 1 times
[2024-03-12 00:40:48,617 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:48,617 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576890441]
[2024-03-12 00:40:48,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:48,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:48,649 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:48,941 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:40:48,941 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:48,941 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576890441]
[2024-03-12 00:40:48,942 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576890441] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:48,942 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:48,942 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:40:48,942 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31266701]
[2024-03-12 00:40:48,942 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:48,943 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:40:48,943 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:48,943 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:40:48,943 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:40:49,189 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 160 out of 183
[2024-03-12 00:40:49,190 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 303 transitions, 1474 flow. Second operand  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:49,190 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:49,191 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 183
[2024-03-12 00:40:49,191 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:49,406 INFO  L124   PetriNetUnfolderBase]: 458/2068 cut-off events.
[2024-03-12 00:40:49,406 INFO  L125   PetriNetUnfolderBase]: For 1278/1323 co-relation queries the response was YES.
[2024-03-12 00:40:49,413 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4614 conditions, 2068 events. 458/2068 cut-off events. For 1278/1323 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 15938 event pairs, 41 based on Foata normal form. 8/1936 useless extension candidates. Maximal degree in co-relation 4563. Up to 338 conditions per place. 
[2024-03-12 00:40:49,420 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 46 selfloop transitions, 43 changer transitions 8/343 dead transitions.
[2024-03-12 00:40:49,420 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 343 transitions, 1933 flow
[2024-03-12 00:40:49,421 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:40:49,421 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:40:49,422 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions.
[2024-03-12 00:40:49,423 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.912568306010929
[2024-03-12 00:40:49,423 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1002 transitions.
[2024-03-12 00:40:49,423 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1002 transitions.
[2024-03-12 00:40:49,424 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:49,424 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1002 transitions.
[2024-03-12 00:40:49,426 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 167.0) internal successors, (1002), 6 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:49,427 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:49,427 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 183.0) internal successors, (1281), 7 states have internal predecessors, (1281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:49,428 INFO  L175             Difference]: Start difference. First operand has 209 places, 303 transitions, 1474 flow. Second operand 6 states and 1002 transitions.
[2024-03-12 00:40:49,428 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 343 transitions, 1933 flow
[2024-03-12 00:40:49,437 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 343 transitions, 1879 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:40:49,441 INFO  L231             Difference]: Finished difference. Result has 219 places, 335 transitions, 1877 flow
[2024-03-12 00:40:49,441 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1420, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1877, PETRI_PLACES=219, PETRI_TRANSITIONS=335}
[2024-03-12 00:40:49,442 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 44 predicate places.
[2024-03-12 00:40:49,442 INFO  L495      AbstractCegarLoop]: Abstraction has has 219 places, 335 transitions, 1877 flow
[2024-03-12 00:40:49,442 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 161.5) internal successors, (969), 6 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:49,443 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:49,443 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:49,443 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 00:40:49,443 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:49,443 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:49,443 INFO  L85        PathProgramCache]: Analyzing trace with hash -370415864, now seen corresponding path program 1 times
[2024-03-12 00:40:49,444 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:49,444 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106405231]
[2024-03-12 00:40:49,444 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:49,444 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:49,467 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:49,821 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:40:49,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:49,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106405231]
[2024-03-12 00:40:49,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106405231] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:49,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:49,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:40:49,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345696864]
[2024-03-12 00:40:49,822 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:49,822 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:40:49,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:49,823 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:40:49,823 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:40:50,393 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 183
[2024-03-12 00:40:50,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 335 transitions, 1877 flow. Second operand  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:50,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:50,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 183
[2024-03-12 00:40:50,394 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:51,034 INFO  L124   PetriNetUnfolderBase]: 497/2129 cut-off events.
[2024-03-12 00:40:51,034 INFO  L125   PetriNetUnfolderBase]: For 1896/2108 co-relation queries the response was YES.
[2024-03-12 00:40:51,040 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 2129 events. 497/2129 cut-off events. For 1896/2108 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 17107 event pairs, 59 based on Foata normal form. 90/2072 useless extension candidates. Maximal degree in co-relation 5421. Up to 348 conditions per place. 
[2024-03-12 00:40:51,047 INFO  L140   encePairwiseOnDemand]: 167/183 looper letters, 207 selfloop transitions, 73 changer transitions 0/437 dead transitions.
[2024-03-12 00:40:51,047 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 437 transitions, 3123 flow
[2024-03-12 00:40:51,048 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:40:51,048 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:40:51,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1704 transitions.
[2024-03-12 00:40:51,051 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8464977645305514
[2024-03-12 00:40:51,051 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1704 transitions.
[2024-03-12 00:40:51,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1704 transitions.
[2024-03-12 00:40:51,052 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:51,053 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1704 transitions.
[2024-03-12 00:40:51,055 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 154.9090909090909) internal successors, (1704), 11 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:51,058 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:51,059 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 183.0) internal successors, (2196), 12 states have internal predecessors, (2196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:51,059 INFO  L175             Difference]: Start difference. First operand has 219 places, 335 transitions, 1877 flow. Second operand 11 states and 1704 transitions.
[2024-03-12 00:40:51,059 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 437 transitions, 3123 flow
[2024-03-12 00:40:51,072 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 437 transitions, 3087 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-12 00:40:51,078 INFO  L231             Difference]: Finished difference. Result has 231 places, 359 transitions, 2309 flow
[2024-03-12 00:40:51,078 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=1841, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2309, PETRI_PLACES=231, PETRI_TRANSITIONS=359}
[2024-03-12 00:40:51,079 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 56 predicate places.
[2024-03-12 00:40:51,079 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 359 transitions, 2309 flow
[2024-03-12 00:40:51,079 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 145.9) internal successors, (1459), 10 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:51,080 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:51,080 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:51,080 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 00:40:51,080 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:51,080 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:51,081 INFO  L85        PathProgramCache]: Analyzing trace with hash -1380633078, now seen corresponding path program 1 times
[2024-03-12 00:40:51,081 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:51,081 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504276862]
[2024-03-12 00:40:51,081 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:51,081 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:51,101 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:51,458 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:40:51,458 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:51,458 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504276862]
[2024-03-12 00:40:51,458 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504276862] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:51,458 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:51,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:40:51,459 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448647405]
[2024-03-12 00:40:51,459 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:51,459 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:40:51,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:51,460 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:40:51,460 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:40:51,875 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 147 out of 183
[2024-03-12 00:40:51,876 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 359 transitions, 2309 flow. Second operand  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:51,876 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:51,876 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 183
[2024-03-12 00:40:51,876 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:52,228 INFO  L124   PetriNetUnfolderBase]: 438/1960 cut-off events.
[2024-03-12 00:40:52,229 INFO  L125   PetriNetUnfolderBase]: For 3484/3640 co-relation queries the response was YES.
[2024-03-12 00:40:52,235 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 1960 events. 438/1960 cut-off events. For 3484/3640 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 15627 event pairs, 26 based on Foata normal form. 41/1871 useless extension candidates. Maximal degree in co-relation 5570. Up to 474 conditions per place. 
[2024-03-12 00:40:52,241 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 154 selfloop transitions, 18 changer transitions 0/363 dead transitions.
[2024-03-12 00:40:52,241 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 363 transitions, 2703 flow
[2024-03-12 00:40:52,242 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:40:52,242 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:40:52,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1509 transitions.
[2024-03-12 00:40:52,245 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8245901639344262
[2024-03-12 00:40:52,245 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1509 transitions.
[2024-03-12 00:40:52,245 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1509 transitions.
[2024-03-12 00:40:52,246 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:52,246 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1509 transitions.
[2024-03-12 00:40:52,248 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 150.9) internal successors, (1509), 10 states have internal predecessors, (1509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,251 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,251 INFO  L175             Difference]: Start difference. First operand has 231 places, 359 transitions, 2309 flow. Second operand 10 states and 1509 transitions.
[2024-03-12 00:40:52,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 363 transitions, 2703 flow
[2024-03-12 00:40:52,268 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 363 transitions, 2697 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:40:52,273 INFO  L231             Difference]: Finished difference. Result has 238 places, 360 transitions, 2375 flow
[2024-03-12 00:40:52,273 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2291, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2375, PETRI_PLACES=238, PETRI_TRANSITIONS=360}
[2024-03-12 00:40:52,273 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 63 predicate places.
[2024-03-12 00:40:52,274 INFO  L495      AbstractCegarLoop]: Abstraction has has 238 places, 360 transitions, 2375 flow
[2024-03-12 00:40:52,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 148.8) internal successors, (1488), 10 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:52,275 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:52,275 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 00:40:52,275 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:52,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:52,276 INFO  L85        PathProgramCache]: Analyzing trace with hash -298044953, now seen corresponding path program 1 times
[2024-03-12 00:40:52,276 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:52,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102237986]
[2024-03-12 00:40:52,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:52,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:52,289 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:52,307 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:52,308 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:52,308 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102237986]
[2024-03-12 00:40:52,308 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102237986] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:52,308 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:40:52,308 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:40:52,309 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436862998]
[2024-03-12 00:40:52,309 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:52,309 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:40:52,309 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:52,310 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:40:52,310 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:40:52,328 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 168 out of 183
[2024-03-12 00:40:52,329 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 360 transitions, 2375 flow. Second operand  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,329 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:52,329 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 183
[2024-03-12 00:40:52,329 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:52,550 INFO  L124   PetriNetUnfolderBase]: 459/2059 cut-off events.
[2024-03-12 00:40:52,551 INFO  L125   PetriNetUnfolderBase]: For 3213/3284 co-relation queries the response was YES.
[2024-03-12 00:40:52,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5513 conditions, 2059 events. 459/2059 cut-off events. For 3213/3284 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16639 event pairs, 26 based on Foata normal form. 11/1956 useless extension candidates. Maximal degree in co-relation 5433. Up to 275 conditions per place. 
[2024-03-12 00:40:52,561 INFO  L140   encePairwiseOnDemand]: 176/183 looper letters, 14 selfloop transitions, 11 changer transitions 31/367 dead transitions.
[2024-03-12 00:40:52,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 367 transitions, 2453 flow
[2024-03-12 00:40:52,564 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:40:52,564 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:40:52,566 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions.
[2024-03-12 00:40:52,566 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9471766848816029
[2024-03-12 00:40:52,566 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 520 transitions.
[2024-03-12 00:40:52,566 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions.
[2024-03-12 00:40:52,567 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:52,567 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions.
[2024-03-12 00:40:52,568 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,570 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,570 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,570 INFO  L175             Difference]: Start difference. First operand has 238 places, 360 transitions, 2375 flow. Second operand 3 states and 520 transitions.
[2024-03-12 00:40:52,570 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 367 transitions, 2453 flow
[2024-03-12 00:40:52,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 367 transitions, 2417 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:40:52,596 INFO  L231             Difference]: Finished difference. Result has 237 places, 336 transitions, 2110 flow
[2024-03-12 00:40:52,596 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2339, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=349, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=237, PETRI_TRANSITIONS=336}
[2024-03-12 00:40:52,596 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 62 predicate places.
[2024-03-12 00:40:52,597 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 336 transitions, 2110 flow
[2024-03-12 00:40:52,597 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:52,597 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:52,597 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:52,597 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 00:40:52,597 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:52,598 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:52,598 INFO  L85        PathProgramCache]: Analyzing trace with hash 1971044348, now seen corresponding path program 1 times
[2024-03-12 00:40:52,598 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:52,598 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498571230]
[2024-03-12 00:40:52,598 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:52,598 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:52,618 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:53,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:53,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:53,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498571230]
[2024-03-12 00:40:53,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498571230] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:40:53,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581824608]
[2024-03-12 00:40:53,162 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:53,162 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:40:53,162 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:40:53,165 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:40:53,168 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 00:40:53,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:53,329 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 28 conjunts are in the unsatisfiable core
[2024-03-12 00:40:53,342 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:40:53,392 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:40:53,479 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:40:53,479 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:40:53,876 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:40:53,877 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-03-12 00:40:53,946 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:53,947 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:40:54,029 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:40:54,054 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:40:54,064 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:40:54,086 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:40:54,087 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:40:54,112 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:40:54,113 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:40:54,142 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:40:54,154 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:40:54,154 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:40:54,154 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581824608] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:54,154 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:40:54,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 20
[2024-03-12 00:40:54,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18598370]
[2024-03-12 00:40:54,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:54,155 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:40:54,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:54,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:40:54,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420
[2024-03-12 00:40:54,878 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-12 00:40:54,879 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 336 transitions, 2110 flow. Second operand  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:54,879 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:54,879 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-12 00:40:54,879 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:40:55,955 INFO  L124   PetriNetUnfolderBase]: 645/2485 cut-off events.
[2024-03-12 00:40:55,955 INFO  L125   PetriNetUnfolderBase]: For 5227/5277 co-relation queries the response was YES.
[2024-03-12 00:40:55,967 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7940 conditions, 2485 events. 645/2485 cut-off events. For 5227/5277 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 19387 event pairs, 54 based on Foata normal form. 16/2382 useless extension candidates. Maximal degree in co-relation 7855. Up to 354 conditions per place. 
[2024-03-12 00:40:55,974 INFO  L140   encePairwiseOnDemand]: 164/183 looper letters, 261 selfloop transitions, 81 changer transitions 35/526 dead transitions.
[2024-03-12 00:40:55,974 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 526 transitions, 4646 flow
[2024-03-12 00:40:55,975 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-12 00:40:55,975 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-12 00:40:55,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2649 transitions.
[2024-03-12 00:40:55,979 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7618636755823986
[2024-03-12 00:40:55,979 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2649 transitions.
[2024-03-12 00:40:55,979 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2649 transitions.
[2024-03-12 00:40:55,980 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:40:55,980 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2649 transitions.
[2024-03-12 00:40:55,985 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 139.42105263157896) internal successors, (2649), 19 states have internal predecessors, (2649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:55,988 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:55,988 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:55,988 INFO  L175             Difference]: Start difference. First operand has 237 places, 336 transitions, 2110 flow. Second operand 19 states and 2649 transitions.
[2024-03-12 00:40:55,989 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 526 transitions, 4646 flow
[2024-03-12 00:40:56,017 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 526 transitions, 4613 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-03-12 00:40:56,022 INFO  L231             Difference]: Finished difference. Result has 254 places, 387 transitions, 2973 flow
[2024-03-12 00:40:56,022 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2079, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=2973, PETRI_PLACES=254, PETRI_TRANSITIONS=387}
[2024-03-12 00:40:56,023 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 79 predicate places.
[2024-03-12 00:40:56,023 INFO  L495      AbstractCegarLoop]: Abstraction has has 254 places, 387 transitions, 2973 flow
[2024-03-12 00:40:56,023 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 135.21428571428572) internal successors, (1893), 14 states have internal predecessors, (1893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:40:56,023 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:56,024 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:56,034 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 00:40:56,229 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:40:56,230 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:40:56,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:56,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 504181754, now seen corresponding path program 2 times
[2024-03-12 00:40:56,231 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:56,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510002221]
[2024-03-12 00:40:56,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:56,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:56,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:56,895 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:56,895 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:56,895 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510002221]
[2024-03-12 00:40:56,895 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510002221] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:40:56,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511545673]
[2024-03-12 00:40:56,896 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:40:56,896 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:40:56,896 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:40:56,897 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:40:56,922 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 00:40:57,105 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:40:57,105 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:40:57,107 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-03-12 00:40:57,116 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:40:57,234 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:40:57,338 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:40:57,339 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:40:58,194 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:40:58,194 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-03-12 00:40:58,201 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:58,202 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-03-12 00:40:58,719 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:58,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:40:58,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:58,729 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:40:58,766 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 00:40:58,841 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 00:40:58,928 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:40:59,013 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:40:59,026 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:40:59,083 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:59,085 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-03-12 00:40:59,116 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:40:59,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:59,193 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:40:59,241 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:59,242 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:40:59,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:59,280 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:40:59,373 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48
[2024-03-12 00:40:59,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:40:59,504 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:40:59,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [511545673] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:59,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:40:59,505 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-12 00:40:59,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227060281]
[2024-03-12 00:40:59,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:59,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-12 00:40:59,506 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:59,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-12 00:40:59,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406
[2024-03-12 00:41:01,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 108 out of 183
[2024-03-12 00:41:01,871 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 387 transitions, 2973 flow. Second operand  has 24 states, 24 states have (on average 110.08333333333333) internal successors, (2642), 24 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:01,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:01,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 183
[2024-03-12 00:41:01,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:06,434 INFO  L124   PetriNetUnfolderBase]: 2334/8255 cut-off events.
[2024-03-12 00:41:06,434 INFO  L125   PetriNetUnfolderBase]: For 25623/25693 co-relation queries the response was YES.
[2024-03-12 00:41:06,472 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28849 conditions, 8255 events. 2334/8255 cut-off events. For 25623/25693 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 83771 event pairs, 421 based on Foata normal form. 27/7897 useless extension candidates. Maximal degree in co-relation 23902. Up to 1615 conditions per place. 
[2024-03-12 00:41:06,490 INFO  L140   encePairwiseOnDemand]: 142/183 looper letters, 779 selfloop transitions, 144 changer transitions 32/1079 dead transitions.
[2024-03-12 00:41:06,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 1079 transitions, 11693 flow
[2024-03-12 00:41:06,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-12 00:41:06,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-12 00:41:06,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4126 transitions.
[2024-03-12 00:41:06,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.644184231069477
[2024-03-12 00:41:06,498 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 4126 transitions.
[2024-03-12 00:41:06,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 4126 transitions.
[2024-03-12 00:41:06,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:06,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4126 transitions.
[2024-03-12 00:41:06,504 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 117.88571428571429) internal successors, (4126), 35 states have internal predecessors, (4126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:06,510 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 183.0) internal successors, (6588), 36 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:06,511 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 183.0) internal successors, (6588), 36 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:06,511 INFO  L175             Difference]: Start difference. First operand has 254 places, 387 transitions, 2973 flow. Second operand 35 states and 4126 transitions.
[2024-03-12 00:41:06,511 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 1079 transitions, 11693 flow
[2024-03-12 00:41:06,668 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 1079 transitions, 11585 flow, removed 30 selfloop flow, removed 9 redundant places.
[2024-03-12 00:41:06,678 INFO  L231             Difference]: Finished difference. Result has 296 places, 516 transitions, 4959 flow
[2024-03-12 00:41:06,678 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=2929, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=4959, PETRI_PLACES=296, PETRI_TRANSITIONS=516}
[2024-03-12 00:41:06,678 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 121 predicate places.
[2024-03-12 00:41:06,678 INFO  L495      AbstractCegarLoop]: Abstraction has has 296 places, 516 transitions, 4959 flow
[2024-03-12 00:41:06,679 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 110.08333333333333) internal successors, (2642), 24 states have internal predecessors, (2642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:06,679 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:06,679 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:06,686 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 00:41:06,880 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-12 00:41:06,880 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:06,881 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:06,881 INFO  L85        PathProgramCache]: Analyzing trace with hash 2038000124, now seen corresponding path program 3 times
[2024-03-12 00:41:06,881 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:06,882 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189318762]
[2024-03-12 00:41:06,882 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:06,882 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:06,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:07,599 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:07,600 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:07,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189318762]
[2024-03-12 00:41:07,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189318762] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:07,600 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138893782]
[2024-03-12 00:41:07,600 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:41:07,600 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:07,600 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:07,601 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:07,604 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 00:41:07,707 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:41:07,708 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:41:07,709 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-12 00:41:07,719 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:07,745 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:07,813 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:07,813 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:41:08,174 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:41:08,174 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:41:08,233 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:08,234 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:41:08,254 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:41:08,315 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:41:08,406 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:08,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:41:08,484 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:08,484 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:41:08,771 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:41:08,840 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:08,841 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:08,875 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:08,875 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:08,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:08,904 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:08,928 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:08,929 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:08,986 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:08,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:08,997 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:08,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138893782] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:08,997 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:08,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:41:08,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309012167]
[2024-03-12 00:41:08,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:08,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:41:08,999 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:08,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:41:09,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:41:09,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-12 00:41:09,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 516 transitions, 4959 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:09,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:09,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-12 00:41:09,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:12,154 INFO  L124   PetriNetUnfolderBase]: 1870/6914 cut-off events.
[2024-03-12 00:41:12,154 INFO  L125   PetriNetUnfolderBase]: For 36330/36477 co-relation queries the response was YES.
[2024-03-12 00:41:12,189 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28502 conditions, 6914 events. 1870/6914 cut-off events. For 36330/36477 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 69101 event pairs, 193 based on Foata normal form. 45/6721 useless extension candidates. Maximal degree in co-relation 27358. Up to 1293 conditions per place. 
[2024-03-12 00:41:12,204 INFO  L140   encePairwiseOnDemand]: 160/183 looper letters, 268 selfloop transitions, 231 changer transitions 28/696 dead transitions.
[2024-03-12 00:41:12,204 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 696 transitions, 7828 flow
[2024-03-12 00:41:12,204 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-12 00:41:12,205 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-12 00:41:12,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3361 transitions.
[2024-03-12 00:41:12,207 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7652550091074681
[2024-03-12 00:41:12,208 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 3361 transitions.
[2024-03-12 00:41:12,208 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 3361 transitions.
[2024-03-12 00:41:12,208 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:12,208 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3361 transitions.
[2024-03-12 00:41:12,212 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 140.04166666666666) internal successors, (3361), 24 states have internal predecessors, (3361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:12,215 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 183.0) internal successors, (4575), 25 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:12,216 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 183.0) internal successors, (4575), 25 states have internal predecessors, (4575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:12,216 INFO  L175             Difference]: Start difference. First operand has 296 places, 516 transitions, 4959 flow. Second operand 24 states and 3361 transitions.
[2024-03-12 00:41:12,216 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 696 transitions, 7828 flow
[2024-03-12 00:41:12,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 696 transitions, 7777 flow, removed 9 selfloop flow, removed 11 redundant places.
[2024-03-12 00:41:12,383 INFO  L231             Difference]: Finished difference. Result has 309 places, 576 transitions, 6368 flow
[2024-03-12 00:41:12,383 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4908, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=6368, PETRI_PLACES=309, PETRI_TRANSITIONS=576}
[2024-03-12 00:41:12,384 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 134 predicate places.
[2024-03-12 00:41:12,384 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 576 transitions, 6368 flow
[2024-03-12 00:41:12,384 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:12,384 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:12,385 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:12,389 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 00:41:12,589 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-12 00:41:12,590 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:12,590 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:12,590 INFO  L85        PathProgramCache]: Analyzing trace with hash 990587550, now seen corresponding path program 4 times
[2024-03-12 00:41:12,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:12,591 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020082912]
[2024-03-12 00:41:12,591 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:12,591 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:12,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:13,278 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:13,278 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:13,278 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020082912]
[2024-03-12 00:41:13,278 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020082912] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:13,279 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174572289]
[2024-03-12 00:41:13,279 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:41:13,279 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:13,279 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:13,280 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:13,282 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 00:41:13,430 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:41:13,430 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:41:13,434 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-12 00:41:13,441 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:13,470 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:13,556 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:13,557 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:41:14,386 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:41:14,386 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:41:14,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:14,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:41:14,714 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:14,715 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:41:14,725 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:14,726 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:41:14,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 00:41:14,837 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 00:41:15,096 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:41:15,105 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:41:15,165 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:41:15,232 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:41:15,317 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:15,318 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:15,351 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:15,352 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:15,376 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:15,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:15,411 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:15,412 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:15,499 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:15,546 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:15,546 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:15,547 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [174572289] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:15,547 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:15,547 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32
[2024-03-12 00:41:15,547 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883984987]
[2024-03-12 00:41:15,548 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:15,548 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 00:41:15,548 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:15,549 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 00:41:15,549 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=924, Unknown=0, NotChecked=0, Total=1056
[2024-03-12 00:41:16,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 126 out of 183
[2024-03-12 00:41:16,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 576 transitions, 6368 flow. Second operand  has 19 states, 19 states have (on average 127.84210526315789) internal successors, (2429), 19 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:16,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:16,791 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 183
[2024-03-12 00:41:16,791 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:21,685 INFO  L124   PetriNetUnfolderBase]: 2424/8646 cut-off events.
[2024-03-12 00:41:21,685 INFO  L125   PetriNetUnfolderBase]: For 59896/60050 co-relation queries the response was YES.
[2024-03-12 00:41:21,737 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37843 conditions, 8646 events. 2424/8646 cut-off events. For 59896/60050 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 88711 event pairs, 315 based on Foata normal form. 83/8447 useless extension candidates. Maximal degree in co-relation 35520. Up to 1491 conditions per place. 
[2024-03-12 00:41:21,758 INFO  L140   encePairwiseOnDemand]: 153/183 looper letters, 726 selfloop transitions, 269 changer transitions 8/1151 dead transitions.
[2024-03-12 00:41:21,759 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1151 transitions, 15126 flow
[2024-03-12 00:41:21,759 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-12 00:41:21,759 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-12 00:41:21,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 4737 transitions.
[2024-03-12 00:41:21,762 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7395784543325526
[2024-03-12 00:41:21,762 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 4737 transitions.
[2024-03-12 00:41:21,762 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 4737 transitions.
[2024-03-12 00:41:21,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:21,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 4737 transitions.
[2024-03-12 00:41:21,768 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 135.34285714285716) internal successors, (4737), 35 states have internal predecessors, (4737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:21,773 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 183.0) internal successors, (6588), 36 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:21,774 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 183.0) internal successors, (6588), 36 states have internal predecessors, (6588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:21,774 INFO  L175             Difference]: Start difference. First operand has 309 places, 576 transitions, 6368 flow. Second operand 35 states and 4737 transitions.
[2024-03-12 00:41:21,774 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 1151 transitions, 15126 flow
[2024-03-12 00:41:22,055 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1151 transitions, 14294 flow, removed 194 selfloop flow, removed 12 redundant places.
[2024-03-12 00:41:22,067 INFO  L231             Difference]: Finished difference. Result has 337 places, 726 transitions, 9357 flow
[2024-03-12 00:41:22,068 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5972, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=576, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=9357, PETRI_PLACES=337, PETRI_TRANSITIONS=726}
[2024-03-12 00:41:22,068 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 162 predicate places.
[2024-03-12 00:41:22,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 337 places, 726 transitions, 9357 flow
[2024-03-12 00:41:22,069 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 127.84210526315789) internal successors, (2429), 19 states have internal predecessors, (2429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:22,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:22,069 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:22,074 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 00:41:22,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:22,270 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:22,271 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:22,271 INFO  L85        PathProgramCache]: Analyzing trace with hash 125816180, now seen corresponding path program 1 times
[2024-03-12 00:41:22,271 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:22,272 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419394519]
[2024-03-12 00:41:22,272 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:22,272 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:22,294 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:22,819 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:22,819 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:22,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419394519]
[2024-03-12 00:41:22,819 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419394519] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:22,819 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368123490]
[2024-03-12 00:41:22,819 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:22,820 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:22,820 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:22,820 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:22,822 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 00:41:22,921 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:22,923 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-03-12 00:41:22,928 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:23,048 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:23,156 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:23,156 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:41:23,867 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:41:23,867 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:41:23,872 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:23,872 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:41:24,072 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:24,073 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:41:24,079 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:24,080 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:41:24,248 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:41:24,252 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:41:24,339 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 00:41:24,378 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 00:41:24,467 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:41:24,536 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:41:24,611 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:24,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:24,663 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:41:24,689 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse0)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse0)) 0)))) is different from false
[2024-03-12 00:41:24,719 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse1)))) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse2) 0)))))) is different from false
[2024-03-12 00:41:24,739 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) (.cse1 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 3 .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3 0) .cse1 0)))) (and (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse3) 0)) (forall ((v_ArrVal_760 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_760) |c_ULTIMATE.start_main_#t~mem21#1.base|) (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| .cse2)) 0)))))) is different from false
[2024-03-12 00:41:25,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 122
[2024-03-12 00:41:25,622 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-03-12 00:41:25,627 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-12 00:41:25,668 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-03-12 00:41:25,753 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:25,753 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39
[2024-03-12 00:41:25,804 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:25,804 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368123490] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:41:25,804 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:41:25,804 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 49
[2024-03-12 00:41:25,804 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877437467]
[2024-03-12 00:41:25,804 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:41:25,805 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-03-12 00:41:25,805 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:25,806 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-03-12 00:41:25,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1908, Unknown=21, NotChecked=276, Total=2450
[2024-03-12 00:41:25,809 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 183
[2024-03-12 00:41:25,811 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 726 transitions, 9357 flow. Second operand  has 50 states, 50 states have (on average 94.04) internal successors, (4702), 50 states have internal predecessors, (4702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:25,811 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:25,811 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 183
[2024-03-12 00:41:25,811 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:34,889 INFO  L124   PetriNetUnfolderBase]: 2876/10959 cut-off events.
[2024-03-12 00:41:34,889 INFO  L125   PetriNetUnfolderBase]: For 81700/81725 co-relation queries the response was YES.
[2024-03-12 00:41:34,964 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47425 conditions, 10959 events. 2876/10959 cut-off events. For 81700/81725 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 119112 event pairs, 239 based on Foata normal form. 78/10691 useless extension candidates. Maximal degree in co-relation 47111. Up to 1527 conditions per place. 
[2024-03-12 00:41:34,987 INFO  L140   encePairwiseOnDemand]: 148/183 looper letters, 744 selfloop transitions, 177 changer transitions 446/1493 dead transitions.
[2024-03-12 00:41:34,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1493 transitions, 21341 flow
[2024-03-12 00:41:34,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. 
[2024-03-12 00:41:34,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 63 states.
[2024-03-12 00:41:34,994 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 6202 transitions.
[2024-03-12 00:41:34,996 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5379477838494232
[2024-03-12 00:41:34,996 INFO  L72            ComplementDD]: Start complementDD. Operand 63 states and 6202 transitions.
[2024-03-12 00:41:34,996 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 63 states and 6202 transitions.
[2024-03-12 00:41:34,998 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:34,998 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 63 states and 6202 transitions.
[2024-03-12 00:41:35,004 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 64 states, 63 states have (on average 98.44444444444444) internal successors, (6202), 63 states have internal predecessors, (6202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:35,013 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 64 states, 64 states have (on average 183.0) internal successors, (11712), 64 states have internal predecessors, (11712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:35,014 INFO  L81            ComplementDD]: Finished complementDD. Result  has 64 states, 64 states have (on average 183.0) internal successors, (11712), 64 states have internal predecessors, (11712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:35,014 INFO  L175             Difference]: Start difference. First operand has 337 places, 726 transitions, 9357 flow. Second operand 63 states and 6202 transitions.
[2024-03-12 00:41:35,014 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 1493 transitions, 21341 flow
[2024-03-12 00:41:35,511 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1493 transitions, 21036 flow, removed 73 selfloop flow, removed 18 redundant places.
[2024-03-12 00:41:35,525 INFO  L231             Difference]: Finished difference. Result has 383 places, 557 transitions, 5527 flow
[2024-03-12 00:41:35,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=9127, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=5527, PETRI_PLACES=383, PETRI_TRANSITIONS=557}
[2024-03-12 00:41:35,526 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 208 predicate places.
[2024-03-12 00:41:35,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 383 places, 557 transitions, 5527 flow
[2024-03-12 00:41:35,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 50 states, 50 states have (on average 94.04) internal successors, (4702), 50 states have internal predecessors, (4702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:35,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:35,527 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:35,533 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-12 00:41:35,728 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:35,729 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:35,729 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:35,729 INFO  L85        PathProgramCache]: Analyzing trace with hash 755502762, now seen corresponding path program 5 times
[2024-03-12 00:41:35,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:35,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384416793]
[2024-03-12 00:41:35,730 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:35,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:35,753 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:36,429 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:36,430 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:36,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384416793]
[2024-03-12 00:41:36,430 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384416793] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:36,430 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [970958676]
[2024-03-12 00:41:36,430 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 00:41:36,430 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:36,430 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:36,431 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:36,437 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-12 00:41:36,573 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:41:36,573 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:41:36,575 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-03-12 00:41:36,580 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:36,584 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:36,618 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:41:36,619 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:41:36,692 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:41:36,693 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 00:41:36,923 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:41:36,923 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-12 00:41:36,978 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-03-12 00:41:37,024 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:41:37,075 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12
[2024-03-12 00:41:37,111 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15
[2024-03-12 00:41:37,126 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:41:37,175 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25
[2024-03-12 00:41:37,189 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25
[2024-03-12 00:41:37,200 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25
[2024-03-12 00:41:37,236 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:37,236 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:41:37,281 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:37,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:41:37,325 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:37,335 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:41:37,335 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:37,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [970958676] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:37,335 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:37,335 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 23
[2024-03-12 00:41:37,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137426244]
[2024-03-12 00:41:37,336 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:37,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:41:37,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:37,336 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:41:37,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552
[2024-03-12 00:41:38,279 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 183
[2024-03-12 00:41:38,280 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 557 transitions, 5527 flow. Second operand  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:38,280 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:38,280 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 183
[2024-03-12 00:41:38,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:40,607 INFO  L124   PetriNetUnfolderBase]: 1663/7010 cut-off events.
[2024-03-12 00:41:40,607 INFO  L125   PetriNetUnfolderBase]: For 40779/41080 co-relation queries the response was YES.
[2024-03-12 00:41:40,668 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27538 conditions, 7010 events. 1663/7010 cut-off events. For 40779/41080 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 72164 event pairs, 208 based on Foata normal form. 100/6843 useless extension candidates. Maximal degree in co-relation 27216. Up to 938 conditions per place. 
[2024-03-12 00:41:40,684 INFO  L140   encePairwiseOnDemand]: 163/183 looper letters, 320 selfloop transitions, 172 changer transitions 51/734 dead transitions.
[2024-03-12 00:41:40,684 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 734 transitions, 8779 flow
[2024-03-12 00:41:40,685 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-12 00:41:40,761 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-12 00:41:40,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2641 transitions.
[2024-03-12 00:41:40,763 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7595628415300546
[2024-03-12 00:41:40,763 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2641 transitions.
[2024-03-12 00:41:40,763 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2641 transitions.
[2024-03-12 00:41:40,764 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:40,764 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2641 transitions.
[2024-03-12 00:41:40,766 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 139.0) internal successors, (2641), 19 states have internal predecessors, (2641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:40,769 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:40,769 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 183.0) internal successors, (3660), 20 states have internal predecessors, (3660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:40,769 INFO  L175             Difference]: Start difference. First operand has 383 places, 557 transitions, 5527 flow. Second operand 19 states and 2641 transitions.
[2024-03-12 00:41:40,769 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 734 transitions, 8779 flow
[2024-03-12 00:41:40,975 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 362 places, 734 transitions, 8047 flow, removed 256 selfloop flow, removed 29 redundant places.
[2024-03-12 00:41:40,983 INFO  L231             Difference]: Finished difference. Result has 368 places, 582 transitions, 6016 flow
[2024-03-12 00:41:40,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5104, PETRI_DIFFERENCE_MINUEND_PLACES=344, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=6016, PETRI_PLACES=368, PETRI_TRANSITIONS=582}
[2024-03-12 00:41:40,984 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 193 predicate places.
[2024-03-12 00:41:40,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 582 transitions, 6016 flow
[2024-03-12 00:41:40,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:40,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:40,985 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:40,990 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0
[2024-03-12 00:41:41,189 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:41,189 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:41,190 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:41,190 INFO  L85        PathProgramCache]: Analyzing trace with hash -576387986, now seen corresponding path program 6 times
[2024-03-12 00:41:41,190 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:41,190 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401538404]
[2024-03-12 00:41:41,190 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:41,191 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:41,215 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:41,704 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:41,705 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:41,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401538404]
[2024-03-12 00:41:41,705 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401538404] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:41,705 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930823494]
[2024-03-12 00:41:41,705 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-12 00:41:41,705 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:41,706 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:41,707 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:41,709 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-12 00:41:41,849 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-12 00:41:41,849 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:41:41,851 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-03-12 00:41:41,856 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:41,862 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:41,900 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:41:41,900 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:41:41,961 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:41,965 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:41,965 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-12 00:41:42,472 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:41:42,473 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44
[2024-03-12 00:41:42,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-03-12 00:41:42,706 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:42,706 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:41:42,712 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:42,712 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-03-12 00:41:42,831 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 00:41:42,869 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 00:41:42,966 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:41:43,076 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-12 00:41:43,080 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:41:43,137 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:41:43,196 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:43,197 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:43,228 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:43,228 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:43,256 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:43,257 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:43,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:43,279 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:43,355 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:41:43,394 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:43,394 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:43,394 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [930823494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:43,395 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:43,395 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32
[2024-03-12 00:41:43,395 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995208378]
[2024-03-12 00:41:43,395 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:43,395 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 00:41:43,396 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:43,396 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 00:41:43,396 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056
[2024-03-12 00:41:44,624 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 183
[2024-03-12 00:41:44,625 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 582 transitions, 6016 flow. Second operand  has 19 states, 19 states have (on average 126.84210526315789) internal successors, (2410), 19 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:44,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:44,625 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 183
[2024-03-12 00:41:44,625 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:48,406 INFO  L124   PetriNetUnfolderBase]: 1796/7169 cut-off events.
[2024-03-12 00:41:48,406 INFO  L125   PetriNetUnfolderBase]: For 39262/39433 co-relation queries the response was YES.
[2024-03-12 00:41:48,448 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27383 conditions, 7169 events. 1796/7169 cut-off events. For 39262/39433 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 73676 event pairs, 395 based on Foata normal form. 60/6948 useless extension candidates. Maximal degree in co-relation 27054. Up to 1945 conditions per place. 
[2024-03-12 00:41:48,462 INFO  L140   encePairwiseOnDemand]: 158/183 looper letters, 495 selfloop transitions, 169 changer transitions 57/876 dead transitions.
[2024-03-12 00:41:48,462 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 876 transitions, 9944 flow
[2024-03-12 00:41:48,463 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2024-03-12 00:41:48,463 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2024-03-12 00:41:48,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 5051 transitions.
[2024-03-12 00:41:48,466 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7263445498993385
[2024-03-12 00:41:48,466 INFO  L72            ComplementDD]: Start complementDD. Operand 38 states and 5051 transitions.
[2024-03-12 00:41:48,466 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 5051 transitions.
[2024-03-12 00:41:48,467 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:48,467 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 5051 transitions.
[2024-03-12 00:41:48,472 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 39 states, 38 states have (on average 132.92105263157896) internal successors, (5051), 38 states have internal predecessors, (5051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:48,477 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 39 states, 39 states have (on average 183.0) internal successors, (7137), 39 states have internal predecessors, (7137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:48,477 INFO  L81            ComplementDD]: Finished complementDD. Result  has 39 states, 39 states have (on average 183.0) internal successors, (7137), 39 states have internal predecessors, (7137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:48,477 INFO  L175             Difference]: Start difference. First operand has 368 places, 582 transitions, 6016 flow. Second operand 38 states and 5051 transitions.
[2024-03-12 00:41:48,477 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 876 transitions, 9944 flow
[2024-03-12 00:41:48,687 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 393 places, 876 transitions, 9536 flow, removed 113 selfloop flow, removed 12 redundant places.
[2024-03-12 00:41:48,696 INFO  L231             Difference]: Finished difference. Result has 399 places, 621 transitions, 6642 flow
[2024-03-12 00:41:48,697 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5629, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=137, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=6642, PETRI_PLACES=399, PETRI_TRANSITIONS=621}
[2024-03-12 00:41:48,697 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 224 predicate places.
[2024-03-12 00:41:48,697 INFO  L495      AbstractCegarLoop]: Abstraction has has 399 places, 621 transitions, 6642 flow
[2024-03-12 00:41:48,697 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 126.84210526315789) internal successors, (2410), 19 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:48,697 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:48,697 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:48,705 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-12 00:41:48,898 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-03-12 00:41:48,899 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:48,899 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:48,900 INFO  L85        PathProgramCache]: Analyzing trace with hash -1217076836, now seen corresponding path program 1 times
[2024-03-12 00:41:48,900 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:48,900 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897699552]
[2024-03-12 00:41:48,900 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:48,900 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:48,926 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:49,584 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:49,585 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:49,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897699552]
[2024-03-12 00:41:49,585 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897699552] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:49,585 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119733292]
[2024-03-12 00:41:49,585 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:49,585 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:49,585 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:49,586 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:49,587 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-12 00:41:49,717 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:49,719 INFO  L262         TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 36 conjunts are in the unsatisfiable core
[2024-03-12 00:41:49,725 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:49,733 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:49,758 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:41:49,758 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:41:49,858 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:49,865 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:49,865 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-12 00:41:50,188 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:41:50,189 INFO  L378             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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-12 00:41:50,276 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:50,277 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-03-12 00:41:50,293 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:41:50,337 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:41:50,392 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:50,392 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:41:50,497 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-12 00:41:50,552 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:50,553 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-03-12 00:41:50,576 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:50,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:41:50,644 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:50,644 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:50,664 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:50,665 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:50,686 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:50,686 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:50,726 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:50,735 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:41:50,735 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:50,735 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119733292] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:50,735 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:50,735 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-03-12 00:41:50,735 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986007072]
[2024-03-12 00:41:50,735 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:50,736 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:41:50,736 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:50,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:41:50,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650
[2024-03-12 00:41:51,812 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 132 out of 183
[2024-03-12 00:41:51,813 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 621 transitions, 6642 flow. Second operand  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:51,813 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:51,813 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 183
[2024-03-12 00:41:51,813 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:54,277 INFO  L124   PetriNetUnfolderBase]: 1524/6795 cut-off events.
[2024-03-12 00:41:54,277 INFO  L125   PetriNetUnfolderBase]: For 38831/39022 co-relation queries the response was YES.
[2024-03-12 00:41:54,324 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 25436 conditions, 6795 events. 1524/6795 cut-off events. For 38831/39022 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 69809 event pairs, 171 based on Foata normal form. 106/6652 useless extension candidates. Maximal degree in co-relation 25149. Up to 779 conditions per place. 
[2024-03-12 00:41:54,337 INFO  L140   encePairwiseOnDemand]: 163/183 looper letters, 265 selfloop transitions, 273 changer transitions 3/738 dead transitions.
[2024-03-12 00:41:54,338 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 738 transitions, 8814 flow
[2024-03-12 00:41:54,339 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-12 00:41:54,339 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-12 00:41:54,342 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3196 transitions.
[2024-03-12 00:41:54,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7593252554050843
[2024-03-12 00:41:54,344 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 3196 transitions.
[2024-03-12 00:41:54,344 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 3196 transitions.
[2024-03-12 00:41:54,346 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:41:54,346 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3196 transitions.
[2024-03-12 00:41:54,351 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 138.95652173913044) internal successors, (3196), 23 states have internal predecessors, (3196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:54,355 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 183.0) internal successors, (4392), 24 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:54,356 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 183.0) internal successors, (4392), 24 states have internal predecessors, (4392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:54,356 INFO  L175             Difference]: Start difference. First operand has 399 places, 621 transitions, 6642 flow. Second operand 23 states and 3196 transitions.
[2024-03-12 00:41:54,356 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 738 transitions, 8814 flow
[2024-03-12 00:41:54,573 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 738 transitions, 8477 flow, removed 87 selfloop flow, removed 26 redundant places.
[2024-03-12 00:41:54,582 INFO  L231             Difference]: Finished difference. Result has 393 places, 638 transitions, 7380 flow
[2024-03-12 00:41:54,583 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6339, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=256, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7380, PETRI_PLACES=393, PETRI_TRANSITIONS=638}
[2024-03-12 00:41:54,583 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 218 predicate places.
[2024-03-12 00:41:54,584 INFO  L495      AbstractCegarLoop]: Abstraction has has 393 places, 638 transitions, 7380 flow
[2024-03-12 00:41:54,584 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 134.06666666666666) internal successors, (2011), 15 states have internal predecessors, (2011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:54,584 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:41:54,584 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:41:54,589 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-12 00:41:54,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22
[2024-03-12 00:41:54,790 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:41:54,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:41:54,791 INFO  L85        PathProgramCache]: Analyzing trace with hash -1858697216, now seen corresponding path program 2 times
[2024-03-12 00:41:54,791 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:41:54,791 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919226768]
[2024-03-12 00:41:54,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:41:54,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:41:54,812 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:41:55,439 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:55,439 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:41:55,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919226768]
[2024-03-12 00:41:55,439 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919226768] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:41:55,439 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011168229]
[2024-03-12 00:41:55,439 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:41:55,439 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:41:55,440 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:41:55,441 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:41:55,442 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-12 00:41:55,605 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:41:55,606 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:41:55,607 INFO  L262         TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-12 00:41:55,611 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:41:55,635 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:41:55,696 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:41:55,696 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:41:56,044 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:41:56,044 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:41:56,100 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:56,101 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:41:56,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:41:56,169 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:41:56,310 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:41:56,359 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:56,359 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:41:56,420 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:41:56,420 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:41:56,498 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:56,499 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:56,520 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:56,521 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:56,545 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:56,546 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:56,575 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:41:56,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:56,614 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:41:56,623 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:41:56,623 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:41:56,623 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011168229] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:41:56,623 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:41:56,623 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:41:56,623 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93676282]
[2024-03-12 00:41:56,623 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:41:56,624 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:41:56,624 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:41:56,624 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:41:56,624 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:41:57,522 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 183
[2024-03-12 00:41:57,523 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 393 places, 638 transitions, 7380 flow. Second operand  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:41:57,523 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:41:57,523 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 183
[2024-03-12 00:41:57,523 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:00,030 INFO  L124   PetriNetUnfolderBase]: 1515/6836 cut-off events.
[2024-03-12 00:42:00,030 INFO  L125   PetriNetUnfolderBase]: For 46850/47053 co-relation queries the response was YES.
[2024-03-12 00:42:00,087 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26608 conditions, 6836 events. 1515/6836 cut-off events. For 46850/47053 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 70602 event pairs, 172 based on Foata normal form. 96/6686 useless extension candidates. Maximal degree in co-relation 26306. Up to 803 conditions per place. 
[2024-03-12 00:42:00,100 INFO  L140   encePairwiseOnDemand]: 163/183 looper letters, 288 selfloop transitions, 204 changer transitions 66/755 dead transitions.
[2024-03-12 00:42:00,100 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 755 transitions, 9718 flow
[2024-03-12 00:42:00,101 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-12 00:42:00,101 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-12 00:42:00,103 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2937 transitions.
[2024-03-12 00:42:00,103 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7642466822794691
[2024-03-12 00:42:00,103 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 2937 transitions.
[2024-03-12 00:42:00,103 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 2937 transitions.
[2024-03-12 00:42:00,104 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:00,104 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2937 transitions.
[2024-03-12 00:42:00,107 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 139.85714285714286) internal successors, (2937), 21 states have internal predecessors, (2937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:00,109 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 183.0) internal successors, (4026), 22 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:00,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 183.0) internal successors, (4026), 22 states have internal predecessors, (4026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:00,109 INFO  L175             Difference]: Start difference. First operand has 393 places, 638 transitions, 7380 flow. Second operand 21 states and 2937 transitions.
[2024-03-12 00:42:00,110 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 755 transitions, 9718 flow
[2024-03-12 00:42:00,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 755 transitions, 9363 flow, removed 22 selfloop flow, removed 16 redundant places.
[2024-03-12 00:42:00,352 INFO  L231             Difference]: Finished difference. Result has 402 places, 607 transitions, 7321 flow
[2024-03-12 00:42:00,353 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7027, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=7321, PETRI_PLACES=402, PETRI_TRANSITIONS=607}
[2024-03-12 00:42:00,353 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 227 predicate places.
[2024-03-12 00:42:00,353 INFO  L495      AbstractCegarLoop]: Abstraction has has 402 places, 607 transitions, 7321 flow
[2024-03-12 00:42:00,354 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 135.06666666666666) internal successors, (2026), 15 states have internal predecessors, (2026), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:00,354 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:00,354 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:00,359 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-12 00:42:00,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:00,558 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:00,558 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:00,559 INFO  L85        PathProgramCache]: Analyzing trace with hash 244733296, now seen corresponding path program 1 times
[2024-03-12 00:42:00,559 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:00,559 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265797218]
[2024-03-12 00:42:00,559 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:00,559 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:00,577 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:00,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:00,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:00,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265797218]
[2024-03-12 00:42:00,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265797218] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:00,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:00,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-03-12 00:42:00,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073104222]
[2024-03-12 00:42:00,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:00,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-03-12 00:42:00,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:00,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-03-12 00:42:00,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56
[2024-03-12 00:42:00,825 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 156 out of 183
[2024-03-12 00:42:00,825 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 607 transitions, 7321 flow. Second operand  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:00,826 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:00,826 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 183
[2024-03-12 00:42:00,826 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:02,291 INFO  L124   PetriNetUnfolderBase]: 1790/7959 cut-off events.
[2024-03-12 00:42:02,292 INFO  L125   PetriNetUnfolderBase]: For 43332/43436 co-relation queries the response was YES.
[2024-03-12 00:42:02,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26964 conditions, 7959 events. 1790/7959 cut-off events. For 43332/43436 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 85552 event pairs, 319 based on Foata normal form. 136/7904 useless extension candidates. Maximal degree in co-relation 26722. Up to 1268 conditions per place. 
[2024-03-12 00:42:02,389 INFO  L140   encePairwiseOnDemand]: 169/183 looper letters, 65 selfloop transitions, 35 changer transitions 2/680 dead transitions.
[2024-03-12 00:42:02,389 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 680 transitions, 7717 flow
[2024-03-12 00:42:02,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-12 00:42:02,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-12 00:42:02,390 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2449 transitions.
[2024-03-12 00:42:02,391 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8921675774134791
[2024-03-12 00:42:02,391 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2449 transitions.
[2024-03-12 00:42:02,391 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2449 transitions.
[2024-03-12 00:42:02,392 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:02,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2449 transitions.
[2024-03-12 00:42:02,394 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 163.26666666666668) internal successors, (2449), 15 states have internal predecessors, (2449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:02,395 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:02,396 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:02,396 INFO  L175             Difference]: Start difference. First operand has 402 places, 607 transitions, 7321 flow. Second operand 15 states and 2449 transitions.
[2024-03-12 00:42:02,396 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 680 transitions, 7717 flow
[2024-03-12 00:42:02,758 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 392 places, 680 transitions, 7227 flow, removed 61 selfloop flow, removed 24 redundant places.
[2024-03-12 00:42:02,766 INFO  L231             Difference]: Finished difference. Result has 403 places, 636 transitions, 7060 flow
[2024-03-12 00:42:02,766 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6831, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=593, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7060, PETRI_PLACES=403, PETRI_TRANSITIONS=636}
[2024-03-12 00:42:02,766 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 228 predicate places.
[2024-03-12 00:42:02,766 INFO  L495      AbstractCegarLoop]: Abstraction has has 403 places, 636 transitions, 7060 flow
[2024-03-12 00:42:02,767 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 157.625) internal successors, (1261), 8 states have internal predecessors, (1261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:02,767 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:02,767 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:02,767 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24
[2024-03-12 00:42:02,767 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:02,767 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:02,767 INFO  L85        PathProgramCache]: Analyzing trace with hash -9208088, now seen corresponding path program 1 times
[2024-03-12 00:42:02,767 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:02,768 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553847404]
[2024-03-12 00:42:02,768 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:02,768 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:02,783 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:02,984 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:02,985 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:02,985 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553847404]
[2024-03-12 00:42:02,985 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553847404] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:02,985 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:02,985 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:42:02,985 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029191431]
[2024-03-12 00:42:02,985 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:02,986 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:42:02,986 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:02,986 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:42:02,986 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:42:03,122 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 157 out of 183
[2024-03-12 00:42:03,123 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 403 places, 636 transitions, 7060 flow. Second operand  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:03,123 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:03,124 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 183
[2024-03-12 00:42:03,124 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:05,082 INFO  L124   PetriNetUnfolderBase]: 2011/9151 cut-off events.
[2024-03-12 00:42:05,083 INFO  L125   PetriNetUnfolderBase]: For 46990/47209 co-relation queries the response was YES.
[2024-03-12 00:42:05,165 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31918 conditions, 9151 events. 2011/9151 cut-off events. For 46990/47209 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 103133 event pairs, 301 based on Foata normal form. 135/9066 useless extension candidates. Maximal degree in co-relation 31685. Up to 1332 conditions per place. 
[2024-03-12 00:42:05,184 INFO  L140   encePairwiseOnDemand]: 169/183 looper letters, 89 selfloop transitions, 35 changer transitions 0/704 dead transitions.
[2024-03-12 00:42:05,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 704 transitions, 7726 flow
[2024-03-12 00:42:05,185 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-12 00:42:05,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-12 00:42:05,199 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2460 transitions.
[2024-03-12 00:42:05,201 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8961748633879781
[2024-03-12 00:42:05,201 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2460 transitions.
[2024-03-12 00:42:05,201 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2460 transitions.
[2024-03-12 00:42:05,201 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:05,201 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2460 transitions.
[2024-03-12 00:42:05,204 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 164.0) internal successors, (2460), 15 states have internal predecessors, (2460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:05,206 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:05,207 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:05,207 INFO  L175             Difference]: Start difference. First operand has 403 places, 636 transitions, 7060 flow. Second operand 15 states and 2460 transitions.
[2024-03-12 00:42:05,207 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 416 places, 704 transitions, 7726 flow
[2024-03-12 00:42:05,525 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 704 transitions, 7619 flow, removed 12 selfloop flow, removed 5 redundant places.
[2024-03-12 00:42:05,533 INFO  L231             Difference]: Finished difference. Result has 420 places, 669 transitions, 7343 flow
[2024-03-12 00:42:05,534 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=6957, PETRI_DIFFERENCE_MINUEND_PLACES=397, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=636, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7343, PETRI_PLACES=420, PETRI_TRANSITIONS=669}
[2024-03-12 00:42:05,534 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 245 predicate places.
[2024-03-12 00:42:05,534 INFO  L495      AbstractCegarLoop]: Abstraction has has 420 places, 669 transitions, 7343 flow
[2024-03-12 00:42:05,535 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 158.71428571428572) internal successors, (1111), 7 states have internal predecessors, (1111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:05,535 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:05,535 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:05,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25
[2024-03-12 00:42:05,535 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:05,535 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:05,535 INFO  L85        PathProgramCache]: Analyzing trace with hash -1673861368, now seen corresponding path program 1 times
[2024-03-12 00:42:05,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:05,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163569794]
[2024-03-12 00:42:05,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:05,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:05,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:05,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:05,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:05,680 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163569794]
[2024-03-12 00:42:05,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163569794] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:05,681 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:05,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-03-12 00:42:05,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443399333]
[2024-03-12 00:42:05,681 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:05,681 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:42:05,681 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:05,682 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:42:05,682 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42
[2024-03-12 00:42:05,793 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 183
[2024-03-12 00:42:05,793 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 669 transitions, 7343 flow. Second operand  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:05,793 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:05,793 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 183
[2024-03-12 00:42:05,794 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:07,813 INFO  L124   PetriNetUnfolderBase]: 1954/9175 cut-off events.
[2024-03-12 00:42:07,814 INFO  L125   PetriNetUnfolderBase]: For 51891/52191 co-relation queries the response was YES.
[2024-03-12 00:42:07,890 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 33310 conditions, 9175 events. 1954/9175 cut-off events. For 51891/52191 co-relation queries the response was YES. Maximal size of possible extension queue 388. Compared 104374 event pairs, 281 based on Foata normal form. 112/9065 useless extension candidates. Maximal degree in co-relation 33070. Up to 1289 conditions per place. 
[2024-03-12 00:42:07,911 INFO  L140   encePairwiseOnDemand]: 171/183 looper letters, 83 selfloop transitions, 46 changer transitions 0/710 dead transitions.
[2024-03-12 00:42:07,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 710 transitions, 7932 flow
[2024-03-12 00:42:07,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-12 00:42:07,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-12 00:42:07,915 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2463 transitions.
[2024-03-12 00:42:07,918 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8972677595628415
[2024-03-12 00:42:07,918 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 2463 transitions.
[2024-03-12 00:42:07,918 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 2463 transitions.
[2024-03-12 00:42:07,920 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:07,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 2463 transitions.
[2024-03-12 00:42:07,926 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 164.2) internal successors, (2463), 15 states have internal predecessors, (2463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:07,927 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:07,928 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 183.0) internal successors, (2928), 16 states have internal predecessors, (2928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:07,928 INFO  L175             Difference]: Start difference. First operand has 420 places, 669 transitions, 7343 flow. Second operand 15 states and 2463 transitions.
[2024-03-12 00:42:07,928 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 710 transitions, 7932 flow
[2024-03-12 00:42:08,232 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 710 transitions, 7768 flow, removed 78 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:08,241 INFO  L231             Difference]: Finished difference. Result has 435 places, 684 transitions, 7424 flow
[2024-03-12 00:42:08,242 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7215, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=636, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7424, PETRI_PLACES=435, PETRI_TRANSITIONS=684}
[2024-03-12 00:42:08,242 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 260 predicate places.
[2024-03-12 00:42:08,242 INFO  L495      AbstractCegarLoop]: Abstraction has has 435 places, 684 transitions, 7424 flow
[2024-03-12 00:42:08,243 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 159.71428571428572) internal successors, (1118), 7 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:08,243 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:08,243 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:08,243 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 00:42:08,243 INFO  L420      AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:08,244 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:08,244 INFO  L85        PathProgramCache]: Analyzing trace with hash -59164576, now seen corresponding path program 1 times
[2024-03-12 00:42:08,244 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:08,244 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607711958]
[2024-03-12 00:42:08,244 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:08,244 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:08,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:08,333 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-03-12 00:42:08,333 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:08,333 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607711958]
[2024-03-12 00:42:08,333 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607711958] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:08,333 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:08,333 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:42:08,333 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92438802]
[2024-03-12 00:42:08,333 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:08,334 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:08,334 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:08,334 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:08,334 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:08,361 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 183
[2024-03-12 00:42:08,362 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 684 transitions, 7424 flow. Second operand  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:08,362 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:08,362 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 183
[2024-03-12 00:42:08,362 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:10,005 INFO  L124   PetriNetUnfolderBase]: 1599/8924 cut-off events.
[2024-03-12 00:42:10,005 INFO  L125   PetriNetUnfolderBase]: For 51016/51240 co-relation queries the response was YES.
[2024-03-12 00:42:10,089 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 31563 conditions, 8924 events. 1599/8924 cut-off events. For 51016/51240 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 104757 event pairs, 117 based on Foata normal form. 114/8834 useless extension candidates. Maximal degree in co-relation 31321. Up to 775 conditions per place. 
[2024-03-12 00:42:10,105 INFO  L140   encePairwiseOnDemand]: 180/183 looper letters, 13 selfloop transitions, 6 changer transitions 125/685 dead transitions.
[2024-03-12 00:42:10,106 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 685 transitions, 7464 flow
[2024-03-12 00:42:10,106 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:10,106 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:10,107 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions.
[2024-03-12 00:42:10,107 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9581056466302368
[2024-03-12 00:42:10,107 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 526 transitions.
[2024-03-12 00:42:10,107 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions.
[2024-03-12 00:42:10,108 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:10,108 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions.
[2024-03-12 00:42:10,108 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:10,109 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:10,109 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:10,109 INFO  L175             Difference]: Start difference. First operand has 435 places, 684 transitions, 7424 flow. Second operand 3 states and 526 transitions.
[2024-03-12 00:42:10,109 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 685 transitions, 7464 flow
[2024-03-12 00:42:10,419 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 685 transitions, 7434 flow, removed 6 selfloop flow, removed 5 redundant places.
[2024-03-12 00:42:10,425 INFO  L231             Difference]: Finished difference. Result has 433 places, 560 transitions, 5325 flow
[2024-03-12 00:42:10,426 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=7394, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5325, PETRI_PLACES=433, PETRI_TRANSITIONS=560}
[2024-03-12 00:42:10,427 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 258 predicate places.
[2024-03-12 00:42:10,427 INFO  L495      AbstractCegarLoop]: Abstraction has has 433 places, 560 transitions, 5325 flow
[2024-03-12 00:42:10,427 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:10,427 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:10,427 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1]
[2024-03-12 00:42:10,428 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 00:42:10,428 INFO  L420      AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:10,428 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:10,428 INFO  L85        PathProgramCache]: Analyzing trace with hash 280235922, now seen corresponding path program 1 times
[2024-03-12 00:42:10,429 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:10,429 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748054280]
[2024-03-12 00:42:10,429 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:10,429 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:10,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:10,508 INFO  L134       CoverageAnalysis]: Checked inductivity of 28 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-03-12 00:42:10,508 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:10,509 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748054280]
[2024-03-12 00:42:10,509 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748054280] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:10,509 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:10,509 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-03-12 00:42:10,509 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279117686]
[2024-03-12 00:42:10,509 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:10,510 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:10,510 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:10,510 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:10,510 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:10,582 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 183
[2024-03-12 00:42:10,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 560 transitions, 5325 flow. Second operand  has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:10,583 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:10,583 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 183
[2024-03-12 00:42:10,583 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:12,466 INFO  L124   PetriNetUnfolderBase]: 1482/8806 cut-off events.
[2024-03-12 00:42:12,466 INFO  L125   PetriNetUnfolderBase]: For 38622/38935 co-relation queries the response was YES.
[2024-03-12 00:42:12,555 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29651 conditions, 8806 events. 1482/8806 cut-off events. For 38622/38935 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 104798 event pairs, 103 based on Foata normal form. 102/8683 useless extension candidates. Maximal degree in co-relation 29530. Up to 589 conditions per place. 
[2024-03-12 00:42:12,572 INFO  L140   encePairwiseOnDemand]: 172/183 looper letters, 49 selfloop transitions, 84 changer transitions 0/609 dead transitions.
[2024-03-12 00:42:12,573 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 609 transitions, 6010 flow
[2024-03-12 00:42:12,573 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2024-03-12 00:42:12,574 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2024-03-12 00:42:12,574 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1503 transitions.
[2024-03-12 00:42:12,575 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.912568306010929
[2024-03-12 00:42:12,575 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 1503 transitions.
[2024-03-12 00:42:12,575 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 1503 transitions.
[2024-03-12 00:42:12,575 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:12,575 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1503 transitions.
[2024-03-12 00:42:12,577 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 167.0) internal successors, (1503), 9 states have internal predecessors, (1503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:12,578 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:12,578 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 183.0) internal successors, (1830), 10 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:12,578 INFO  L175             Difference]: Start difference. First operand has 433 places, 560 transitions, 5325 flow. Second operand 9 states and 1503 transitions.
[2024-03-12 00:42:12,578 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 609 transitions, 6010 flow
[2024-03-12 00:42:12,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 609 transitions, 5453 flow, removed 39 selfloop flow, removed 35 redundant places.
[2024-03-12 00:42:12,838 INFO  L231             Difference]: Finished difference. Result has 383 places, 596 transitions, 5351 flow
[2024-03-12 00:42:12,839 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=4768, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=5351, PETRI_PLACES=383, PETRI_TRANSITIONS=596}
[2024-03-12 00:42:12,839 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 208 predicate places.
[2024-03-12 00:42:12,839 INFO  L495      AbstractCegarLoop]: Abstraction has has 383 places, 596 transitions, 5351 flow
[2024-03-12 00:42:12,839 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:12,839 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:12,840 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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]
[2024-03-12 00:42:12,840 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 00:42:12,840 INFO  L420      AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:12,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:12,840 INFO  L85        PathProgramCache]: Analyzing trace with hash -881120131, now seen corresponding path program 1 times
[2024-03-12 00:42:12,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:12,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458197194]
[2024-03-12 00:42:12,841 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:12,841 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:12,854 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:12,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:12,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:12,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458197194]
[2024-03-12 00:42:12,925 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458197194] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:42:12,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109782942]
[2024-03-12 00:42:12,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:12,925 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:12,925 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:42:12,926 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:42:12,927 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-12 00:42:13,057 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:13,059 INFO  L262         TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-12 00:42:13,061 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:42:13,189 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:13,189 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:42:13,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 29 backedges. 17 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:13,341 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109782942] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:42:13,341 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:42:13,341 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-03-12 00:42:13,342 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552517721]
[2024-03-12 00:42:13,342 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:42:13,342 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-12 00:42:13,342 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:13,343 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-12 00:42:13,343 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-03-12 00:42:13,560 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 163 out of 183
[2024-03-12 00:42:13,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 596 transitions, 5351 flow. Second operand  has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:13,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:13,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 183
[2024-03-12 00:42:13,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:15,300 INFO  L124   PetriNetUnfolderBase]: 1510/9176 cut-off events.
[2024-03-12 00:42:15,301 INFO  L125   PetriNetUnfolderBase]: For 33630/34040 co-relation queries the response was YES.
[2024-03-12 00:42:15,371 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30801 conditions, 9176 events. 1510/9176 cut-off events. For 33630/34040 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 110944 event pairs, 107 based on Foata normal form. 79/8988 useless extension candidates. Maximal degree in co-relation 30581. Up to 912 conditions per place. 
[2024-03-12 00:42:15,388 INFO  L140   encePairwiseOnDemand]: 173/183 looper letters, 102 selfloop transitions, 27 changer transitions 0/614 dead transitions.
[2024-03-12 00:42:15,388 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 614 transitions, 5771 flow
[2024-03-12 00:42:15,389 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:42:15,389 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:42:15,389 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1671 transitions.
[2024-03-12 00:42:15,390 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9131147540983606
[2024-03-12 00:42:15,390 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1671 transitions.
[2024-03-12 00:42:15,390 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1671 transitions.
[2024-03-12 00:42:15,390 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:15,391 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1671 transitions.
[2024-03-12 00:42:15,392 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 167.1) internal successors, (1671), 10 states have internal predecessors, (1671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:15,393 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:15,393 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 183.0) internal successors, (2013), 11 states have internal predecessors, (2013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:15,393 INFO  L175             Difference]: Start difference. First operand has 383 places, 596 transitions, 5351 flow. Second operand 10 states and 1671 transitions.
[2024-03-12 00:42:15,394 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 614 transitions, 5771 flow
[2024-03-12 00:42:15,597 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 614 transitions, 5705 flow, removed 11 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:15,604 INFO  L231             Difference]: Finished difference. Result has 395 places, 603 transitions, 5474 flow
[2024-03-12 00:42:15,604 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=183, PETRI_DIFFERENCE_MINUEND_FLOW=5249, PETRI_DIFFERENCE_MINUEND_PLACES=381, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=566, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5474, PETRI_PLACES=395, PETRI_TRANSITIONS=603}
[2024-03-12 00:42:15,604 INFO  L281   CegarLoopForPetriNet]: 175 programPoint places, 220 predicate places.
[2024-03-12 00:42:15,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 395 places, 603 transitions, 5474 flow
[2024-03-12 00:42:15,605 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 165.0) internal successors, (1815), 11 states have internal predecessors, (1815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:15,605 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:15,605 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:15,613 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-03-12 00:42:15,806 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:42:15,807 INFO  L420      AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:42:15,807 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:15,808 INFO  L85        PathProgramCache]: Analyzing trace with hash -1288814347, now seen corresponding path program 1 times
[2024-03-12 00:42:15,808 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:15,808 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80435707]
[2024-03-12 00:42:15,809 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:15,809 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:15,836 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:42:15,836 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 00:42:15,848 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:42:15,868 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 00:42:15,868 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 00:42:15,869 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-12 00:42:15,870 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-12 00:42:15,871 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-12 00:42:15,872 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-12 00:42:15,873 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-12 00:42:15,873 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-12 00:42:15,873 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-12 00:42:15,873 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-12 00:42:15,873 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 00:42:15,873 INFO  L445         BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:15,875 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 00:42:15,876 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 00:42:15,894 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 00:42:15,896 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 220 places, 230 transitions, 476 flow
[2024-03-12 00:42:15,934 INFO  L124   PetriNetUnfolderBase]: 27/455 cut-off events.
[2024-03-12 00:42:15,935 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 00:42:15,936 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 467 conditions, 455 events. 27/455 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1197 event pairs, 0 based on Foata normal form. 0/387 useless extension candidates. Maximal degree in co-relation 270. Up to 9 conditions per place. 
[2024-03-12 00:42:15,937 INFO  L82        GeneralOperation]: Start removeDead. Operand has 220 places, 230 transitions, 476 flow
[2024-03-12 00:42:15,939 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 220 places, 230 transitions, 476 flow
[2024-03-12 00:42:15,939 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:42:15,940 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=LoopHeads, 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;@3531b3fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:42:15,940 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-12 00:42:15,942 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:42:15,942 INFO  L124   PetriNetUnfolderBase]: 2/34 cut-off events.
[2024-03-12 00:42:15,942 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:42:15,942 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:15,942 INFO  L208   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, 1, 1, 1, 1]
[2024-03-12 00:42:15,942 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:15,943 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:15,943 INFO  L85        PathProgramCache]: Analyzing trace with hash -2033249673, now seen corresponding path program 1 times
[2024-03-12 00:42:15,943 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:15,943 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912219465]
[2024-03-12 00:42:15,943 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:15,943 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:15,949 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:15,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:15,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:15,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912219465]
[2024-03-12 00:42:15,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912219465] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:15,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:15,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:15,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128717468]
[2024-03-12 00:42:15,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:15,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:15,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:15,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:15,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:15,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-12 00:42:15,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 230 transitions, 476 flow. Second operand  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:15,976 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:15,976 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-12 00:42:15,976 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:16,092 INFO  L124   PetriNetUnfolderBase]: 67/976 cut-off events.
[2024-03-12 00:42:16,092 INFO  L125   PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES.
[2024-03-12 00:42:16,096 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1045 conditions, 976 events. 67/976 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4482 event pairs, 16 based on Foata normal form. 11/836 useless extension candidates. Maximal degree in co-relation 607. Up to 50 conditions per place. 
[2024-03-12 00:42:16,098 INFO  L140   encePairwiseOnDemand]: 223/230 looper letters, 11 selfloop transitions, 2 changer transitions 2/225 dead transitions.
[2024-03-12 00:42:16,098 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 492 flow
[2024-03-12 00:42:16,099 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:16,099 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:16,100 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-03-12 00:42:16,100 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-03-12 00:42:16,100 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-03-12 00:42:16,100 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-03-12 00:42:16,100 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:16,101 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-03-12 00:42:16,101 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,102 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,102 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,102 INFO  L175             Difference]: Start difference. First operand has 220 places, 230 transitions, 476 flow. Second operand 3 states and 654 transitions.
[2024-03-12 00:42:16,102 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 492 flow
[2024-03-12 00:42:16,103 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 225 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:16,105 INFO  L231             Difference]: Finished difference. Result has 221 places, 223 transitions, 466 flow
[2024-03-12 00:42:16,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=221, PETRI_TRANSITIONS=223}
[2024-03-12 00:42:16,106 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-03-12 00:42:16,106 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 223 transitions, 466 flow
[2024-03-12 00:42:16,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.33333333333334) internal successors, (640), 3 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:16,106 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:16,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 00:42:16,106 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:16,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:16,107 INFO  L85        PathProgramCache]: Analyzing trace with hash 1952605300, now seen corresponding path program 1 times
[2024-03-12 00:42:16,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:16,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98085062]
[2024-03-12 00:42:16,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:16,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:16,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:16,121 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:16,122 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:16,122 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98085062]
[2024-03-12 00:42:16,122 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98085062] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:16,122 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:16,122 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:16,122 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673190715]
[2024-03-12 00:42:16,122 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:16,123 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:16,123 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:16,123 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:16,123 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:16,146 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 207 out of 230
[2024-03-12 00:42:16,147 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 223 transitions, 466 flow. Second operand  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,147 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:16,147 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 230
[2024-03-12 00:42:16,147 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:16,453 INFO  L124   PetriNetUnfolderBase]: 486/3131 cut-off events.
[2024-03-12 00:42:16,454 INFO  L125   PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES.
[2024-03-12 00:42:16,466 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3698 conditions, 3131 events. 486/3131 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 25851 event pairs, 113 based on Foata normal form. 0/2650 useless extension candidates. Maximal degree in co-relation 3658. Up to 322 conditions per place. 
[2024-03-12 00:42:16,474 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 22 selfloop transitions, 11 changer transitions 0/237 dead transitions.
[2024-03-12 00:42:16,475 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 237 transitions, 571 flow
[2024-03-12 00:42:16,476 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:16,476 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:16,476 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-03-12 00:42:16,477 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-03-12 00:42:16,477 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-03-12 00:42:16,477 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-03-12 00:42:16,477 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:16,477 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-03-12 00:42:16,478 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,478 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,479 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,479 INFO  L175             Difference]: Start difference. First operand has 221 places, 223 transitions, 466 flow. Second operand 3 states and 658 transitions.
[2024-03-12 00:42:16,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 237 transitions, 571 flow
[2024-03-12 00:42:16,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 237 transitions, 567 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:16,482 INFO  L231             Difference]: Finished difference. Result has 221 places, 234 transitions, 558 flow
[2024-03-12 00:42:16,482 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=221, PETRI_TRANSITIONS=234}
[2024-03-12 00:42:16,483 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 1 predicate places.
[2024-03-12 00:42:16,483 INFO  L495      AbstractCegarLoop]: Abstraction has has 221 places, 234 transitions, 558 flow
[2024-03-12 00:42:16,483 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,483 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:16,483 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:16,483 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 00:42:16,484 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:16,484 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:16,484 INFO  L85        PathProgramCache]: Analyzing trace with hash 1119439621, now seen corresponding path program 1 times
[2024-03-12 00:42:16,484 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:16,484 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675528135]
[2024-03-12 00:42:16,484 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:16,484 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:16,492 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:16,520 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:16,521 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:16,521 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675528135]
[2024-03-12 00:42:16,521 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675528135] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:16,521 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:16,521 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:16,521 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602411620]
[2024-03-12 00:42:16,521 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:16,522 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:42:16,522 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:16,522 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:42:16,522 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:42:16,572 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-12 00:42:16,572 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 234 transitions, 558 flow. Second operand  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,572 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:16,573 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-12 00:42:16,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:16,946 INFO  L124   PetriNetUnfolderBase]: 459/3065 cut-off events.
[2024-03-12 00:42:16,946 INFO  L125   PetriNetUnfolderBase]: For 229/279 co-relation queries the response was YES.
[2024-03-12 00:42:16,954 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 3850 conditions, 3065 events. 459/3065 cut-off events. For 229/279 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 25189 event pairs, 107 based on Foata normal form. 2/2661 useless extension candidates. Maximal degree in co-relation 1323. Up to 307 conditions per place. 
[2024-03-12 00:42:16,960 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 14 selfloop transitions, 6 changer transitions 1/240 dead transitions.
[2024-03-12 00:42:16,960 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 240 transitions, 612 flow
[2024-03-12 00:42:16,961 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:16,961 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:16,962 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1288 transitions.
[2024-03-12 00:42:16,962 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9333333333333333
[2024-03-12 00:42:16,962 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1288 transitions.
[2024-03-12 00:42:16,962 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1288 transitions.
[2024-03-12 00:42:16,963 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:16,963 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1288 transitions.
[2024-03-12 00:42:16,964 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.66666666666666) internal successors, (1288), 6 states have internal predecessors, (1288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,965 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,965 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,965 INFO  L175             Difference]: Start difference. First operand has 221 places, 234 transitions, 558 flow. Second operand 6 states and 1288 transitions.
[2024-03-12 00:42:16,966 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 240 transitions, 612 flow
[2024-03-12 00:42:16,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 240 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:16,969 INFO  L231             Difference]: Finished difference. Result has 228 places, 239 transitions, 582 flow
[2024-03-12 00:42:16,970 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=582, PETRI_PLACES=228, PETRI_TRANSITIONS=239}
[2024-03-12 00:42:16,970 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 8 predicate places.
[2024-03-12 00:42:16,970 INFO  L495      AbstractCegarLoop]: Abstraction has has 228 places, 239 transitions, 582 flow
[2024-03-12 00:42:16,971 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 212.4) internal successors, (1062), 5 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:16,971 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:16,971 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:16,971 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 00:42:16,971 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:16,971 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:16,972 INFO  L85        PathProgramCache]: Analyzing trace with hash 96307507, now seen corresponding path program 1 times
[2024-03-12 00:42:16,972 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:16,972 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639285941]
[2024-03-12 00:42:16,972 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:16,972 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:16,981 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:17,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:17,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:17,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639285941]
[2024-03-12 00:42:17,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639285941] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:17,102 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:17,102 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:17,103 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581092639]
[2024-03-12 00:42:17,103 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:17,103 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:17,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:17,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:17,104 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:17,282 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 192 out of 230
[2024-03-12 00:42:17,284 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 239 transitions, 582 flow. Second operand  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:17,284 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:17,284 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 230
[2024-03-12 00:42:17,284 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:19,300 INFO  L124   PetriNetUnfolderBase]: 3950/17927 cut-off events.
[2024-03-12 00:42:19,300 INFO  L125   PetriNetUnfolderBase]: For 277/291 co-relation queries the response was YES.
[2024-03-12 00:42:19,351 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 24213 conditions, 17927 events. 3950/17927 cut-off events. For 277/291 co-relation queries the response was YES. Maximal size of possible extension queue 474. Compared 213252 event pairs, 575 based on Foata normal form. 12/15595 useless extension candidates. Maximal degree in co-relation 24069. Up to 2931 conditions per place. 
[2024-03-12 00:42:19,389 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 46 selfloop transitions, 48 changer transitions 0/299 dead transitions.
[2024-03-12 00:42:19,390 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 299 transitions, 901 flow
[2024-03-12 00:42:19,390 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:19,390 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:19,391 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1249 transitions.
[2024-03-12 00:42:19,391 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9050724637681159
[2024-03-12 00:42:19,392 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1249 transitions.
[2024-03-12 00:42:19,392 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1249 transitions.
[2024-03-12 00:42:19,392 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:19,392 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1249 transitions.
[2024-03-12 00:42:19,393 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:19,394 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:19,394 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:19,394 INFO  L175             Difference]: Start difference. First operand has 228 places, 239 transitions, 582 flow. Second operand 6 states and 1249 transitions.
[2024-03-12 00:42:19,395 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 299 transitions, 901 flow
[2024-03-12 00:42:19,397 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 299 transitions, 899 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:42:19,399 INFO  L231             Difference]: Finished difference. Result has 237 places, 287 transitions, 922 flow
[2024-03-12 00:42:19,400 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=237, PETRI_TRANSITIONS=287}
[2024-03-12 00:42:19,400 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-03-12 00:42:19,400 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 287 transitions, 922 flow
[2024-03-12 00:42:19,401 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.16666666666666) internal successors, (1159), 6 states have internal predecessors, (1159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:19,401 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:19,401 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:19,401 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 00:42:19,401 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:19,401 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:19,401 INFO  L85        PathProgramCache]: Analyzing trace with hash 1838169526, now seen corresponding path program 1 times
[2024-03-12 00:42:19,402 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:19,402 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083408136]
[2024-03-12 00:42:19,402 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:19,402 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:19,410 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:19,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:19,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:19,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083408136]
[2024-03-12 00:42:19,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083408136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:19,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:19,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:19,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668538041]
[2024-03-12 00:42:19,423 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:19,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:19,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:19,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:19,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:19,440 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-12 00:42:19,441 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 287 transitions, 922 flow. Second operand  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:19,441 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:19,441 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-12 00:42:19,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:19,963 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][156], [Black: 245#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 239#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 156#L1056-6true, Black: 237#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:19,963 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:19,963 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:19,964 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:19,964 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:21,523 INFO  L124   PetriNetUnfolderBase]: 3994/19706 cut-off events.
[2024-03-12 00:42:21,523 INFO  L125   PetriNetUnfolderBase]: For 1588/1594 co-relation queries the response was YES.
[2024-03-12 00:42:21,626 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29102 conditions, 19706 events. 3994/19706 cut-off events. For 1588/1594 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 245797 event pairs, 513 based on Foata normal form. 0/17311 useless extension candidates. Maximal degree in co-relation 13273. Up to 2268 conditions per place. 
[2024-03-12 00:42:21,688 INFO  L140   encePairwiseOnDemand]: 224/230 looper letters, 12 selfloop transitions, 3 changer transitions 4/288 dead transitions.
[2024-03-12 00:42:21,688 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 288 transitions, 959 flow
[2024-03-12 00:42:21,689 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:21,689 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:21,690 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 654 transitions.
[2024-03-12 00:42:21,690 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478260869565217
[2024-03-12 00:42:21,690 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 654 transitions.
[2024-03-12 00:42:21,690 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 654 transitions.
[2024-03-12 00:42:21,691 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:21,691 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 654 transitions.
[2024-03-12 00:42:21,692 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 218.0) internal successors, (654), 3 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:21,692 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:21,693 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:21,693 INFO  L175             Difference]: Start difference. First operand has 237 places, 287 transitions, 922 flow. Second operand 3 states and 654 transitions.
[2024-03-12 00:42:21,693 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 288 transitions, 959 flow
[2024-03-12 00:42:21,712 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 288 transitions, 959 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:21,714 INFO  L231             Difference]: Finished difference. Result has 237 places, 283 transitions, 913 flow
[2024-03-12 00:42:21,714 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=913, PETRI_PLACES=237, PETRI_TRANSITIONS=283}
[2024-03-12 00:42:21,715 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 17 predicate places.
[2024-03-12 00:42:21,715 INFO  L495      AbstractCegarLoop]: Abstraction has has 237 places, 283 transitions, 913 flow
[2024-03-12 00:42:21,715 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:21,715 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:21,715 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:21,716 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 00:42:21,716 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:21,716 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:21,716 INFO  L85        PathProgramCache]: Analyzing trace with hash -917359253, now seen corresponding path program 1 times
[2024-03-12 00:42:21,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:21,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55763162]
[2024-03-12 00:42:21,717 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:21,717 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:21,724 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:21,757 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:21,758 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:21,758 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55763162]
[2024-03-12 00:42:21,759 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55763162] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:21,759 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:21,759 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:21,759 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109096201]
[2024-03-12 00:42:21,760 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:21,760 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:21,760 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:21,761 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:21,761 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:21,828 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-12 00:42:21,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 283 transitions, 913 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:21,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:21,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-12 00:42:21,829 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:22,244 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][149], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 239#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 156#L1056-6true, Black: 237#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:22,244 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,244 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,245 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,245 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,259 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 236#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 239#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 237#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:22,259 INFO  L294   olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,260 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,260 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,260 INFO  L297   olderBase$Statistics]:   existing Event has 138 ancestors and is not cut-off event
[2024-03-12 00:42:22,289 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 236#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 239#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 237#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:22,290 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:22,290 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:22,290 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:22,290 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:23,813 INFO  L124   PetriNetUnfolderBase]: 3593/17694 cut-off events.
[2024-03-12 00:42:23,814 INFO  L125   PetriNetUnfolderBase]: For 1645/1651 co-relation queries the response was YES.
[2024-03-12 00:42:23,869 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27377 conditions, 17694 events. 3593/17694 cut-off events. For 1645/1651 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216323 event pairs, 574 based on Foata normal form. 1/15667 useless extension candidates. Maximal degree in co-relation 25638. Up to 2005 conditions per place. 
[2024-03-12 00:42:23,903 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-03-12 00:42:23,903 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 288 transitions, 961 flow
[2024-03-12 00:42:23,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:23,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:23,905 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-03-12 00:42:23,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-12 00:42:23,905 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-03-12 00:42:23,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-03-12 00:42:23,905 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:23,906 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-03-12 00:42:23,906 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:23,907 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:23,907 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:23,907 INFO  L175             Difference]: Start difference. First operand has 237 places, 283 transitions, 913 flow. Second operand 4 states and 868 transitions.
[2024-03-12 00:42:23,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 288 transitions, 961 flow
[2024-03-12 00:42:23,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 288 transitions, 951 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:23,927 INFO  L231             Difference]: Finished difference. Result has 236 places, 286 transitions, 928 flow
[2024-03-12 00:42:23,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=903, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=928, PETRI_PLACES=236, PETRI_TRANSITIONS=286}
[2024-03-12 00:42:23,928 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 16 predicate places.
[2024-03-12 00:42:23,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 236 places, 286 transitions, 928 flow
[2024-03-12 00:42:23,928 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:23,928 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:23,929 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:23,929 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 00:42:23,929 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:23,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:23,929 INFO  L85        PathProgramCache]: Analyzing trace with hash -43618573, now seen corresponding path program 1 times
[2024-03-12 00:42:23,929 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:23,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011658183]
[2024-03-12 00:42:23,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:23,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:23,936 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:23,962 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:23,962 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:23,962 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011658183]
[2024-03-12 00:42:23,962 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011658183] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:23,962 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:23,963 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:23,963 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550913690]
[2024-03-12 00:42:23,963 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:23,963 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:23,963 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:23,964 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:23,964 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:24,012 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-12 00:42:24,013 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 286 transitions, 928 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:24,013 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:24,013 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-12 00:42:24,014 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:24,422 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][148], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 156#L1056-6true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:24,422 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,423 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,423 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,423 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,436 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:24,436 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,437 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,437 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,437 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:24,467 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:24,467 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:24,467 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:24,467 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:24,467 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:25,885 INFO  L124   PetriNetUnfolderBase]: 3592/17692 cut-off events.
[2024-03-12 00:42:25,886 INFO  L125   PetriNetUnfolderBase]: For 1714/1720 co-relation queries the response was YES.
[2024-03-12 00:42:25,943 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27371 conditions, 17692 events. 3592/17692 cut-off events. For 1714/1720 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216422 event pairs, 574 based on Foata normal form. 1/15617 useless extension candidates. Maximal degree in co-relation 25626. Up to 2005 conditions per place. 
[2024-03-12 00:42:25,979 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 14 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-03-12 00:42:25,979 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 287 transitions, 966 flow
[2024-03-12 00:42:25,980 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:25,980 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:25,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 867 transitions.
[2024-03-12 00:42:25,981 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9423913043478261
[2024-03-12 00:42:25,981 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 867 transitions.
[2024-03-12 00:42:25,981 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 867 transitions.
[2024-03-12 00:42:25,981 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:25,981 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 867 transitions.
[2024-03-12 00:42:25,982 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.75) internal successors, (867), 4 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:25,982 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:25,983 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:25,983 INFO  L175             Difference]: Start difference. First operand has 236 places, 286 transitions, 928 flow. Second operand 4 states and 867 transitions.
[2024-03-12 00:42:25,983 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 287 transitions, 966 flow
[2024-03-12 00:42:25,999 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 287 transitions, 966 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:26,001 INFO  L231             Difference]: Finished difference. Result has 241 places, 287 transitions, 947 flow
[2024-03-12 00:42:26,002 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=928, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=947, PETRI_PLACES=241, PETRI_TRANSITIONS=287}
[2024-03-12 00:42:26,002 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 21 predicate places.
[2024-03-12 00:42:26,002 INFO  L495      AbstractCegarLoop]: Abstraction has has 241 places, 287 transitions, 947 flow
[2024-03-12 00:42:26,003 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:26,003 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:26,003 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:26,003 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 00:42:26,003 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:26,003 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:26,003 INFO  L85        PathProgramCache]: Analyzing trace with hash -1579712532, now seen corresponding path program 1 times
[2024-03-12 00:42:26,004 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:26,004 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824714268]
[2024-03-12 00:42:26,004 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:26,004 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:26,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:26,039 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:26,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:26,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824714268]
[2024-03-12 00:42:26,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824714268] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:26,041 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:26,041 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:26,041 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942025025]
[2024-03-12 00:42:26,041 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:26,042 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:26,042 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:26,043 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:26,043 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:26,108 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 212 out of 230
[2024-03-12 00:42:26,109 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 287 transitions, 947 flow. Second operand  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:26,109 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:26,109 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 230
[2024-03-12 00:42:26,109 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:26,509 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][149], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:26,509 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,509 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,509 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,509 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,523 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:26,523 INFO  L294   olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,523 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,523 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,523 INFO  L297   olderBase$Statistics]:   existing Event has 139 ancestors and is not cut-off event
[2024-03-12 00:42:26,554 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][161], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 269#true, 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:26,555 INFO  L294   olderBase$Statistics]: this new event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:26,555 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:26,555 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:26,555 INFO  L297   olderBase$Statistics]:   existing Event has 140 ancestors and is not cut-off event
[2024-03-12 00:42:27,982 INFO  L124   PetriNetUnfolderBase]: 3591/17690 cut-off events.
[2024-03-12 00:42:27,982 INFO  L125   PetriNetUnfolderBase]: For 1826/1832 co-relation queries the response was YES.
[2024-03-12 00:42:28,097 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27478 conditions, 17690 events. 3591/17690 cut-off events. For 1826/1832 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 216564 event pairs, 574 based on Foata normal form. 1/15666 useless extension candidates. Maximal degree in co-relation 27369. Up to 2005 conditions per place. 
[2024-03-12 00:42:28,150 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/288 dead transitions.
[2024-03-12 00:42:28,150 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 288 transitions, 987 flow
[2024-03-12 00:42:28,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:28,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:28,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 868 transitions.
[2024-03-12 00:42:28,152 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-12 00:42:28,152 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 868 transitions.
[2024-03-12 00:42:28,152 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 868 transitions.
[2024-03-12 00:42:28,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:28,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 868 transitions.
[2024-03-12 00:42:28,153 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 217.0) internal successors, (868), 4 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:28,153 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:28,154 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:28,154 INFO  L175             Difference]: Start difference. First operand has 241 places, 287 transitions, 947 flow. Second operand 4 states and 868 transitions.
[2024-03-12 00:42:28,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 288 transitions, 987 flow
[2024-03-12 00:42:28,176 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 288 transitions, 984 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:42:28,179 INFO  L231             Difference]: Finished difference. Result has 244 places, 287 transitions, 956 flow
[2024-03-12 00:42:28,179 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=956, PETRI_PLACES=244, PETRI_TRANSITIONS=287}
[2024-03-12 00:42:28,179 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 24 predicate places.
[2024-03-12 00:42:28,180 INFO  L495      AbstractCegarLoop]: Abstraction has has 244 places, 287 transitions, 956 flow
[2024-03-12 00:42:28,180 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 213.25) internal successors, (853), 4 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:28,180 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:28,180 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:28,180 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-12 00:42:28,180 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:28,181 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:28,181 INFO  L85        PathProgramCache]: Analyzing trace with hash -263555228, now seen corresponding path program 1 times
[2024-03-12 00:42:28,181 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:28,181 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205786846]
[2024-03-12 00:42:28,181 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:28,181 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:28,187 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:28,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:28,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:28,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205786846]
[2024-03-12 00:42:28,213 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205786846] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:28,213 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:28,213 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:42:28,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836079302]
[2024-03-12 00:42:28,214 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:28,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:42:28,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:28,215 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:42:28,215 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:42:28,304 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-12 00:42:28,305 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 287 transitions, 956 flow. Second operand  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:28,305 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:28,305 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-12 00:42:28,305 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:28,731 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][148], [Black: 245#true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:28,732 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,732 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,732 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,732 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,745 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:28,745 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,745 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,745 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,746 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:28,776 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 276#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 31#L1040-10true, 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:28,776 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:28,776 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:28,776 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:28,776 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:30,189 INFO  L124   PetriNetUnfolderBase]: 3610/17728 cut-off events.
[2024-03-12 00:42:30,189 INFO  L125   PetriNetUnfolderBase]: For 1897/1903 co-relation queries the response was YES.
[2024-03-12 00:42:30,297 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27647 conditions, 17728 events. 3610/17728 cut-off events. For 1897/1903 co-relation queries the response was YES. Maximal size of possible extension queue 452. Compared 217116 event pairs, 592 based on Foata normal form. 1/15687 useless extension candidates. Maximal degree in co-relation 27537. Up to 2005 conditions per place. 
[2024-03-12 00:42:30,425 INFO  L140   encePairwiseOnDemand]: 226/230 looper letters, 15 selfloop transitions, 4 changer transitions 0/287 dead transitions.
[2024-03-12 00:42:30,425 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 287 transitions, 994 flow
[2024-03-12 00:42:30,426 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:42:30,426 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:42:30,427 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 864 transitions.
[2024-03-12 00:42:30,427 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9391304347826087
[2024-03-12 00:42:30,427 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 864 transitions.
[2024-03-12 00:42:30,427 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 864 transitions.
[2024-03-12 00:42:30,428 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:30,428 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 864 transitions.
[2024-03-12 00:42:30,429 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 216.0) internal successors, (864), 4 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:30,429 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:30,429 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:30,430 INFO  L175             Difference]: Start difference. First operand has 244 places, 287 transitions, 956 flow. Second operand 4 states and 864 transitions.
[2024-03-12 00:42:30,430 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 287 transitions, 994 flow
[2024-03-12 00:42:30,449 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 287 transitions, 986 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:30,452 INFO  L231             Difference]: Finished difference. Result has 245 places, 287 transitions, 960 flow
[2024-03-12 00:42:30,452 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=960, PETRI_PLACES=245, PETRI_TRANSITIONS=287}
[2024-03-12 00:42:30,453 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 25 predicate places.
[2024-03-12 00:42:30,453 INFO  L495      AbstractCegarLoop]: Abstraction has has 245 places, 287 transitions, 960 flow
[2024-03-12 00:42:30,453 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 212.25) internal successors, (849), 4 states have internal predecessors, (849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:30,453 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:30,453 INFO  L208   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, 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, 1, 1]
[2024-03-12 00:42:30,453 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-12 00:42:30,454 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:30,454 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:30,454 INFO  L85        PathProgramCache]: Analyzing trace with hash -1243699433, now seen corresponding path program 1 times
[2024-03-12 00:42:30,454 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:30,454 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728057763]
[2024-03-12 00:42:30,454 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:30,455 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:30,462 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:30,475 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:30,476 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:30,476 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728057763]
[2024-03-12 00:42:30,476 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728057763] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:30,476 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:30,476 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:42:30,476 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159572200]
[2024-03-12 00:42:30,477 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:30,477 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:42:30,477 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:30,477 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:42:30,477 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:42:30,513 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 209 out of 230
[2024-03-12 00:42:30,513 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 287 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:30,514 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:30,514 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 230
[2024-03-12 00:42:30,514 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:31,022 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([516] L1056-5-->L1056-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][147], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 156#L1056-6true, 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:31,022 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,022 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,022 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,022 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,038 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 106#L1040-9true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:31,038 INFO  L294   olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,038 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,038 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,038 INFO  L297   olderBase$Statistics]:   existing Event has 143 ancestors and is not cut-off event
[2024-03-12 00:42:31,076 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([607] L1058-5-->L1058-6: Formula: (let ((.cse0 (select |v_#race_40| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0)))  InVars {#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_40|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][160], [Black: 245#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 18#L1058-6true, Black: 257#true, 262#true, Black: 229#(= |#race~threads_mask~0| 0), 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 290#true, Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 282#true, 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 31#L1040-10true, Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 207#L1040-8true, threadThread1of2ForFork0InUse, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread2of2ForFork0InUse, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:42:31,077 INFO  L294   olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:31,077 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:31,077 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:31,077 INFO  L297   olderBase$Statistics]:   existing Event has 144 ancestors and is not cut-off event
[2024-03-12 00:42:32,584 INFO  L124   PetriNetUnfolderBase]: 3745/17769 cut-off events.
[2024-03-12 00:42:32,584 INFO  L125   PetriNetUnfolderBase]: For 2586/2817 co-relation queries the response was YES.
[2024-03-12 00:42:32,699 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27863 conditions, 17769 events. 3745/17769 cut-off events. For 2586/2817 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 216861 event pairs, 518 based on Foata normal form. 3/15595 useless extension candidates. Maximal degree in co-relation 27754. Up to 1828 conditions per place. 
[2024-03-12 00:42:32,754 INFO  L140   encePairwiseOnDemand]: 222/230 looper letters, 22 selfloop transitions, 12 changer transitions 0/297 dead transitions.
[2024-03-12 00:42:32,754 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 297 transitions, 1064 flow
[2024-03-12 00:42:32,755 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:42:32,755 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:42:32,755 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions.
[2024-03-12 00:42:32,756 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9434782608695652
[2024-03-12 00:42:32,756 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 651 transitions.
[2024-03-12 00:42:32,756 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions.
[2024-03-12 00:42:32,756 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:32,756 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions.
[2024-03-12 00:42:32,757 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:32,757 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:32,757 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:32,758 INFO  L175             Difference]: Start difference. First operand has 245 places, 287 transitions, 960 flow. Second operand 3 states and 651 transitions.
[2024-03-12 00:42:32,758 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 297 transitions, 1064 flow
[2024-03-12 00:42:32,776 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 297 transitions, 1056 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:42:32,778 INFO  L231             Difference]: Finished difference. Result has 246 places, 297 transitions, 1058 flow
[2024-03-12 00:42:32,779 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=246, PETRI_TRANSITIONS=297}
[2024-03-12 00:42:32,779 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 26 predicate places.
[2024-03-12 00:42:32,779 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 297 transitions, 1058 flow
[2024-03-12 00:42:32,780 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 211.0) internal successors, (633), 3 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:32,780 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:32,780 INFO  L208   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, 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, 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, 1]
[2024-03-12 00:42:32,780 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-12 00:42:32,780 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:32,780 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:32,781 INFO  L85        PathProgramCache]: Analyzing trace with hash -174338931, now seen corresponding path program 1 times
[2024-03-12 00:42:32,781 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:32,781 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266052146]
[2024-03-12 00:42:32,781 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:32,781 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:32,794 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:32,957 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:42:32,957 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:32,957 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266052146]
[2024-03-12 00:42:32,957 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266052146] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:32,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:32,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:32,958 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125863335]
[2024-03-12 00:42:32,958 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:32,958 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:32,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:32,959 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:32,959 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:33,131 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 191 out of 230
[2024-03-12 00:42:33,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 297 transitions, 1058 flow. Second operand  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:33,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:33,132 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 230
[2024-03-12 00:42:33,132 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:37,807 INFO  L124   PetriNetUnfolderBase]: 10502/43558 cut-off events.
[2024-03-12 00:42:37,807 INFO  L125   PetriNetUnfolderBase]: For 10196/13574 co-relation queries the response was YES.
[2024-03-12 00:42:38,057 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 74872 conditions, 43558 events. 10502/43558 cut-off events. For 10196/13574 co-relation queries the response was YES. Maximal size of possible extension queue 1207. Compared 602898 event pairs, 1733 based on Foata normal form. 51/38286 useless extension candidates. Maximal degree in co-relation 74631. Up to 8390 conditions per place. 
[2024-03-12 00:42:38,172 INFO  L140   encePairwiseOnDemand]: 203/230 looper letters, 103 selfloop transitions, 136 changer transitions 0/457 dead transitions.
[2024-03-12 00:42:38,173 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 457 transitions, 2248 flow
[2024-03-12 00:42:38,173 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:38,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:38,174 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1287 transitions.
[2024-03-12 00:42:38,174 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9326086956521739
[2024-03-12 00:42:38,175 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1287 transitions.
[2024-03-12 00:42:38,175 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1287 transitions.
[2024-03-12 00:42:38,175 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:38,175 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1287 transitions.
[2024-03-12 00:42:38,176 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 214.5) internal successors, (1287), 6 states have internal predecessors, (1287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:38,177 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:38,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:38,177 INFO  L175             Difference]: Start difference. First operand has 246 places, 297 transitions, 1058 flow. Second operand 6 states and 1287 transitions.
[2024-03-12 00:42:38,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 457 transitions, 2248 flow
[2024-03-12 00:42:38,231 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 457 transitions, 2224 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:42:38,235 INFO  L231             Difference]: Finished difference. Result has 253 places, 430 transitions, 2172 flow
[2024-03-12 00:42:38,235 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2172, PETRI_PLACES=253, PETRI_TRANSITIONS=430}
[2024-03-12 00:42:38,235 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 33 predicate places.
[2024-03-12 00:42:38,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 430 transitions, 2172 flow
[2024-03-12 00:42:38,236 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 193.33333333333334) internal successors, (1160), 6 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:38,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:38,236 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:38,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-12 00:42:38,236 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:38,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:38,237 INFO  L85        PathProgramCache]: Analyzing trace with hash 77385569, now seen corresponding path program 1 times
[2024-03-12 00:42:38,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:38,237 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792078479]
[2024-03-12 00:42:38,237 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:38,237 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:38,251 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:38,421 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:38,421 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:38,422 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792078479]
[2024-03-12 00:42:38,422 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792078479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:38,422 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:38,422 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:42:38,422 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345826967]
[2024-03-12 00:42:38,422 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:38,423 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:42:38,423 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:38,423 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:42:38,423 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:42:38,662 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 230
[2024-03-12 00:42:38,663 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 430 transitions, 2172 flow. Second operand  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:38,663 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:38,663 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 230
[2024-03-12 00:42:38,664 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:44,194 INFO  L124   PetriNetUnfolderBase]: 11462/50887 cut-off events.
[2024-03-12 00:42:44,194 INFO  L125   PetriNetUnfolderBase]: For 23738/26324 co-relation queries the response was YES.
[2024-03-12 00:42:44,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 94528 conditions, 50887 events. 11462/50887 cut-off events. For 23738/26324 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 744378 event pairs, 1332 based on Foata normal form. 173/44896 useless extension candidates. Maximal degree in co-relation 94276. Up to 7148 conditions per place. 
[2024-03-12 00:42:44,852 INFO  L140   encePairwiseOnDemand]: 215/230 looper letters, 110 selfloop transitions, 119 changer transitions 0/546 dead transitions.
[2024-03-12 00:42:44,853 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 546 transitions, 3498 flow
[2024-03-12 00:42:44,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:42:44,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:42:44,854 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1271 transitions.
[2024-03-12 00:42:44,855 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210144927536232
[2024-03-12 00:42:44,855 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1271 transitions.
[2024-03-12 00:42:44,855 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1271 transitions.
[2024-03-12 00:42:44,855 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:44,855 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1271 transitions.
[2024-03-12 00:42:44,856 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 211.83333333333334) internal successors, (1271), 6 states have internal predecessors, (1271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:44,857 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:44,857 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:44,857 INFO  L175             Difference]: Start difference. First operand has 253 places, 430 transitions, 2172 flow. Second operand 6 states and 1271 transitions.
[2024-03-12 00:42:44,857 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 546 transitions, 3498 flow
[2024-03-12 00:42:45,003 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 546 transitions, 3444 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:45,009 INFO  L231             Difference]: Finished difference. Result has 263 places, 544 transitions, 3538 flow
[2024-03-12 00:42:45,009 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3538, PETRI_PLACES=263, PETRI_TRANSITIONS=544}
[2024-03-12 00:42:45,010 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 43 predicate places.
[2024-03-12 00:42:45,010 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 544 transitions, 3538 flow
[2024-03-12 00:42:45,010 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 202.5) internal successors, (1215), 6 states have internal predecessors, (1215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:45,010 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:45,011 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:45,011 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42
[2024-03-12 00:42:45,011 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:45,011 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:45,012 INFO  L85        PathProgramCache]: Analyzing trace with hash -952493381, now seen corresponding path program 1 times
[2024-03-12 00:42:45,012 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:45,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950531672]
[2024-03-12 00:42:45,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:45,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:45,030 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:45,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:45,291 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:45,292 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950531672]
[2024-03-12 00:42:45,292 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950531672] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:45,292 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:45,292 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:42:45,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363316137]
[2024-03-12 00:42:45,292 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:45,293 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:42:45,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:45,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:42:45,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:42:45,784 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 230
[2024-03-12 00:42:45,786 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 544 transitions, 3538 flow. Second operand  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:45,786 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:45,787 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 230
[2024-03-12 00:42:45,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:42:53,799 INFO  L124   PetriNetUnfolderBase]: 14641/55955 cut-off events.
[2024-03-12 00:42:53,799 INFO  L125   PetriNetUnfolderBase]: For 42180/78252 co-relation queries the response was YES.
[2024-03-12 00:42:54,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127413 conditions, 55955 events. 14641/55955 cut-off events. For 42180/78252 co-relation queries the response was YES. Maximal size of possible extension queue 1618. Compared 787440 event pairs, 1855 based on Foata normal form. 800/50873 useless extension candidates. Maximal degree in co-relation 127159. Up to 8258 conditions per place. 
[2024-03-12 00:42:54,398 INFO  L140   encePairwiseOnDemand]: 210/230 looper letters, 396 selfloop transitions, 224 changer transitions 0/833 dead transitions.
[2024-03-12 00:42:54,398 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 833 transitions, 6930 flow
[2024-03-12 00:42:54,399 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:42:54,399 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:42:54,400 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2207 transitions.
[2024-03-12 00:42:54,400 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8723320158102766
[2024-03-12 00:42:54,400 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2207 transitions.
[2024-03-12 00:42:54,400 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2207 transitions.
[2024-03-12 00:42:54,401 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:42:54,401 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2207 transitions.
[2024-03-12 00:42:54,402 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 200.63636363636363) internal successors, (2207), 11 states have internal predecessors, (2207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:54,404 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:54,404 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 230.0) internal successors, (2760), 12 states have internal predecessors, (2760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:54,404 INFO  L175             Difference]: Start difference. First operand has 263 places, 544 transitions, 3538 flow. Second operand 11 states and 2207 transitions.
[2024-03-12 00:42:54,404 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 833 transitions, 6930 flow
[2024-03-12 00:42:54,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 833 transitions, 6882 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-12 00:42:54,688 INFO  L231             Difference]: Finished difference. Result has 280 places, 670 transitions, 5498 flow
[2024-03-12 00:42:54,689 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=3490, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5498, PETRI_PLACES=280, PETRI_TRANSITIONS=670}
[2024-03-12 00:42:54,690 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 60 predicate places.
[2024-03-12 00:42:54,690 INFO  L495      AbstractCegarLoop]: Abstraction has has 280 places, 670 transitions, 5498 flow
[2024-03-12 00:42:54,690 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 186.9) internal successors, (1869), 10 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:54,690 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:42:54,690 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:42:54,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43
[2024-03-12 00:42:54,691 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:42:54,691 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:42:54,691 INFO  L85        PathProgramCache]: Analyzing trace with hash -1962710595, now seen corresponding path program 1 times
[2024-03-12 00:42:54,691 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:42:54,691 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192261149]
[2024-03-12 00:42:54,691 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:42:54,692 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:42:54,706 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:42:55,038 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:42:55,038 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:42:55,039 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192261149]
[2024-03-12 00:42:55,039 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192261149] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:42:55,039 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:42:55,039 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:42:55,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768150425]
[2024-03-12 00:42:55,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:42:55,040 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:42:55,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:42:55,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:42:55,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:42:55,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 188 out of 230
[2024-03-12 00:42:55,609 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 670 transitions, 5498 flow. Second operand  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:42:55,609 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:42:55,609 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 230
[2024-03-12 00:42:55,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:03,275 INFO  L124   PetriNetUnfolderBase]: 13405/55166 cut-off events.
[2024-03-12 00:43:03,275 INFO  L125   PetriNetUnfolderBase]: For 76824/113988 co-relation queries the response was YES.
[2024-03-12 00:43:03,723 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 134946 conditions, 55166 events. 13405/55166 cut-off events. For 76824/113988 co-relation queries the response was YES. Maximal size of possible extension queue 1686. Compared 800607 event pairs, 1317 based on Foata normal form. 706/49669 useless extension candidates. Maximal degree in co-relation 134686. Up to 11321 conditions per place. 
[2024-03-12 00:43:03,906 INFO  L140   encePairwiseOnDemand]: 218/230 looper letters, 392 selfloop transitions, 18 changer transitions 0/677 dead transitions.
[2024-03-12 00:43:03,906 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 677 transitions, 6404 flow
[2024-03-12 00:43:03,907 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:43:03,907 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:43:03,908 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1930 transitions.
[2024-03-12 00:43:03,908 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8391304347826087
[2024-03-12 00:43:03,908 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1930 transitions.
[2024-03-12 00:43:03,908 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1930 transitions.
[2024-03-12 00:43:03,909 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:03,909 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1930 transitions.
[2024-03-12 00:43:03,910 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 193.0) internal successors, (1930), 10 states have internal predecessors, (1930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:03,911 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:03,912 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 230.0) internal successors, (2530), 11 states have internal predecessors, (2530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:03,912 INFO  L175             Difference]: Start difference. First operand has 280 places, 670 transitions, 5498 flow. Second operand 10 states and 1930 transitions.
[2024-03-12 00:43:03,912 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 677 transitions, 6404 flow
[2024-03-12 00:43:04,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 677 transitions, 6360 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-03-12 00:43:04,527 INFO  L231             Difference]: Finished difference. Result has 287 places, 671 transitions, 5526 flow
[2024-03-12 00:43:04,528 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5442, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5526, PETRI_PLACES=287, PETRI_TRANSITIONS=671}
[2024-03-12 00:43:04,528 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 67 predicate places.
[2024-03-12 00:43:04,528 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 671 transitions, 5526 flow
[2024-03-12 00:43:04,528 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 189.8) internal successors, (1898), 10 states have internal predecessors, (1898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:04,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:04,529 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:43:04,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44
[2024-03-12 00:43:04,529 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:04,529 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:04,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -880122470, now seen corresponding path program 1 times
[2024-03-12 00:43:04,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:04,530 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330162246]
[2024-03-12 00:43:04,530 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:04,530 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:04,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:04,559 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:04,559 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:04,560 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330162246]
[2024-03-12 00:43:04,560 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330162246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:04,560 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:43:04,560 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:43:04,561 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019003043]
[2024-03-12 00:43:04,561 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:04,561 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:43:04,562 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:04,562 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:43:04,562 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:43:04,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 211 out of 230
[2024-03-12 00:43:04,591 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 671 transitions, 5526 flow. Second operand  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:04,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:04,592 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 230
[2024-03-12 00:43:04,592 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:06,388 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 75#L1051-2true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 307#true, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:06,389 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is cut-off event
[2024-03-12 00:43:06,389 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:43:06,389 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:43:06,389 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:43:06,400 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][553], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 93#L1052-2true, Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 307#true, Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:06,401 INFO  L294   olderBase$Statistics]: this new event has 161 ancestors and is cut-off event
[2024-03-12 00:43:06,401 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 00:43:06,401 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 00:43:06,401 INFO  L297   olderBase$Statistics]:   existing Event has 161 ancestors and is cut-off event
[2024-03-12 00:43:07,113 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][393], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 75#L1051-2true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:07,113 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is cut-off event
[2024-03-12 00:43:07,114 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:43:07,114 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:43:07,114 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:43:07,114 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][393], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), 93#L1052-2true, Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:07,114 INFO  L294   olderBase$Statistics]: this new event has 164 ancestors and is cut-off event
[2024-03-12 00:43:07,114 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:43:07,115 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:43:07,115 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:43:08,009 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][669], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, 16#L1052-21true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 40#L1041-21true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:08,009 INFO  L294   olderBase$Statistics]: this new event has 169 ancestors and is cut-off event
[2024-03-12 00:43:08,009 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 00:43:08,010 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 00:43:08,010 INFO  L297   olderBase$Statistics]:   existing Event has 169 ancestors and is cut-off event
[2024-03-12 00:43:08,636 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][440], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, 296#true, 245#true, threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, 29#L1042true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 16#L1052-21true, Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:08,636 INFO  L294   olderBase$Statistics]: this new event has 172 ancestors and is cut-off event
[2024-03-12 00:43:08,636 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-12 00:43:08,636 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-12 00:43:08,637 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is cut-off event
[2024-03-12 00:43:12,027 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][539], [Black: 257#true, 262#true, 259#(= |#race~datas~0| 0), Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), 54#L1053true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 319#true, threadThread1of2ForFork0InUse, 296#true, 245#true, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, 374#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), 162#L1041-1true, Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), Black: 227#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 380#true, Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 307#true, Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:43:12,028 INFO  L294   olderBase$Statistics]: this new event has 172 ancestors and is not cut-off event
[2024-03-12 00:43:12,028 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-12 00:43:12,028 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-12 00:43:12,028 INFO  L297   olderBase$Statistics]:   existing Event has 172 ancestors and is not cut-off event
[2024-03-12 00:43:13,100 INFO  L124   PetriNetUnfolderBase]: 14273/59849 cut-off events.
[2024-03-12 00:43:13,100 INFO  L125   PetriNetUnfolderBase]: For 75265/82688 co-relation queries the response was YES.
[2024-03-12 00:43:13,663 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 135721 conditions, 59849 events. 14273/59849 cut-off events. For 75265/82688 co-relation queries the response was YES. Maximal size of possible extension queue 1799. Compared 885724 event pairs, 1131 based on Foata normal form. 231/53135 useless extension candidates. Maximal degree in co-relation 135421. Up to 7007 conditions per place. 
[2024-03-12 00:43:13,846 INFO  L140   encePairwiseOnDemand]: 221/230 looper letters, 28 selfloop transitions, 19 changer transitions 0/688 dead transitions.
[2024-03-12 00:43:13,846 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 688 transitions, 5706 flow
[2024-03-12 00:43:13,847 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:43:13,847 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:43:13,848 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions.
[2024-03-12 00:43:13,848 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9536231884057971
[2024-03-12 00:43:13,848 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 658 transitions.
[2024-03-12 00:43:13,848 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions.
[2024-03-12 00:43:13,848 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:13,849 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions.
[2024-03-12 00:43:13,849 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:13,850 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:13,850 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:13,850 INFO  L175             Difference]: Start difference. First operand has 287 places, 671 transitions, 5526 flow. Second operand 3 states and 658 transitions.
[2024-03-12 00:43:13,850 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 688 transitions, 5706 flow
[2024-03-12 00:43:14,549 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 688 transitions, 5670 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:43:14,555 INFO  L231             Difference]: Finished difference. Result has 286 places, 686 transitions, 5672 flow
[2024-03-12 00:43:14,556 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5490, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5672, PETRI_PLACES=286, PETRI_TRANSITIONS=686}
[2024-03-12 00:43:14,556 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 66 predicate places.
[2024-03-12 00:43:14,556 INFO  L495      AbstractCegarLoop]: Abstraction has has 286 places, 686 transitions, 5672 flow
[2024-03-12 00:43:14,556 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:14,556 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:14,557 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:43:14,557 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45
[2024-03-12 00:43:14,557 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:14,557 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:14,557 INFO  L85        PathProgramCache]: Analyzing trace with hash 664455343, now seen corresponding path program 1 times
[2024-03-12 00:43:14,558 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:14,558 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090879356]
[2024-03-12 00:43:14,558 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:14,558 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:14,584 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:15,006 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:15,006 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:15,007 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090879356]
[2024-03-12 00:43:15,007 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090879356] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:15,008 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982744900]
[2024-03-12 00:43:15,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:15,008 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:15,009 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:15,010 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:43:15,011 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-12 00:43:15,190 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:15,191 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core
[2024-03-12 00:43:15,196 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:15,201 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:43:15,241 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:43:15,241 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 00:43:15,296 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:43:15,296 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 00:43:15,558 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:43:15,559 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-03-12 00:43:15,616 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 24 treesize of output 12
[2024-03-12 00:43:15,635 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:43:15,642 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:43:15,654 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:15,654 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:43:15,667 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:15,667 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:43:15,694 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:15,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 00:43:15,707 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:15,708 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982744900] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:15,708 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:15,708 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 20
[2024-03-12 00:43:15,708 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779806769]
[2024-03-12 00:43:15,709 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:15,709 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:43:15,710 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:15,710 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:43:15,710 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420
[2024-03-12 00:43:16,468 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 230
[2024-03-12 00:43:16,469 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 686 transitions, 5672 flow. Second operand  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:16,470 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:16,470 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 230
[2024-03-12 00:43:16,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:30,663 INFO  L124   PetriNetUnfolderBase]: 24242/82021 cut-off events.
[2024-03-12 00:43:30,663 INFO  L125   PetriNetUnfolderBase]: For 153330/155979 co-relation queries the response was YES.
[2024-03-12 00:43:31,537 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 228747 conditions, 82021 events. 24242/82021 cut-off events. For 153330/155979 co-relation queries the response was YES. Maximal size of possible extension queue 2148. Compared 1157773 event pairs, 2722 based on Foata normal form. 213/74632 useless extension candidates. Maximal degree in co-relation 228364. Up to 11947 conditions per place. 
[2024-03-12 00:43:31,826 INFO  L140   encePairwiseOnDemand]: 206/230 looper letters, 979 selfloop transitions, 484 changer transitions 10/1684 dead transitions.
[2024-03-12 00:43:31,827 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1684 transitions, 19359 flow
[2024-03-12 00:43:31,828 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-12 00:43:31,828 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-12 00:43:31,829 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3680 transitions.
[2024-03-12 00:43:31,830 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8
[2024-03-12 00:43:31,830 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3680 transitions.
[2024-03-12 00:43:31,830 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3680 transitions.
[2024-03-12 00:43:31,830 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:31,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3680 transitions.
[2024-03-12 00:43:31,833 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 184.0) internal successors, (3680), 20 states have internal predecessors, (3680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:31,836 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:31,836 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 230.0) internal successors, (4830), 21 states have internal predecessors, (4830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:31,836 INFO  L175             Difference]: Start difference. First operand has 286 places, 686 transitions, 5672 flow. Second operand 20 states and 3680 transitions.
[2024-03-12 00:43:31,836 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 1684 transitions, 19359 flow
[2024-03-12 00:43:33,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 1684 transitions, 19321 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:43:33,411 INFO  L231             Difference]: Finished difference. Result has 312 places, 1089 transitions, 12480 flow
[2024-03-12 00:43:33,412 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=5634, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12480, PETRI_PLACES=312, PETRI_TRANSITIONS=1089}
[2024-03-12 00:43:33,412 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 92 predicate places.
[2024-03-12 00:43:33,412 INFO  L495      AbstractCegarLoop]: Abstraction has has 312 places, 1089 transitions, 12480 flow
[2024-03-12 00:43:33,412 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 174.21428571428572) internal successors, (2439), 14 states have internal predecessors, (2439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:33,413 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:43:33,413 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:43:33,420 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-12 00:43:33,613 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46
[2024-03-12 00:43:33,614 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:43:33,614 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:43:33,615 INFO  L85        PathProgramCache]: Analyzing trace with hash 822543803, now seen corresponding path program 2 times
[2024-03-12 00:43:33,615 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:43:33,615 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680739989]
[2024-03-12 00:43:33,615 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:43:33,616 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:43:33,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:43:34,203 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:34,203 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:43:34,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680739989]
[2024-03-12 00:43:34,204 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680739989] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:43:34,204 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625584287]
[2024-03-12 00:43:34,204 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:43:34,204 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:43:34,204 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:43:34,205 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:43:34,209 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-12 00:43:34,394 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:43:34,394 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:43:34,396 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-12 00:43:34,400 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:43:34,427 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:43:34,501 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:43:34,502 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:43:34,818 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:43:34,819 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:43:34,884 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:34,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:43:34,904 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:43:34,942 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:43:35,008 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:35,008 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:43:35,219 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:43:35,291 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:35,292 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-03-12 00:43:35,323 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:43:35,323 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:43:35,393 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:35,395 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:35,427 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:35,428 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:35,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:43:35,453 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:35,495 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:43:35,507 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:43:35,507 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:43:35,507 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625584287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:43:35,507 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:43:35,507 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:43:35,508 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125625405]
[2024-03-12 00:43:35,508 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:43:35,508 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:43:35,508 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:43:35,509 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:43:35,509 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:43:36,737 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 230
[2024-03-12 00:43:36,738 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 1089 transitions, 12480 flow. Second operand  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:36,738 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:43:36,738 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 230
[2024-03-12 00:43:36,739 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:43:56,840 INFO  L124   PetriNetUnfolderBase]: 25388/87947 cut-off events.
[2024-03-12 00:43:56,840 INFO  L125   PetriNetUnfolderBase]: For 256669/261476 co-relation queries the response was YES.
[2024-03-12 00:43:57,915 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 268903 conditions, 87947 events. 25388/87947 cut-off events. For 256669/261476 co-relation queries the response was YES. Maximal size of possible extension queue 2290. Compared 1260381 event pairs, 2454 based on Foata normal form. 536/80495 useless extension candidates. Maximal degree in co-relation 268434. Up to 12119 conditions per place. 
[2024-03-12 00:43:58,260 INFO  L140   encePairwiseOnDemand]: 202/230 looper letters, 804 selfloop transitions, 929 changer transitions 1/1946 dead transitions.
[2024-03-12 00:43:58,260 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 1946 transitions, 26403 flow
[2024-03-12 00:43:58,261 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-12 00:43:58,261 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-12 00:43:58,263 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4859 transitions.
[2024-03-12 00:43:58,264 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8125418060200669
[2024-03-12 00:43:58,264 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 4859 transitions.
[2024-03-12 00:43:58,264 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 4859 transitions.
[2024-03-12 00:43:58,264 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:43:58,265 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 4859 transitions.
[2024-03-12 00:43:58,268 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 186.8846153846154) internal successors, (4859), 26 states have internal predecessors, (4859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:58,271 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:58,271 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 230.0) internal successors, (6210), 27 states have internal predecessors, (6210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:43:58,271 INFO  L175             Difference]: Start difference. First operand has 312 places, 1089 transitions, 12480 flow. Second operand 26 states and 4859 transitions.
[2024-03-12 00:43:58,272 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 1946 transitions, 26403 flow
[2024-03-12 00:44:00,874 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 1946 transitions, 26263 flow, removed 64 selfloop flow, removed 6 redundant places.
[2024-03-12 00:44:00,896 INFO  L231             Difference]: Finished difference. Result has 342 places, 1555 transitions, 22779 flow
[2024-03-12 00:44:00,896 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=12356, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1089, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=503, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=22779, PETRI_PLACES=342, PETRI_TRANSITIONS=1555}
[2024-03-12 00:44:00,897 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 122 predicate places.
[2024-03-12 00:44:00,897 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 1555 transitions, 22779 flow
[2024-03-12 00:44:00,897 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:00,897 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:00,898 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:44:00,906 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0
[2024-03-12 00:44:01,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47
[2024-03-12 00:44:01,099 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:01,100 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:01,100 INFO  L85        PathProgramCache]: Analyzing trace with hash 64476113, now seen corresponding path program 3 times
[2024-03-12 00:44:01,100 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:01,101 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294909612]
[2024-03-12 00:44:01,101 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:01,101 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:01,122 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:01,755 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:01,755 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:01,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294909612]
[2024-03-12 00:44:01,755 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294909612] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:44:01,755 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1549460637]
[2024-03-12 00:44:01,756 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:44:01,756 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:44:01,756 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:44:01,757 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:44:01,760 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-12 00:44:01,940 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:44:01,941 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:44:01,942 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core
[2024-03-12 00:44:01,947 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:44:01,979 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:44:02,050 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:44:02,051 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:44:02,344 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:44:02,344 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:44:02,396 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:02,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:44:02,420 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-12 00:44:02,473 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-12 00:44:02,613 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:44:02,675 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:44:02,676 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-12 00:44:02,738 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:44:02,738 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-12 00:44:02,807 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:02,808 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:44:02,835 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:02,835 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:44:02,863 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:02,864 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:44:02,897 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:02,899 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:44:02,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-12 00:44:02,953 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:02,953 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:44:02,953 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1549460637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:44:02,953 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:44:02,954 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:44:02,954 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549320126]
[2024-03-12 00:44:02,954 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:44:02,955 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:44:02,955 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:44:02,956 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:44:02,956 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=605, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:44:04,277 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 173 out of 230
[2024-03-12 00:44:04,278 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 1555 transitions, 22779 flow. Second operand  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:04,278 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:44:04,279 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 230
[2024-03-12 00:44:04,279 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:44:29,000 INFO  L124   PetriNetUnfolderBase]: 27539/93268 cut-off events.
[2024-03-12 00:44:29,000 INFO  L125   PetriNetUnfolderBase]: For 448689/454860 co-relation queries the response was YES.
[2024-03-12 00:44:30,349 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 325501 conditions, 93268 events. 27539/93268 cut-off events. For 448689/454860 co-relation queries the response was YES. Maximal size of possible extension queue 2476. Compared 1342688 event pairs, 2759 based on Foata normal form. 881/85588 useless extension candidates. Maximal degree in co-relation 325123. Up to 13298 conditions per place. 
[2024-03-12 00:44:30,756 INFO  L140   encePairwiseOnDemand]: 202/230 looper letters, 1041 selfloop transitions, 1095 changer transitions 25/2373 dead transitions.
[2024-03-12 00:44:30,756 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 2373 transitions, 38498 flow
[2024-03-12 00:44:30,757 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-03-12 00:44:30,758 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-03-12 00:44:30,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4479 transitions.
[2024-03-12 00:44:30,760 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8114130434782608
[2024-03-12 00:44:30,760 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 4479 transitions.
[2024-03-12 00:44:30,760 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 4479 transitions.
[2024-03-12 00:44:30,760 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:44:30,761 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 4479 transitions.
[2024-03-12 00:44:30,763 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 186.625) internal successors, (4479), 24 states have internal predecessors, (4479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:30,766 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 230.0) internal successors, (5750), 25 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:30,767 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 230.0) internal successors, (5750), 25 states have internal predecessors, (5750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:30,767 INFO  L175             Difference]: Start difference. First operand has 342 places, 1555 transitions, 22779 flow. Second operand 24 states and 4479 transitions.
[2024-03-12 00:44:30,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 2373 transitions, 38498 flow
[2024-03-12 00:44:36,607 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 2373 transitions, 37619 flow, removed 418 selfloop flow, removed 7 redundant places.
[2024-03-12 00:44:36,636 INFO  L231             Difference]: Finished difference. Result has 368 places, 1930 transitions, 32736 flow
[2024-03-12 00:44:36,637 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=21970, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1555, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=756, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=32736, PETRI_PLACES=368, PETRI_TRANSITIONS=1930}
[2024-03-12 00:44:36,637 INFO  L281   CegarLoopForPetriNet]: 220 programPoint places, 148 predicate places.
[2024-03-12 00:44:36,638 INFO  L495      AbstractCegarLoop]: Abstraction has has 368 places, 1930 transitions, 32736 flow
[2024-03-12 00:44:36,638 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 175.06666666666666) internal successors, (2626), 15 states have internal predecessors, (2626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:44:36,638 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:44:36,638 INFO  L208   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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:44:36,646 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-12 00:44:36,839 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,14 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:44:36,840 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:44:36,840 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:44:36,841 INFO  L85        PathProgramCache]: Analyzing trace with hash -1062830067, now seen corresponding path program 4 times
[2024-03-12 00:44:36,841 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:44:36,841 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604578870]
[2024-03-12 00:44:36,842 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:44:36,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:44:36,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:44:37,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:37,440 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:44:37,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604578870]
[2024-03-12 00:44:37,441 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604578870] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:44:37,441 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473221554]
[2024-03-12 00:44:37,441 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:44:37,441 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:44:37,442 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:44:37,443 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 00:44:37,444 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-12 00:44:37,684 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:44:37,684 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:44:37,686 INFO  L262         TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 70 conjunts are in the unsatisfiable core
[2024-03-12 00:44:37,693 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:44:37,824 INFO  L378             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 6 treesize of output 5
[2024-03-12 00:44:37,923 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:44:37,924 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-03-12 00:44:38,861 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 00:44:38,861 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 00:44:38,869 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:38,869 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:44:39,160 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,161 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-03-12 00:44:39,166 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,167 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-03-12 00:44:39,198 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-12 00:44:39,491 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:44:39,501 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-12 00:44:39,576 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-12 00:44:39,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:44:39,760 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:44:39,842 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,843 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:44:39,889 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,889 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:44:39,913 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,914 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:44:39,963 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:44:39,963 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-12 00:44:40,068 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 52
[2024-03-12 00:44:40,179 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:44:40,179 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:44:49,244 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse6 (+ c_~datas~0.offset 2 .cse3)) (.cse8 (+ c_~datas~0.offset 3 .cse3))) (let ((.cse1 (+ |c_ULTIMATE.start_main_#t~mem21#1.offset| (* |c_ULTIMATE.start_main_~i~1#1| 4))) (.cse2 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select .cse0 |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse4 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse4 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select .cse4 |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse3)))) (forall ((v_ArrVal_2099 (Array Int Int))) (= (select (select (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse5 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select .cse5 |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1 0))) c_~datas~0.base) .cse6) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base| (store (select .cse7 |c_ULTIMATE.start_main_#t~mem21#1.base|) .cse1 0))) c_~datas~0.base) .cse8))))))) is different from false
[2024-03-12 00:45:17,237 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* c_threadThread1of2ForFork0_~j~0 4))) (let ((.cse10 (+ c_~datas~0.offset .cse4 1)) (.cse6 (+ c_~datas~0.offset 2 .cse4)) (.cse8 (+ c_~datas~0.offset 3 .cse4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse10 |c_threadThread1of2ForFork0_#t~nondet4|) .cse6 |c_threadThread1of2ForFork0_#t~nondet4|) .cse8 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((|v_ULTIMATE.start_main_~i~1#1_18| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_18|) (forall ((|v_ULTIMATE.start_main_#t~mem21#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem21#1.offset_14|) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse1 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ |v_ULTIMATE.start_main_#t~mem21#1.offset_14| (* |v_ULTIMATE.start_main_~i~1#1_18| 4)) 0))) c_~datas~0.base) (+ c_~datas~0.offset .cse4)))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_18| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_18|) (forall ((|v_ULTIMATE.start_main_#t~mem21#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem21#1.offset_14|) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse5 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse5 .cse2 (store (select .cse5 .cse2) (+ |v_ULTIMATE.start_main_#t~mem21#1.offset_14| (* |v_ULTIMATE.start_main_~i~1#1_18| 4)) 0))) c_~datas~0.base) .cse6))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_18| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_18|) (forall ((|v_ULTIMATE.start_main_#t~mem21#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem21#1.offset_14|) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse7 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse7 .cse2 (store (select .cse7 .cse2) (+ |v_ULTIMATE.start_main_#t~mem21#1.offset_14| (* |v_ULTIMATE.start_main_~i~1#1_18| 4)) 0))) c_~datas~0.base) .cse8))))))) (forall ((|v_ULTIMATE.start_main_~i~1#1_18| Int)) (or (< 0 |v_ULTIMATE.start_main_~i~1#1_18|) (forall ((|v_ULTIMATE.start_main_#t~mem21#1.offset_14| Int)) (or (< .cse0 |v_ULTIMATE.start_main_#t~mem21#1.offset_14|) (forall ((v_ArrVal_2099 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (let ((.cse9 (store .cse3 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_2099))) (store .cse9 .cse2 (store (select .cse9 .cse2) (+ |v_ULTIMATE.start_main_#t~mem21#1.offset_14| (* |v_ULTIMATE.start_main_~i~1#1_18| 4)) 0))) c_~datas~0.base) .cse10))))))))))) is different from false
[2024-03-12 00:45:17,766 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:17,767 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 109 treesize of output 89
[2024-03-12 00:45:17,787 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:17,788 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 499 treesize of output 457
[2024-03-12 00:45:17,810 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 270 treesize of output 246
[2024-03-12 00:45:18,046 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:18,047 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 116
[2024-03-12 00:45:18,114 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:45:18,115 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 1
[2024-03-12 00:45:18,126 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:45:18,126 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 1
[2024-03-12 00:45:18,139 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 00:45:18,140 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 110 treesize of output 1
[2024-03-12 00:45:37,947 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 77
[2024-03-12 00:45:37,955 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64
[2024-03-12 00:45:37,962 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76
[2024-03-12 00:45:37,979 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9
[2024-03-12 00:45:38,239 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:45:38,239 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39
[2024-03-12 00:45:38,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-12 00:45:38,376 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1473221554] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:45:38,376 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:45:38,376 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24, 22] total 58
[2024-03-12 00:45:38,377 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182303323]
[2024-03-12 00:45:38,377 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:45:38,377 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2024-03-12 00:45:38,378 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:45:38,379 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2024-03-12 00:45:38,380 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=2815, Unknown=57, NotChecked=222, Total=3422
[2024-03-12 00:45:38,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 125 out of 230
[2024-03-12 00:45:38,564 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 1930 transitions, 32736 flow. Second operand  has 59 states, 59 states have (on average 127.66101694915254) internal successors, (7532), 59 states have internal predecessors, (7532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:45:38,564 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:45:38,564 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 230
[2024-03-12 00:45:38,564 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:46:15,193 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-12 00:46:19,968 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]
[2024-03-12 00:47:53,139 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L1051-->L1051-1: Formula: (= |v_#race~threads_mask~0_1| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_1|}  AuxVars[]  AssignedVars[#race~threads_mask~0][7032], [130#L1051-1true, Black: 382#(= |threadThread1of2ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 257#true, 262#true, Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 2185#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 1447#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 245#true, 296#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 73#L1041-2true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 40#L1041-21true, Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), 711#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), 307#true, Black: 1465#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1473#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1457#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1463#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1459#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1471#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 259#(= |#race~datas~0| 0), Black: 1475#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1131#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1469#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1455#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1083#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1093#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1089#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 740#true, Black: 1087#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1077#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1103#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1101#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1095#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 319#true, threadThread1of2ForFork0InUse, Black: 755#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 723#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 719#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 400#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 715#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 721#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 729#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 727#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 717#(and (= |ULTIMATE.start_main_#t~mem18#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 725#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 227#true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:47:53,140 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is cut-off event
[2024-03-12 00:47:53,140 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:47:53,140 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:47:53,140 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is cut-off event
[2024-03-12 00:48:09,222 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([497] L1051-->L1051-1: Formula: (= |v_#race~threads_mask~0_1| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_1|}  AuxVars[]  AssignedVars[#race~threads_mask~0][438], [130#L1051-1true, Black: 382#(= |threadThread1of2ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 257#true, 262#true, Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 2185#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |ULTIMATE.start_main_~j~1#1| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 1447#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 245#true, 296#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 73#L1041-2true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), 711#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), 307#true, Black: 1465#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1473#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1457#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1463#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1459#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1471#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 259#(= |#race~datas~0| 0), Black: 1475#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1131#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1469#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1455#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1083#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1093#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1089#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 740#true, Black: 1087#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1077#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1103#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1101#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1095#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 319#true, threadThread1of2ForFork0InUse, Black: 755#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 723#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 719#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), threadThread2of2ForFork0InUse, Black: 400#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 715#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 721#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 729#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 727#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 717#(and (= |ULTIMATE.start_main_#t~mem18#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 725#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), 29#L1042true, Black: 227#true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:48:09,223 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is cut-off event
[2024-03-12 00:48:09,223 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:48:09,223 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:48:09,223 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is cut-off event
[2024-03-12 00:48:46,813 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([584] L1052-->L1052-1: Formula: (= |v_#race~threads_mask~0_4| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|}  AuxVars[]  AssignedVars[#race~threads_mask~0][41], [Black: 382#(= |threadThread1of2ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 257#true, 262#true, Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), 118#L1052-1true, Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), 1447#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 245#true, 296#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 73#L1041-2true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), 711#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), 307#true, Black: 1465#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1473#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1457#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1463#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1459#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1471#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 259#(= |#race~datas~0| 0), Black: 1475#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1131#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1469#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1455#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1083#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1093#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1089#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 740#true, Black: 1087#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1077#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1103#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1101#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1095#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 319#true, threadThread1of2ForFork0InUse, Black: 755#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 723#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 719#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 2195#(and (= threadThread1of2ForFork0_~arg.base 0) (= ~datas~0.offset 0) (= threadThread1of2ForFork0_~j~0 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |threadThread1of2ForFork0_#in~arg.offset| 0) (= threadThread1of2ForFork0_~arg.offset 0) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) 1) (= |threadThread1of2ForFork0_#in~arg.base| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#tids~0#1.base|) 0) 0) (<= (+ 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)) |#StackHeapBarrier|) (<= 0 |ULTIMATE.start_main_~breads_total~0#1|) (= |ULTIMATE.start_main_~#tids~0#1.offset| 0) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) 0)))), threadThread2of2ForFork0InUse, Black: 400#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 715#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 721#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 729#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 727#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 717#(and (= |ULTIMATE.start_main_#t~mem18#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 725#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), 29#L1042true, Black: 227#true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), 1071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:48:46,814 INFO  L294   olderBase$Statistics]: this new event has 164 ancestors and is cut-off event
[2024-03-12 00:48:46,814 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:48:46,814 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:48:46,814 INFO  L297   olderBase$Statistics]:   existing Event has 164 ancestors and is cut-off event
[2024-03-12 00:49:05,953 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([706] L1041-->L1041-1: Formula: (= |v_#race~threads_mask~0_10| 0)  InVars {}  OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_10|}  AuxVars[]  AssignedVars[#race~threads_mask~0][4167], [Black: 382#(= |threadThread1of2ForFork0_#t~nondet7| |#race~threads_mask~0|), Black: 257#true, 262#true, Black: 265#(and (<= (+ ~threads_mask~0 1) 0) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), Black: 264#(<= (+ ~threads_mask~0 1) 0), Black: 271#(<= (+ ~threads_mask~0 1) 0), Black: 272#(and (<= 2 |ULTIMATE.start_main_#t~nondet14#1|) (<= (+ ~threads_mask~0 1) 0)), Black: 279#(and (<= 0 (+ ~threads_mask~0 1)) (= |ULTIMATE.start_main_#t~nondet14#1| 1)), 245#true, 296#true, Black: 287#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet14#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 292#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet16#1|), 386#true, Black: 298#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 299#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 301#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), 171#main_returnLabel#1true, 40#L1041-21true, Black: 300#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 310#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), Black: 309#(= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0), Black: 312#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0)), Black: 311#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem21#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem21#1.offset| 1)) 0)), 307#true, 1547#(<= 0 |ULTIMATE.start_main_~breads_total~0#1|), 319#true, Black: 1465#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1473#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1457#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), 1116#true, Black: 1463#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1459#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1471#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), 259#(= |#race~datas~0| 0), Black: 1475#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1131#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 1469#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1455#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1083#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1093#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1071#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1089#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1087#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1077#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 1103#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 336#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 338#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 1101#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (<= (+ 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) |ULTIMATE.start_main_~#tids~0#1.base|)), Black: 1095#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (<= (+ ~datas~0.base 2) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base)) (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 2) |ULTIMATE.start_main_~#tids~0#1.base|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 1) |#StackHeapBarrier|)), Black: 755#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 334#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 723#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), threadThread1of2ForFork0InUse, Black: 328#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), Black: 719#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 400#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset)))), threadThread2of2ForFork0InUse, Black: 340#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 342#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 715#(and (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 721#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 729#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 727#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), Black: 717#(and (= |ULTIMATE.start_main_#t~mem18#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 725#(and (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= (select |#valid| |ULTIMATE.start_main_~#tids~0#1.base|) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) |ULTIMATE.start_main_~#tids~0#1.base|)) (= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|)) 1) (not (= ~datas~0.base (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|))) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |ULTIMATE.start_main_#t~mem21#1.base| ~datas~0.base))), 162#L1041-1true, Black: 227#true, 740#true, Black: 235#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 368#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 370#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 372#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 366#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 248#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 247#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 250#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 249#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 00:49:05,954 INFO  L294   olderBase$Statistics]: this new event has 171 ancestors and is not cut-off event
[2024-03-12 00:49:05,954 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is not cut-off event
[2024-03-12 00:49:05,954 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is not cut-off event
[2024-03-12 00:49:05,954 INFO  L297   olderBase$Statistics]:   existing Event has 171 ancestors and is not cut-off event
[2024-03-12 00:49:24,311 INFO  L124   PetriNetUnfolderBase]: 193928/601563 cut-off events.
[2024-03-12 00:49:24,311 INFO  L125   PetriNetUnfolderBase]: For 3743894/3756752 co-relation queries the response was YES.
[2024-03-12 00:49:34,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2065399 conditions, 601563 events. 193928/601563 cut-off events. For 3743894/3756752 co-relation queries the response was YES. Maximal size of possible extension queue 14931. Compared 10528031 event pairs, 23379 based on Foata normal form. 1984/538213 useless extension candidates. Maximal degree in co-relation 2040211. Up to 63333 conditions per place. 
[2024-03-12 00:49:37,602 INFO  L140   encePairwiseOnDemand]: 175/230 looper letters, 5042 selfloop transitions, 4167 changer transitions 1/9374 dead transitions.
[2024-03-12 00:49:37,602 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 9374 transitions, 169324 flow
[2024-03-12 00:49:37,617 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. 
[2024-03-12 00:49:37,617 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 121 states.
[2024-03-12 00:49:37,628 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 17110 transitions.
[2024-03-12 00:49:37,631 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.614804168163852
[2024-03-12 00:49:37,631 INFO  L72            ComplementDD]: Start complementDD. Operand 121 states and 17110 transitions.
[2024-03-12 00:49:37,631 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 121 states and 17110 transitions.
[2024-03-12 00:49:37,633 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:49:37,633 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 121 states and 17110 transitions.
[2024-03-12 00:49:37,644 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 122 states, 121 states have (on average 141.40495867768595) internal successors, (17110), 121 states have internal predecessors, (17110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:49:37,658 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 122 states, 122 states have (on average 230.0) internal successors, (28060), 122 states have internal predecessors, (28060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:49:37,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 122 states, 122 states have (on average 230.0) internal successors, (28060), 122 states have internal predecessors, (28060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:49:37,661 INFO  L175             Difference]: Start difference. First operand has 368 places, 1930 transitions, 32736 flow. Second operand 121 states and 17110 transitions.
[2024-03-12 00:49:37,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 9374 transitions, 169324 flow
Killed by 15
