./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-3.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-3.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 5571a3abb6f1c6e18dfb69de620f1be07f303efb1192d915811e35ddbe53d604
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 00:35:26,156 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 00:35:26,195 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:35:26,198 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 00:35:26,199 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 00:35:26,214 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 00:35:26,214 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 00:35:26,215 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 00:35:26,215 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 00:35:26,215 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 00:35:26,216 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 00:35:26,216 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 00:35:26,216 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 00:35:26,217 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 00:35:26,217 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 00:35:26,217 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 00:35:26,218 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 00:35:26,218 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 00:35:26,218 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 00:35:26,218 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 00:35:26,219 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 00:35:26,219 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 00:35:26,220 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 00:35:26,220 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 00:35:26,220 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 00:35:26,220 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 00:35:26,220 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 00:35:26,221 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 00:35:26,221 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 00:35:26,221 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 00:35:26,221 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:35:26,221 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 00:35:26,222 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 00:35:26,222 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 00:35:26,222 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 00:35:26,222 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 00:35:26,222 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 00:35:26,223 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 00:35:26,223 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 00:35:26,223 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 00:35:26,223 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 00:35:26,223 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 -> 5571a3abb6f1c6e18dfb69de620f1be07f303efb1192d915811e35ddbe53d604
[2024-03-12 00:35:26,387 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 00:35:26,409 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 00:35:26,411 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 00:35:26,412 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 00:35:26,414 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 00:35:26,415 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-3.i
[2024-03-12 00:35:27,417 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 00:35:27,629 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 00:35:27,629 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask-race-3.i
[2024-03-12 00:35:27,643 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/0293264de/ce49a0aa2d944e138174ed4611133be9/FLAGce5e092ad
[2024-03-12 00:35:27,655 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/0293264de/ce49a0aa2d944e138174ed4611133be9
[2024-03-12 00:35:27,657 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 00:35:27,658 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 00:35:27,659 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 00:35:27,659 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 00:35:27,663 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 00:35:27,664 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:35:27" (1/1) ...
[2024-03-12 00:35:27,664 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3880437f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:27, skipping insertion in model container
[2024-03-12 00:35:27,665 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:35:27" (1/1) ...
[2024-03-12 00:35:27,708 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 00:35:27,991 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:35:28,000 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 00:35:28,030 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:35:28,080 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-12 00:35:28,086 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 00:35:28,086 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28 WrapperNode
[2024-03-12 00:35:28,086 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 00:35:28,087 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 00:35:28,087 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 00:35:28,087 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 00:35:28,092 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:35:28" (1/1) ...
[2024-03-12 00:35:28,106 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:35:28" (1/1) ...
[2024-03-12 00:35:28,126 INFO  L138                Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-03-12 00:35:28,126 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 00:35:28,127 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 00:35:28,127 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 00:35:28,127 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 00:35:28,137 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,137 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,142 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,142 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,149 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,152 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,153 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,155 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,157 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 00:35:28,158 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 00:35:28,158 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 00:35:28,158 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 00:35:28,158 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (1/1) ...
[2024-03-12 00:35:28,163 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:35:28,171 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:35:28,186 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:35:28,190 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:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 00:35:28,213 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-12 00:35:28,214 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-12 00:35:28,214 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-12 00:35:28,214 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 00:35:28,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 00:35:28,214 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 00:35:28,214 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 00:35:28,215 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:35:28,338 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 00:35:28,340 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 00:35:28,597 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 00:35:28,613 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 00:35:28,613 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 00:35:28,614 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:35:28 BoogieIcfgContainer
[2024-03-12 00:35:28,615 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 00:35:28,616 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 00:35:28,616 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 00:35:28,618 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 00:35:28,619 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 12:35:27" (1/3) ...
[2024-03-12 00:35:28,619 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a74c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:35:28, skipping insertion in model container
[2024-03-12 00:35:28,619 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:35:28" (2/3) ...
[2024-03-12 00:35:28,619 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a74c848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:35:28, skipping insertion in model container
[2024-03-12 00:35:28,620 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:35:28" (3/3) ...
[2024-03-12 00:35:28,620 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-3.i
[2024-03-12 00:35:28,626 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 00:35:28,637 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 00:35:28,637 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-12 00:35:28,637 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 00:35:28,689 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 00:35:28,715 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:35:28,812 INFO  L124   PetriNetUnfolderBase]: 16/287 cut-off events.
[2024-03-12 00:35:28,812 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 00:35:28,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292 conditions, 287 events. 16/287 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 619 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. 
[2024-03-12 00:35:28,817 INFO  L82        GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow
[2024-03-12 00:35:28,821 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow
[2024-03-12 00:35:28,829 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:35:28,834 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;@42959f87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:35:28,834 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-12 00:35:28,840 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:35:28,840 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:35:28,840 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:35:28,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:28,841 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]
[2024-03-12 00:35:28,842 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:28,845 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:28,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 2042425697, now seen corresponding path program 1 times
[2024-03-12 00:35:28,852 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:28,852 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763890811]
[2024-03-12 00:35:28,852 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:28,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:28,980 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:29,069 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:35:29,069 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:29,069 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763890811]
[2024-03-12 00:35:29,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763890811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:29,070 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:29,070 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:35:29,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584406351]
[2024-03-12 00:35:29,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:29,077 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:35:29,081 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:29,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:35:29,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:35:29,128 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:35:29,132 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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:35:29,132 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:29,133 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:35:29,133 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:29,220 INFO  L124   PetriNetUnfolderBase]: 34/480 cut-off events.
[2024-03-12 00:35:29,220 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:35:29,222 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 480 events. 34/480 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1821 event pairs, 12 based on Foata normal form. 10/421 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. 
[2024-03-12 00:35:29,225 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions.
[2024-03-12 00:35:29,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow
[2024-03-12 00:35:29,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:35:29,228 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:35:29,235 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2024-03-12 00:35:29,237 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.936026936026936
[2024-03-12 00:35:29,238 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2024-03-12 00:35:29,238 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2024-03-12 00:35:29,240 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:29,242 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2024-03-12 00:35:29,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 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:35:29,251 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,251 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,253 INFO  L175             Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions.
[2024-03-12 00:35:29,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow
[2024-03-12 00:35:29,264 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:35:29,268 INFO  L231             Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow
[2024-03-12 00:35:29,270 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=191, PETRI_TRANSITIONS=191}
[2024-03-12 00:35:29,273 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:35:29,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow
[2024-03-12 00:35:29,274 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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:35:29,274 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:29,274 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]
[2024-03-12 00:35:29,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 00:35:29,274 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:29,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:29,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -103642509, now seen corresponding path program 1 times
[2024-03-12 00:35:29,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:29,276 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506878526]
[2024-03-12 00:35:29,276 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:29,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:29,309 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:29,349 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:35:29,349 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:29,350 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506878526]
[2024-03-12 00:35:29,350 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506878526] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:29,350 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:29,350 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:35:29,350 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908690223]
[2024-03-12 00:35:29,350 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:29,351 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:35:29,352 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:29,352 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:35:29,352 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:35:29,378 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:35:29,379 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 393 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,379 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:29,379 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:35:29,379 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:29,483 INFO  L124   PetriNetUnfolderBase]: 87/676 cut-off events.
[2024-03-12 00:35:29,483 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 00:35:29,485 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 803 conditions, 676 events. 87/676 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3260 event pairs, 17 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 757. Up to 64 conditions per place. 
[2024-03-12 00:35:29,487 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions.
[2024-03-12 00:35:29,487 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow
[2024-03-12 00:35:29,488 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:35:29,488 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:35:29,489 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-03-12 00:35:29,490 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-03-12 00:35:29,490 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-03-12 00:35:29,490 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-03-12 00:35:29,491 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:29,491 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-03-12 00:35:29,492 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 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:35:29,494 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,495 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,495 INFO  L175             Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions.
[2024-03-12 00:35:29,495 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow
[2024-03-12 00:35:29,497 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:35:29,499 INFO  L231             Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow
[2024-03-12 00:35:29,499 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=191, PETRI_TRANSITIONS=199}
[2024-03-12 00:35:29,500 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-12 00:35:29,500 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow
[2024-03-12 00:35:29,501 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:29,501 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:29,501 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:35:29,501 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 00:35:29,501 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:29,502 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:29,502 INFO  L85        PathProgramCache]: Analyzing trace with hash -1853499857, now seen corresponding path program 1 times
[2024-03-12 00:35:29,502 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:29,502 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838410401]
[2024-03-12 00:35:29,502 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:29,503 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:29,525 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:29,620 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:35:29,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:29,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838410401]
[2024-03-12 00:35:29,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838410401] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:29,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:29,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:35:29,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501860966]
[2024-03-12 00:35:29,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:29,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:35:29,623 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:29,623 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:35:29,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:35:29,683 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:35:29,685 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 459 flow. Second operand  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 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:35:29,685 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:29,685 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:35:29,685 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:29,807 INFO  L124   PetriNetUnfolderBase]: 68/710 cut-off events.
[2024-03-12 00:35:29,807 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-03-12 00:35:29,809 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 874 conditions, 710 events. 68/710 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3449 event pairs, 7 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 685. Up to 61 conditions per place. 
[2024-03-12 00:35:29,811 INFO  L140   encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions.
[2024-03-12 00:35:29,811 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow
[2024-03-12 00:35:29,812 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:35:29,812 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:35:29,813 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions.
[2024-03-12 00:35:29,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-12 00:35:29,814 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions.
[2024-03-12 00:35:29,814 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions.
[2024-03-12 00:35:29,814 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:29,815 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions.
[2024-03-12 00:35:29,817 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 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:35:29,819 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:29,819 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:29,819 INFO  L175             Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions.
[2024-03-12 00:35:29,820 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow
[2024-03-12 00:35:29,822 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:35:29,824 INFO  L231             Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow
[2024-03-12 00:35:29,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=198, PETRI_TRANSITIONS=203}
[2024-03-12 00:35:29,825 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places.
[2024-03-12 00:35:29,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow
[2024-03-12 00:35:29,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 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:35:29,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:29,826 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:35:29,826 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 00:35:29,826 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:29,827 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:29,827 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513540216, now seen corresponding path program 1 times
[2024-03-12 00:35:29,827 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:29,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374303978]
[2024-03-12 00:35:29,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:29,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:29,844 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:30,106 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:35:30,106 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:30,106 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374303978]
[2024-03-12 00:35:30,106 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374303978] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:30,106 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:30,106 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:35:30,107 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435511906]
[2024-03-12 00:35:30,107 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:30,107 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:35:30,107 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:30,108 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:35:30,108 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:35:30,334 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198
[2024-03-12 00:35:30,336 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 203 transitions, 485 flow. Second operand  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 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:35:30,336 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:30,336 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198
[2024-03-12 00:35:30,336 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:30,581 INFO  L124   PetriNetUnfolderBase]: 300/1732 cut-off events.
[2024-03-12 00:35:30,581 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-12 00:35:30,584 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1732 events. 300/1732 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12671 event pairs, 35 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 2225. Up to 300 conditions per place. 
[2024-03-12 00:35:30,589 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 52 selfloop transitions, 29 changer transitions 0/252 dead transitions.
[2024-03-12 00:35:30,589 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 748 flow
[2024-03-12 00:35:30,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:35:30,590 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:35:30,591 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions.
[2024-03-12 00:35:30,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-12 00:35:30,592 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions.
[2024-03-12 00:35:30,592 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions.
[2024-03-12 00:35:30,592 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:30,592 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions.
[2024-03-12 00:35:30,594 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 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:35:30,596 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:30,597 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:30,597 INFO  L175             Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1056 transitions.
[2024-03-12 00:35:30,597 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 748 flow
[2024-03-12 00:35:30,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 252 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:35:30,602 INFO  L231             Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow
[2024-03-12 00:35:30,602 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=207, PETRI_TRANSITIONS=232}
[2024-03-12 00:35:30,603 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places.
[2024-03-12 00:35:30,603 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow
[2024-03-12 00:35:30,604 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 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:35:30,604 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:30,604 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:35:30,604 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 00:35:30,604 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:30,605 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:30,605 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962435246, now seen corresponding path program 1 times
[2024-03-12 00:35:30,605 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:30,605 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135735694]
[2024-03-12 00:35:30,605 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:30,606 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:30,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:30,636 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:35:30,636 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:30,636 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135735694]
[2024-03-12 00:35:30,636 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135735694] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:30,636 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:30,636 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:35:30,637 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261432122]
[2024-03-12 00:35:30,637 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:30,637 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:35:30,637 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:30,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:35:30,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:35:30,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198
[2024-03-12 00:35:30,650 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 703 flow. Second operand  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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:35:30,650 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:30,650 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198
[2024-03-12 00:35:30,653 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:30,784 INFO  L124   PetriNetUnfolderBase]: 205/1519 cut-off events.
[2024-03-12 00:35:30,784 INFO  L125   PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES.
[2024-03-12 00:35:30,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1519 events. 205/1519 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10793 event pairs, 21 based on Foata normal form. 0/1358 useless extension candidates. Maximal degree in co-relation 1935. Up to 114 conditions per place. 
[2024-03-12 00:35:30,792 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 13 selfloop transitions, 2 changer transitions 4/234 dead transitions.
[2024-03-12 00:35:30,792 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 234 transitions, 737 flow
[2024-03-12 00:35:30,792 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:35:30,792 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:35:30,793 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions.
[2024-03-12 00:35:30,794 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2024-03-12 00:35:30,794 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 560 transitions.
[2024-03-12 00:35:30,794 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions.
[2024-03-12 00:35:30,794 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:30,794 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions.
[2024-03-12 00:35:30,795 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 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:35:30,796 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:30,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:30,797 INFO  L175             Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 560 transitions.
[2024-03-12 00:35:30,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 234 transitions, 737 flow
[2024-03-12 00:35:30,800 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 234 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:35:30,802 INFO  L231             Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow
[2024-03-12 00:35:30,802 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=208, PETRI_TRANSITIONS=228}
[2024-03-12 00:35:30,803 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places.
[2024-03-12 00:35:30,803 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow
[2024-03-12 00:35:30,803 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 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:35:30,803 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:30,803 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]
[2024-03-12 00:35:30,804 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 00:35:30,804 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:30,804 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:30,804 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906226017, now seen corresponding path program 1 times
[2024-03-12 00:35:30,804 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:30,804 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124616043]
[2024-03-12 00:35:30,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:30,805 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:30,814 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:30,877 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:35:30,877 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:30,877 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124616043]
[2024-03-12 00:35:30,878 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124616043] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:30,878 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:30,878 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:35:30,878 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629682879]
[2024-03-12 00:35:30,878 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:30,879 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:35:30,879 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:30,880 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:35:30,880 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:35:30,929 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:35:30,930 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 689 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:30,930 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:30,930 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:35:30,930 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:31,078 INFO  L124   PetriNetUnfolderBase]: 200/1438 cut-off events.
[2024-03-12 00:35:31,078 INFO  L125   PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES.
[2024-03-12 00:35:31,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1438 events. 200/1438 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10134 event pairs, 36 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-03-12 00:35:31,085 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:35:31,085 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow
[2024-03-12 00:35:31,086 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:35:31,086 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:35:31,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:35:31,087 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:35:31,087 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,087 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,088 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:31,088 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,089 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 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:35:31,090 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,090 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,090 INFO  L175             Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:35:31,091 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow
[2024-03-12 00:35:31,094 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 00:35:31,096 INFO  L231             Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow
[2024-03-12 00:35:31,096 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=206, PETRI_TRANSITIONS=231}
[2024-03-12 00:35:31,097 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places.
[2024-03-12 00:35:31,097 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow
[2024-03-12 00:35:31,097 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:31,097 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:31,097 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]
[2024-03-12 00:35:31,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 00:35:31,098 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:31,098 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:31,098 INFO  L85        PathProgramCache]: Analyzing trace with hash -448517900, now seen corresponding path program 1 times
[2024-03-12 00:35:31,098 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:31,098 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586615112]
[2024-03-12 00:35:31,098 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:31,099 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:31,108 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:31,162 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:35:31,162 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:31,162 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586615112]
[2024-03-12 00:35:31,162 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586615112] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:31,162 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:31,162 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:35:31,163 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601540230]
[2024-03-12 00:35:31,163 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:31,163 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:35:31,163 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:31,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:35:31,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:35:31,213 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:35:31,214 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 231 transitions, 702 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:31,214 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:31,214 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:35:31,214 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:31,354 INFO  L124   PetriNetUnfolderBase]: 199/1436 cut-off events.
[2024-03-12 00:35:31,354 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-03-12 00:35:31,357 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1436 events. 199/1436 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10120 event pairs, 36 based on Foata normal form. 1/1292 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-03-12 00:35:31,360 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:35:31,361 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow
[2024-03-12 00:35:31,361 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:35:31,362 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:35:31,362 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2024-03-12 00:35:31,363 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9305555555555556
[2024-03-12 00:35:31,363 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2024-03-12 00:35:31,363 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2024-03-12 00:35:31,364 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:31,364 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2024-03-12 00:35:31,365 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:31,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,367 INFO  L175             Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions.
[2024-03-12 00:35:31,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow
[2024-03-12 00:35:31,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:35:31,371 INFO  L231             Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow
[2024-03-12 00:35:31,372 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=211, PETRI_TRANSITIONS=232}
[2024-03-12 00:35:31,372 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places.
[2024-03-12 00:35:31,372 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow
[2024-03-12 00:35:31,373 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:31,373 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:31,373 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]
[2024-03-12 00:35:31,373 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 00:35:31,373 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:31,373 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:31,373 INFO  L85        PathProgramCache]: Analyzing trace with hash 1105825585, now seen corresponding path program 1 times
[2024-03-12 00:35:31,374 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:31,374 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64978254]
[2024-03-12 00:35:31,374 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:31,374 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:31,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:31,436 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:35:31,436 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:31,436 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64978254]
[2024-03-12 00:35:31,436 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64978254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:31,436 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:31,436 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:35:31,437 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733876233]
[2024-03-12 00:35:31,437 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:31,437 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:35:31,437 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:31,437 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:35:31,438 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:35:31,492 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:35:31,492 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 721 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:31,492 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:31,492 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:35:31,492 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:31,645 INFO  L124   PetriNetUnfolderBase]: 198/1434 cut-off events.
[2024-03-12 00:35:31,645 INFO  L125   PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES.
[2024-03-12 00:35:31,649 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 1434 events. 198/1434 cut-off events. For 134/134 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10151 event pairs, 36 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2085. Up to 138 conditions per place. 
[2024-03-12 00:35:31,652 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-12 00:35:31,652 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow
[2024-03-12 00:35:31,653 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:35:31,653 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:35:31,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-12 00:35:31,654 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-12 00:35:31,654 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,654 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:31,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-12 00:35:31,656 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 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:35:31,657 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,658 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,658 INFO  L175             Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions.
[2024-03-12 00:35:31,658 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow
[2024-03-12 00:35:31,661 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:35:31,663 INFO  L231             Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow
[2024-03-12 00:35:31,663 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=214, PETRI_TRANSITIONS=232}
[2024-03-12 00:35:31,664 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places.
[2024-03-12 00:35:31,664 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow
[2024-03-12 00:35:31,664 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 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:35:31,664 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:31,664 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]
[2024-03-12 00:35:31,665 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 00:35:31,665 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:31,665 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:31,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -949863044, now seen corresponding path program 1 times
[2024-03-12 00:35:31,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:31,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702961327]
[2024-03-12 00:35:31,666 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:31,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:31,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:31,722 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:35:31,723 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:31,723 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702961327]
[2024-03-12 00:35:31,723 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702961327] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:31,723 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:31,723 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:35:31,723 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036563626]
[2024-03-12 00:35:31,723 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:31,724 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:35:31,724 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:31,724 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:35:31,724 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:35:31,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198
[2024-03-12 00:35:31,767 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 232 transitions, 730 flow. Second operand  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 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:35:31,767 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:31,767 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198
[2024-03-12 00:35:31,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:31,926 INFO  L124   PetriNetUnfolderBase]: 201/1436 cut-off events.
[2024-03-12 00:35:31,926 INFO  L125   PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES.
[2024-03-12 00:35:31,931 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1436 events. 201/1436 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10158 event pairs, 40 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2105. Up to 148 conditions per place. 
[2024-03-12 00:35:31,935 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-12 00:35:31,935 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow
[2024-03-12 00:35:31,936 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:35:31,936 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:35:31,937 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions.
[2024-03-12 00:35:31,937 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267676767676768
[2024-03-12 00:35:31,937 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 734 transitions.
[2024-03-12 00:35:31,937 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions.
[2024-03-12 00:35:31,938 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:31,938 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions.
[2024-03-12 00:35:31,939 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 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:35:31,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,940 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 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:35:31,940 INFO  L175             Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions.
[2024-03-12 00:35:31,940 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow
[2024-03-12 00:35:31,944 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:35:31,946 INFO  L231             Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow
[2024-03-12 00:35:31,946 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=215, PETRI_TRANSITIONS=232}
[2024-03-12 00:35:31,946 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places.
[2024-03-12 00:35:31,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow
[2024-03-12 00:35:31,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 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:35:31,947 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:31,947 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]
[2024-03-12 00:35:31,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 00:35:31,947 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:31,948 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:31,948 INFO  L85        PathProgramCache]: Analyzing trace with hash 1442556267, now seen corresponding path program 1 times
[2024-03-12 00:35:31,948 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:31,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456395357]
[2024-03-12 00:35:31,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:31,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:31,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:31,981 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:35:31,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:31,982 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456395357]
[2024-03-12 00:35:31,982 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456395357] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:31,982 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:31,982 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:35:31,982 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838013931]
[2024-03-12 00:35:31,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:31,983 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:35:31,983 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:31,983 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:35:31,983 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:35:32,009 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-12 00:35:32,010 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 232 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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:35:32,010 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:32,010 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-12 00:35:32,010 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:32,145 INFO  L124   PetriNetUnfolderBase]: 223/1511 cut-off events.
[2024-03-12 00:35:32,145 INFO  L125   PetriNetUnfolderBase]: For 187/196 co-relation queries the response was YES.
[2024-03-12 00:35:32,150 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1511 events. 223/1511 cut-off events. For 187/196 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10898 event pairs, 35 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 2291. Up to 177 conditions per place. 
[2024-03-12 00:35:32,154 INFO  L140   encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions.
[2024-03-12 00:35:32,154 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow
[2024-03-12 00:35:32,154 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:35:32,154 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:35:32,155 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions.
[2024-03-12 00:35:32,155 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9343434343434344
[2024-03-12 00:35:32,156 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 555 transitions.
[2024-03-12 00:35:32,156 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions.
[2024-03-12 00:35:32,156 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:32,156 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions.
[2024-03-12 00:35:32,157 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 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:35:32,158 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:32,158 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:32,158 INFO  L175             Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions.
[2024-03-12 00:35:32,158 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow
[2024-03-12 00:35:32,161 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:35:32,163 INFO  L231             Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow
[2024-03-12 00:35:32,164 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=216, PETRI_TRANSITIONS=237}
[2024-03-12 00:35:32,164 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places.
[2024-03-12 00:35:32,164 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow
[2024-03-12 00:35:32,165 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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:35:32,165 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:32,165 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]
[2024-03-12 00:35:32,165 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 00:35:32,165 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:32,166 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:32,166 INFO  L85        PathProgramCache]: Analyzing trace with hash -481296020, now seen corresponding path program 1 times
[2024-03-12 00:35:32,166 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:32,166 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841299114]
[2024-03-12 00:35:32,166 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:32,166 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:32,188 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:32,472 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:35:32,472 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:32,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841299114]
[2024-03-12 00:35:32,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841299114] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:32,472 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:32,472 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:35:32,472 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146359943]
[2024-03-12 00:35:32,472 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:32,473 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:35:32,473 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:32,473 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:35:32,473 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:35:32,608 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198
[2024-03-12 00:35:32,608 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 237 transitions, 782 flow. Second operand  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 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:35:32,608 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:32,608 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198
[2024-03-12 00:35:32,609 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:33,018 INFO  L124   PetriNetUnfolderBase]: 567/2728 cut-off events.
[2024-03-12 00:35:33,018 INFO  L125   PetriNetUnfolderBase]: For 664/719 co-relation queries the response was YES.
[2024-03-12 00:35:33,026 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 2728 events. 567/2728 cut-off events. For 664/719 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 22357 event pairs, 129 based on Foata normal form. 9/2479 useless extension candidates. Maximal degree in co-relation 4874. Up to 768 conditions per place. 
[2024-03-12 00:35:33,032 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 64 selfloop transitions, 83 changer transitions 0/326 dead transitions.
[2024-03-12 00:35:33,033 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 326 transitions, 1428 flow
[2024-03-12 00:35:33,033 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:35:33,033 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:35:33,035 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions.
[2024-03-12 00:35:33,035 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9065656565656566
[2024-03-12 00:35:33,035 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions.
[2024-03-12 00:35:33,035 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions.
[2024-03-12 00:35:33,036 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:33,036 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions.
[2024-03-12 00:35:33,037 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 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:35:33,039 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:33,039 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:33,039 INFO  L175             Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 6 states and 1077 transitions.
[2024-03-12 00:35:33,039 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 326 transitions, 1428 flow
[2024-03-12 00:35:33,044 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 326 transitions, 1414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:35:33,047 INFO  L231             Difference]: Finished difference. Result has 224 places, 318 transitions, 1504 flow
[2024-03-12 00:35:33,047 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=224, PETRI_TRANSITIONS=318}
[2024-03-12 00:35:33,048 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 34 predicate places.
[2024-03-12 00:35:33,048 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 318 transitions, 1504 flow
[2024-03-12 00:35:33,048 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 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:35:33,048 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:33,048 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, 1, 1]
[2024-03-12 00:35:33,048 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 00:35:33,048 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:33,049 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:33,049 INFO  L85        PathProgramCache]: Analyzing trace with hash 7104340, now seen corresponding path program 1 times
[2024-03-12 00:35:33,049 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:33,049 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360513004]
[2024-03-12 00:35:33,049 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:33,049 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:33,068 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:33,351 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:35:33,352 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:33,352 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360513004]
[2024-03-12 00:35:33,352 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360513004] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:33,352 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:33,352 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:35:33,352 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007962839]
[2024-03-12 00:35:33,352 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:33,352 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:35:33,353 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:33,353 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:35:33,353 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:35:33,565 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198
[2024-03-12 00:35:33,566 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 318 transitions, 1504 flow. Second operand  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 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:35:33,566 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:33,566 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198
[2024-03-12 00:35:33,566 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:33,856 INFO  L124   PetriNetUnfolderBase]: 520/2369 cut-off events.
[2024-03-12 00:35:33,856 INFO  L125   PetriNetUnfolderBase]: For 1360/1387 co-relation queries the response was YES.
[2024-03-12 00:35:33,864 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 2369 events. 520/2369 cut-off events. For 1360/1387 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 18327 event pairs, 65 based on Foata normal form. 0/2205 useless extension candidates. Maximal degree in co-relation 5081. Up to 434 conditions per place. 
[2024-03-12 00:35:33,870 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 43 changer transitions 12/366 dead transitions.
[2024-03-12 00:35:33,870 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 366 transitions, 2003 flow
[2024-03-12 00:35:33,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:35:33,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:35:33,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions.
[2024-03-12 00:35:33,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-03-12 00:35:33,873 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions.
[2024-03-12 00:35:33,873 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions.
[2024-03-12 00:35:33,874 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:33,874 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions.
[2024-03-12 00:35:33,875 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 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:35:33,877 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:33,877 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 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:35:33,877 INFO  L175             Difference]: Start difference. First operand has 224 places, 318 transitions, 1504 flow. Second operand 6 states and 1080 transitions.
[2024-03-12 00:35:33,878 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 366 transitions, 2003 flow
[2024-03-12 00:35:33,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 366 transitions, 1949 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:35:33,890 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 1907 flow
[2024-03-12 00:35:33,891 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=234, PETRI_TRANSITIONS=350}
[2024-03-12 00:35:33,891 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 44 predicate places.
[2024-03-12 00:35:33,891 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 1907 flow
[2024-03-12 00:35:33,892 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 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:35:33,892 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:33,892 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, 1, 1, 1, 1, 1]
[2024-03-12 00:35:33,892 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 00:35:33,892 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:33,892 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:33,892 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630577086, now seen corresponding path program 1 times
[2024-03-12 00:35:33,892 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:33,893 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711465739]
[2024-03-12 00:35:33,893 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:33,893 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:33,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:34,286 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:35:34,286 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:34,286 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711465739]
[2024-03-12 00:35:34,286 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711465739] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:34,286 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:34,286 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:35:34,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205655216]
[2024-03-12 00:35:34,287 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:34,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:35:34,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:34,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:35:34,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:35:34,755 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198
[2024-03-12 00:35:34,756 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 1907 flow. Second operand  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 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:35:34,756 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:34,757 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198
[2024-03-12 00:35:34,757 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:35,589 INFO  L124   PetriNetUnfolderBase]: 624/2784 cut-off events.
[2024-03-12 00:35:35,589 INFO  L125   PetriNetUnfolderBase]: For 2186/2398 co-relation queries the response was YES.
[2024-03-12 00:35:35,599 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6637 conditions, 2784 events. 624/2784 cut-off events. For 2186/2398 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 23258 event pairs, 114 based on Foata normal form. 82/2653 useless extension candidates. Maximal degree in co-relation 6581. Up to 527 conditions per place. 
[2024-03-12 00:35:35,605 INFO  L140   encePairwiseOnDemand]: 182/198 looper letters, 220 selfloop transitions, 73 changer transitions 1/462 dead transitions.
[2024-03-12 00:35:35,605 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 462 transitions, 3201 flow
[2024-03-12 00:35:35,607 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:35:35,607 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:35:35,609 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1839 transitions.
[2024-03-12 00:35:35,610 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8443526170798898
[2024-03-12 00:35:35,610 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1839 transitions.
[2024-03-12 00:35:35,610 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1839 transitions.
[2024-03-12 00:35:35,611 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:35,611 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1839 transitions.
[2024-03-12 00:35:35,613 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 167.1818181818182) internal successors, (1839), 11 states have internal predecessors, (1839), 0 states have call successors, (0), 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:35:35,616 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 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:35:35,617 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 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:35:35,617 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 1907 flow. Second operand 11 states and 1839 transitions.
[2024-03-12 00:35:35,617 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 462 transitions, 3201 flow
[2024-03-12 00:35:35,629 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 462 transitions, 3165 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-12 00:35:35,634 INFO  L231             Difference]: Finished difference. Result has 246 places, 374 transitions, 2339 flow
[2024-03-12 00:35:35,634 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=246, PETRI_TRANSITIONS=374}
[2024-03-12 00:35:35,634 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places.
[2024-03-12 00:35:35,635 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 374 transitions, 2339 flow
[2024-03-12 00:35:35,635 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 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:35:35,635 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:35,635 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, 1, 1, 1, 1, 1]
[2024-03-12 00:35:35,635 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-12 00:35:35,636 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:35,636 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:35,636 INFO  L85        PathProgramCache]: Analyzing trace with hash -843954482, now seen corresponding path program 1 times
[2024-03-12 00:35:35,636 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:35,636 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137861702]
[2024-03-12 00:35:35,636 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:35,636 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:35,658 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:36,040 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:35:36,040 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:36,040 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137861702]
[2024-03-12 00:35:36,040 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137861702] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:36,040 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:36,040 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:35:36,040 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202297267]
[2024-03-12 00:35:36,040 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:36,041 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:35:36,041 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:36,041 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:35:36,041 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:35:36,415 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 198
[2024-03-12 00:35:36,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 374 transitions, 2339 flow. Second operand  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 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:35:36,426 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:36,426 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 198
[2024-03-12 00:35:36,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:36,874 INFO  L124   PetriNetUnfolderBase]: 533/2461 cut-off events.
[2024-03-12 00:35:36,874 INFO  L125   PetriNetUnfolderBase]: For 3895/4124 co-relation queries the response was YES.
[2024-03-12 00:35:36,881 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6579 conditions, 2461 events. 533/2461 cut-off events. For 3895/4124 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20447 event pairs, 84 based on Foata normal form. 47/2334 useless extension candidates. Maximal degree in co-relation 6512. Up to 633 conditions per place. 
[2024-03-12 00:35:36,886 INFO  L140   encePairwiseOnDemand]: 186/198 looper letters, 161 selfloop transitions, 18 changer transitions 1/382 dead transitions.
[2024-03-12 00:35:36,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 382 transitions, 2757 flow
[2024-03-12 00:35:36,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:35:36,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:35:36,889 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1627 transitions.
[2024-03-12 00:35:36,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8217171717171717
[2024-03-12 00:35:36,889 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1627 transitions.
[2024-03-12 00:35:36,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1627 transitions.
[2024-03-12 00:35:36,890 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:36,890 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1627 transitions.
[2024-03-12 00:35:36,892 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 162.7) internal successors, (1627), 10 states have internal predecessors, (1627), 0 states have call successors, (0), 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:35:36,894 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 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:35:36,895 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 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:35:36,895 INFO  L175             Difference]: Start difference. First operand has 246 places, 374 transitions, 2339 flow. Second operand 10 states and 1627 transitions.
[2024-03-12 00:35:36,895 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 382 transitions, 2757 flow
[2024-03-12 00:35:36,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 382 transitions, 2751 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:35:36,915 INFO  L231             Difference]: Finished difference. Result has 253 places, 375 transitions, 2405 flow
[2024-03-12 00:35:36,915 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2405, PETRI_PLACES=253, PETRI_TRANSITIONS=375}
[2024-03-12 00:35:36,916 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places.
[2024-03-12 00:35:36,916 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 375 transitions, 2405 flow
[2024-03-12 00:35:36,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 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:35:36,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:36,916 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, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:35:36,916 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-12 00:35:36,916 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:36,917 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:36,917 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091322874, now seen corresponding path program 1 times
[2024-03-12 00:35:36,917 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:36,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833224706]
[2024-03-12 00:35:36,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:36,917 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:36,932 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:36,951 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:35:36,951 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:36,951 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833224706]
[2024-03-12 00:35:36,951 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833224706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:36,951 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:35:36,951 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:35:36,951 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646677051]
[2024-03-12 00:35:36,951 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:36,952 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:35:36,952 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:36,952 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:35:36,952 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:35:36,970 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-12 00:35:36,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 375 transitions, 2405 flow. Second operand  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 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:35:36,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:36,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-12 00:35:36,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:37,232 INFO  L124   PetriNetUnfolderBase]: 492/2306 cut-off events.
[2024-03-12 00:35:37,232 INFO  L125   PetriNetUnfolderBase]: For 3298/3383 co-relation queries the response was YES.
[2024-03-12 00:35:37,239 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5942 conditions, 2306 events. 492/2306 cut-off events. For 3298/3383 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 18510 event pairs, 47 based on Foata normal form. 12/2193 useless extension candidates. Maximal degree in co-relation 5862. Up to 278 conditions per place. 
[2024-03-12 00:35:37,243 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 20 selfloop transitions, 11 changer transitions 31/384 dead transitions.
[2024-03-12 00:35:37,243 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 384 transitions, 2499 flow
[2024-03-12 00:35:37,243 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:35:37,243 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:35:37,244 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2024-03-12 00:35:37,244 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9410774410774411
[2024-03-12 00:35:37,244 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2024-03-12 00:35:37,244 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2024-03-12 00:35:37,245 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:37,245 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2024-03-12 00:35:37,246 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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:35:37,246 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:37,246 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:35:37,246 INFO  L175             Difference]: Start difference. First operand has 253 places, 375 transitions, 2405 flow. Second operand 3 states and 559 transitions.
[2024-03-12 00:35:37,247 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 384 transitions, 2499 flow
[2024-03-12 00:35:37,265 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 2463 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:35:37,269 INFO  L231             Difference]: Finished difference. Result has 252 places, 351 transitions, 2140 flow
[2024-03-12 00:35:37,269 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=252, PETRI_TRANSITIONS=351}
[2024-03-12 00:35:37,269 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places.
[2024-03-12 00:35:37,269 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 351 transitions, 2140 flow
[2024-03-12 00:35:37,270 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 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:35:37,270 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:37,270 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:35:37,270 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 00:35:37,270 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:37,270 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:37,270 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074967984, now seen corresponding path program 1 times
[2024-03-12 00:35:37,270 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:37,270 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046764292]
[2024-03-12 00:35:37,271 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:37,271 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:37,291 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:37,871 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:35:37,872 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:37,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046764292]
[2024-03-12 00:35:37,872 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046764292] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:35:37,872 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163856106]
[2024-03-12 00:35:37,872 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:37,872 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:35:37,872 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:35:37,876 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:35:37,880 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:35:38,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:38,044 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 00:35:38,057 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:35:38,103 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:35:38,132 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:35:38,132 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:35:38,204 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:35:38,204 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:35:38,562 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:35:38,563 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:35:38,644 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:35:38,675 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:35:38,687 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:35:38,710 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:35:38,710 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:35:38,733 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:35:38,734 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:35:38,775 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:35:38,786 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:35:38,786 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:35:38,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [163856106] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:38,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:35:38,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 19
[2024-03-12 00:35:38,788 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148235137]
[2024-03-12 00:35:38,788 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:38,788 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:35:38,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:38,789 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:35:38,789 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380
[2024-03-12 00:35:39,331 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-12 00:35:39,332 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 351 transitions, 2140 flow. Second operand  has 14 states, 14 states have (on average 145.35714285714286) internal successors, (2035), 14 states have internal predecessors, (2035), 0 states have call successors, (0), 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:35:39,333 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:39,333 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-12 00:35:39,333 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:40,634 INFO  L124   PetriNetUnfolderBase]: 821/3232 cut-off events.
[2024-03-12 00:35:40,634 INFO  L125   PetriNetUnfolderBase]: For 5924/6023 co-relation queries the response was YES.
[2024-03-12 00:35:40,650 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9474 conditions, 3232 events. 821/3232 cut-off events. For 5924/6023 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 26943 event pairs, 127 based on Foata normal form. 16/3067 useless extension candidates. Maximal degree in co-relation 9389. Up to 406 conditions per place. 
[2024-03-12 00:35:40,658 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 272 selfloop transitions, 81 changer transitions 38/550 dead transitions.
[2024-03-12 00:35:40,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 550 transitions, 4722 flow
[2024-03-12 00:35:40,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-12 00:35:40,660 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-12 00:35:40,663 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2853 transitions.
[2024-03-12 00:35:40,663 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7583732057416268
[2024-03-12 00:35:40,664 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2853 transitions.
[2024-03-12 00:35:40,664 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2853 transitions.
[2024-03-12 00:35:40,665 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:40,665 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2853 transitions.
[2024-03-12 00:35:40,669 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 150.1578947368421) internal successors, (2853), 19 states have internal predecessors, (2853), 0 states have call successors, (0), 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:35:40,672 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 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:35:40,673 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 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:35:40,673 INFO  L175             Difference]: Start difference. First operand has 252 places, 351 transitions, 2140 flow. Second operand 19 states and 2853 transitions.
[2024-03-12 00:35:40,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 550 transitions, 4722 flow
[2024-03-12 00:35:40,702 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 550 transitions, 4689 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-03-12 00:35:40,707 INFO  L231             Difference]: Finished difference. Result has 269 places, 402 transitions, 3003 flow
[2024-03-12 00:35:40,708 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3003, PETRI_PLACES=269, PETRI_TRANSITIONS=402}
[2024-03-12 00:35:40,708 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 79 predicate places.
[2024-03-12 00:35:40,708 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 402 transitions, 3003 flow
[2024-03-12 00:35:40,709 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 145.35714285714286) internal successors, (2035), 14 states have internal predecessors, (2035), 0 states have call successors, (0), 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:35:40,709 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:40,709 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:35:40,716 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-03-12 00:35:40,914 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:35:40,914 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:40,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:40,916 INFO  L85        PathProgramCache]: Analyzing trace with hash 439816372, now seen corresponding path program 2 times
[2024-03-12 00:35:40,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:40,917 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151435520]
[2024-03-12 00:35:40,917 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:40,918 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:40,945 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:41,698 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:35:41,698 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:41,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151435520]
[2024-03-12 00:35:41,698 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151435520] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:35:41,698 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497410462]
[2024-03-12 00:35:41,698 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:35:41,699 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:35:41,699 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:35:41,700 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:35:41,708 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:35:41,865 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:35:41,865 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:35:41,868 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:35:41,878 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:35:41,899 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:35:41,972 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:35:41,972 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:35:42,375 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:35:42,376 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:35:42,453 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:42,454 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:35:42,483 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:35:42,553 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:35:42,622 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:35:42,622 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:35:42,831 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:35:42,889 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:42,890 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:35:42,917 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:35:42,917 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:35:42,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:42,997 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:35:43,021 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:43,023 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:35:43,056 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:43,058 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:35:43,097 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:35:43,108 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:35:43,109 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:35:43,109 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497410462] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:43,109 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:35:43,110 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:35:43,110 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014523066]
[2024-03-12 00:35:43,110 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:43,111 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:35:43,111 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:43,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:35:43,112 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:35:44,300 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-12 00:35:44,301 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 402 transitions, 3003 flow. Second operand  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 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:35:44,301 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:44,301 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-12 00:35:44,302 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:46,568 INFO  L124   PetriNetUnfolderBase]: 783/3111 cut-off events.
[2024-03-12 00:35:46,568 INFO  L125   PetriNetUnfolderBase]: For 9085/9196 co-relation queries the response was YES.
[2024-03-12 00:35:46,582 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10367 conditions, 3111 events. 783/3111 cut-off events. For 9085/9196 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 25364 event pairs, 92 based on Foata normal form. 38/3010 useless extension candidates. Maximal degree in co-relation 10264. Up to 580 conditions per place. 
[2024-03-12 00:35:46,589 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 270 selfloop transitions, 137 changer transitions 21/588 dead transitions.
[2024-03-12 00:35:46,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 588 transitions, 5417 flow
[2024-03-12 00:35:46,590 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-12 00:35:46,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-12 00:35:46,594 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3794 transitions.
[2024-03-12 00:35:46,595 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7664646464646465
[2024-03-12 00:35:46,595 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 3794 transitions.
[2024-03-12 00:35:46,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 3794 transitions.
[2024-03-12 00:35:46,597 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:46,597 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3794 transitions.
[2024-03-12 00:35:46,601 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 151.76) internal successors, (3794), 25 states have internal predecessors, (3794), 0 states have call successors, (0), 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:35:46,606 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 198.0) internal successors, (5148), 26 states have internal predecessors, (5148), 0 states have call successors, (0), 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:35:46,606 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 198.0) internal successors, (5148), 26 states have internal predecessors, (5148), 0 states have call successors, (0), 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:35:46,606 INFO  L175             Difference]: Start difference. First operand has 269 places, 402 transitions, 3003 flow. Second operand 25 states and 3794 transitions.
[2024-03-12 00:35:46,607 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 588 transitions, 5417 flow
[2024-03-12 00:35:46,644 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 588 transitions, 5365 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-03-12 00:35:46,649 INFO  L231             Difference]: Finished difference. Result has 288 places, 456 transitions, 3986 flow
[2024-03-12 00:35:46,650 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2959, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=3986, PETRI_PLACES=288, PETRI_TRANSITIONS=456}
[2024-03-12 00:35:46,650 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 98 predicate places.
[2024-03-12 00:35:46,650 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 456 transitions, 3986 flow
[2024-03-12 00:35:46,651 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 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:35:46,651 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:46,651 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:35:46,657 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:35:46,851 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:35:46,852 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:46,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:46,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -588257106, now seen corresponding path program 3 times
[2024-03-12 00:35:46,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:46,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672892828]
[2024-03-12 00:35:46,854 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:46,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:46,878 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:35:47,570 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:35:47,570 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:35:47,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672892828]
[2024-03-12 00:35:47,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672892828] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:35:47,570 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663671663]
[2024-03-12 00:35:47,571 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:35:47,571 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:35:47,571 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:35:47,572 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:35:47,574 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:35:47,738 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:35:47,738 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:35:47,740 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-03-12 00:35:47,747 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:35:47,864 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:35:47,995 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:35:47,996 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:35:49,113 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:35:49,114 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:35:49,119 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:49,121 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:35:49,434 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:49,436 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:35:49,452 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:49,452 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 16 treesize of output 11
[2024-03-12 00:35:49,543 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:35:49,922 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:35:49,930 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:35:49,987 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:35:50,066 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:35:50,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:35:50,217 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:50,218 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:35:50,259 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:50,260 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:35:50,294 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:50,295 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:35:50,343 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:35:50,344 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:35:50,446 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:35:50,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:35:50,504 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:35:50,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663671663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:35:50,504 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:35:50,504 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-12 00:35:50,505 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339108099]
[2024-03-12 00:35:50,505 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:35:50,505 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-12 00:35:50,505 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:35:50,506 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-12 00:35:50,506 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406
[2024-03-12 00:35:53,340 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 198
[2024-03-12 00:35:53,345 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 456 transitions, 3986 flow. Second operand  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 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:35:53,345 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:35:53,346 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 198
[2024-03-12 00:35:53,346 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:35:59,428 INFO  L124   PetriNetUnfolderBase]: 2506/9173 cut-off events.
[2024-03-12 00:35:59,428 INFO  L125   PetriNetUnfolderBase]: For 35994/36041 co-relation queries the response was YES.
[2024-03-12 00:35:59,480 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 32384 conditions, 9173 events. 2506/9173 cut-off events. For 35994/36041 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 94413 event pairs, 498 based on Foata normal form. 43/8741 useless extension candidates. Maximal degree in co-relation 29645. Up to 1913 conditions per place. 
[2024-03-12 00:35:59,503 INFO  L140   encePairwiseOnDemand]: 159/198 looper letters, 883 selfloop transitions, 238 changer transitions 28/1287 dead transitions.
[2024-03-12 00:35:59,504 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1287 transitions, 14874 flow
[2024-03-12 00:35:59,504 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2024-03-12 00:35:59,504 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2024-03-12 00:35:59,508 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5992 transitions.
[2024-03-12 00:35:59,509 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.65788317962231
[2024-03-12 00:35:59,510 INFO  L72            ComplementDD]: Start complementDD. Operand 46 states and 5992 transitions.
[2024-03-12 00:35:59,510 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 5992 transitions.
[2024-03-12 00:35:59,511 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:35:59,511 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5992 transitions.
[2024-03-12 00:35:59,518 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 47 states, 46 states have (on average 130.2608695652174) internal successors, (5992), 46 states have internal predecessors, (5992), 0 states have call successors, (0), 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:35:59,526 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 47 states, 47 states have (on average 198.0) internal successors, (9306), 47 states have internal predecessors, (9306), 0 states have call successors, (0), 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:35:59,527 INFO  L81            ComplementDD]: Finished complementDD. Result  has 47 states, 47 states have (on average 198.0) internal successors, (9306), 47 states have internal predecessors, (9306), 0 states have call successors, (0), 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:35:59,527 INFO  L175             Difference]: Start difference. First operand has 288 places, 456 transitions, 3986 flow. Second operand 46 states and 5992 transitions.
[2024-03-12 00:35:59,527 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1287 transitions, 14874 flow
[2024-03-12 00:35:59,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1287 transitions, 14336 flow, removed 135 selfloop flow, removed 9 redundant places.
[2024-03-12 00:35:59,674 INFO  L231             Difference]: Finished difference. Result has 350 places, 672 transitions, 7438 flow
[2024-03-12 00:35:59,675 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3790, PETRI_DIFFERENCE_MINUEND_PLACES=278, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=7438, PETRI_PLACES=350, PETRI_TRANSITIONS=672}
[2024-03-12 00:35:59,675 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 160 predicate places.
[2024-03-12 00:35:59,675 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 672 transitions, 7438 flow
[2024-03-12 00:35:59,676 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 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:35:59,676 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:35:59,676 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:35:59,681 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:35:59,877 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:35:59,877 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:35:59,878 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:35:59,878 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016450842, now seen corresponding path program 1 times
[2024-03-12 00:35:59,878 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:35:59,879 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712296172]
[2024-03-12 00:35:59,879 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:35:59,879 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:35:59,913 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:00,490 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:36:00,490 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:00,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712296172]
[2024-03-12 00:36:00,491 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712296172] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:00,491 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483675840]
[2024-03-12 00:36:00,491 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:00,491 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:00,491 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:00,492 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:36:00,500 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:36:00,634 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:00,636 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-03-12 00:36:00,642 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:00,751 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:36:00,802 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:36:00,802 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:36:00,942 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:00,950 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:36:00,950 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:36:01,566 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:36:01,567 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:36:01,577 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:36:01,645 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:01,646 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:36:01,655 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:01,655 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 16 treesize of output 11
[2024-03-12 00:36:01,806 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:36:01,809 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 7 treesize of output 3
[2024-03-12 00:36:01,867 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:36:01,911 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:36:01,958 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:36:02,012 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:36:02,071 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:36:02,116 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:36:02,116 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:36:02,158 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 00:36:02,187 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)))))) is different from false
[2024-03-12 00:36:02,213 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 00:36:02,344 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:36:08,450 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_726) c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-03-12 00:36:08,842 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 163 treesize of output 119
[2024-03-12 00:36:08,851 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:36:08,854 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:36:08,901 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:36:09,087 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:36:09,087 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [483675840] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:36:09,087 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:36:09,087 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 45
[2024-03-12 00:36:09,087 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872424319]
[2024-03-12 00:36:09,087 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:36:09,088 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-03-12 00:36:09,088 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:09,089 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-03-12 00:36:09,089 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=1456, Unknown=12, NotChecked=410, Total=2070
[2024-03-12 00:36:09,439 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 198
[2024-03-12 00:36:09,443 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 672 transitions, 7438 flow. Second operand  has 46 states, 46 states have (on average 108.91304347826087) internal successors, (5010), 46 states have internal predecessors, (5010), 0 states have call successors, (0), 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:36:09,444 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:09,444 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 198
[2024-03-12 00:36:09,444 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:15,057 INFO  L124   PetriNetUnfolderBase]: 2542/9856 cut-off events.
[2024-03-12 00:36:15,058 INFO  L125   PetriNetUnfolderBase]: For 57280/57294 co-relation queries the response was YES.
[2024-03-12 00:36:15,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38855 conditions, 9856 events. 2542/9856 cut-off events. For 57280/57294 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 104840 event pairs, 283 based on Foata normal form. 64/9561 useless extension candidates. Maximal degree in co-relation 38269. Up to 1337 conditions per place. 
[2024-03-12 00:36:15,150 INFO  L140   encePairwiseOnDemand]: 167/198 looper letters, 425 selfloop transitions, 121 changer transitions 199/917 dead transitions.
[2024-03-12 00:36:15,150 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 917 transitions, 12103 flow
[2024-03-12 00:36:15,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-03-12 00:36:15,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-03-12 00:36:15,152 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3182 transitions.
[2024-03-12 00:36:15,153 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.573953823953824
[2024-03-12 00:36:15,154 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 3182 transitions.
[2024-03-12 00:36:15,154 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 3182 transitions.
[2024-03-12 00:36:15,154 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:15,154 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3182 transitions.
[2024-03-12 00:36:15,157 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 113.64285714285714) internal successors, (3182), 28 states have internal predecessors, (3182), 0 states have call successors, (0), 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:36:15,161 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 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:36:15,161 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 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:36:15,161 INFO  L175             Difference]: Start difference. First operand has 350 places, 672 transitions, 7438 flow. Second operand 28 states and 3182 transitions.
[2024-03-12 00:36:15,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 917 transitions, 12103 flow
[2024-03-12 00:36:15,458 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 917 transitions, 11836 flow, removed 112 selfloop flow, removed 11 redundant places.
[2024-03-12 00:36:15,467 INFO  L231             Difference]: Finished difference. Result has 364 places, 563 transitions, 5624 flow
[2024-03-12 00:36:15,467 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7209, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5624, PETRI_PLACES=364, PETRI_TRANSITIONS=563}
[2024-03-12 00:36:15,467 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 174 predicate places.
[2024-03-12 00:36:15,468 INFO  L495      AbstractCegarLoop]: Abstraction has has 364 places, 563 transitions, 5624 flow
[2024-03-12 00:36:15,468 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 108.91304347826087) internal successors, (5010), 46 states have internal predecessors, (5010), 0 states have call successors, (0), 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:36:15,468 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:15,469 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:36:15,476 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:36:15,669 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:36:15,669 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:15,670 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:15,670 INFO  L85        PathProgramCache]: Analyzing trace with hash -890347538, now seen corresponding path program 4 times
[2024-03-12 00:36:15,670 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:15,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785840764]
[2024-03-12 00:36:15,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:15,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:15,702 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:16,422 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:36:16,423 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:16,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785840764]
[2024-03-12 00:36:16,423 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785840764] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:16,423 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641497679]
[2024-03-12 00:36:16,424 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:36:16,424 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:16,424 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:16,425 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:36:16,426 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:36:16,599 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:36:16,600 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:36:16,602 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-03-12 00:36:16,609 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:16,650 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:36:16,754 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:36:16,755 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:36:17,759 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:36:17,759 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:36:17,769 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:17,769 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:36:18,080 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,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:36:18,095 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,096 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 16 treesize of output 11
[2024-03-12 00:36:18,413 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:36:18,505 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:36:18,608 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:36:18,621 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:36:18,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,729 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 23 treesize of output 16
[2024-03-12 00:36:18,773 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:36:18,868 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,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 30 treesize of output 21
[2024-03-12 00:36:18,898 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,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 30 treesize of output 21
[2024-03-12 00:36:18,937 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:18,938 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:36:19,014 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:36:19,150 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:36:19,230 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:36:19,230 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:36:19,230 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641497679] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:19,230 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:36:19,230 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33
[2024-03-12 00:36:19,230 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678349944]
[2024-03-12 00:36:19,231 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:19,231 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-12 00:36:19,231 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:19,232 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-12 00:36:19,232 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122
[2024-03-12 00:36:22,353 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 133 out of 198
[2024-03-12 00:36:22,355 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 563 transitions, 5624 flow. Second operand  has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 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:36:22,355 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:22,355 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 198
[2024-03-12 00:36:22,355 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:28,166 INFO  L124   PetriNetUnfolderBase]: 2880/11080 cut-off events.
[2024-03-12 00:36:28,166 INFO  L125   PetriNetUnfolderBase]: For 68211/68352 co-relation queries the response was YES.
[2024-03-12 00:36:28,246 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 43718 conditions, 11080 events. 2880/11080 cut-off events. For 68211/68352 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 121002 event pairs, 662 based on Foata normal form. 42/10689 useless extension candidates. Maximal degree in co-relation 43366. Up to 1998 conditions per place. 
[2024-03-12 00:36:28,266 INFO  L140   encePairwiseOnDemand]: 167/198 looper letters, 664 selfloop transitions, 168 changer transitions 176/1156 dead transitions.
[2024-03-12 00:36:28,266 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 1156 transitions, 14702 flow
[2024-03-12 00:36:28,267 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-03-12 00:36:28,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-03-12 00:36:28,269 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4052 transitions.
[2024-03-12 00:36:28,270 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7308802308802309
[2024-03-12 00:36:28,270 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 4052 transitions.
[2024-03-12 00:36:28,270 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 4052 transitions.
[2024-03-12 00:36:28,271 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:28,271 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 4052 transitions.
[2024-03-12 00:36:28,275 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 144.71428571428572) internal successors, (4052), 28 states have internal predecessors, (4052), 0 states have call successors, (0), 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:36:28,278 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 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:36:28,279 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 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:36:28,279 INFO  L175             Difference]: Start difference. First operand has 364 places, 563 transitions, 5624 flow. Second operand 28 states and 4052 transitions.
[2024-03-12 00:36:28,279 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 1156 transitions, 14702 flow
[2024-03-12 00:36:28,592 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 1156 transitions, 13946 flow, removed 129 selfloop flow, removed 22 redundant places.
[2024-03-12 00:36:28,602 INFO  L231             Difference]: Finished difference. Result has 377 places, 607 transitions, 6734 flow
[2024-03-12 00:36:28,603 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5322, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=122, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=410, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=6734, PETRI_PLACES=377, PETRI_TRANSITIONS=607}
[2024-03-12 00:36:28,603 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 187 predicate places.
[2024-03-12 00:36:28,603 INFO  L495      AbstractCegarLoop]: Abstraction has has 377 places, 607 transitions, 6734 flow
[2024-03-12 00:36:28,604 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 134.9) internal successors, (2698), 20 states have internal predecessors, (2698), 0 states have call successors, (0), 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:36:28,604 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:28,604 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:36:28,612 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:36:28,804 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:36:28,805 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:28,806 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:28,806 INFO  L85        PathProgramCache]: Analyzing trace with hash -1807922986, now seen corresponding path program 5 times
[2024-03-12 00:36:28,806 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:28,806 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302136355]
[2024-03-12 00:36:28,806 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:28,807 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:28,828 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:29,686 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:36:29,687 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:29,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302136355]
[2024-03-12 00:36:29,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302136355] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:29,687 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185657945]
[2024-03-12 00:36:29,687 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 00:36:29,687 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:29,687 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:29,689 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:36:29,691 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:36:29,869 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:36:29,869 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:36:29,871 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:36:29,878 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:29,905 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:36:29,985 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:36:29,986 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:36:30,394 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:36:30,395 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:36:30,455 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:30,456 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:36:30,533 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:36:30,591 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:36:30,681 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:36:30,748 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:36:30,749 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:36:30,816 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:30,817 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:36:30,846 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:36:30,847 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:36:30,931 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:30,931 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:36:30,996 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:30,997 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:36:31,023 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:31,024 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:36:31,103 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:36:31,115 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:36:31,115 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:36:31,115 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [185657945] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:31,115 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:36:31,115 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:36:31,116 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848482154]
[2024-03-12 00:36:31,116 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:31,116 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:36:31,116 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:31,117 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:36:31,117 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=604, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:36:32,775 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-12 00:36:32,777 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 377 places, 607 transitions, 6734 flow. Second operand  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 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:36:32,777 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:32,777 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-12 00:36:32,778 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:36,401 INFO  L124   PetriNetUnfolderBase]: 2072/8862 cut-off events.
[2024-03-12 00:36:36,401 INFO  L125   PetriNetUnfolderBase]: For 63074/63195 co-relation queries the response was YES.
[2024-03-12 00:36:36,473 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35488 conditions, 8862 events. 2072/8862 cut-off events. For 63074/63195 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 95435 event pairs, 414 based on Foata normal form. 77/8563 useless extension candidates. Maximal degree in co-relation 34882. Up to 1443 conditions per place. 
[2024-03-12 00:36:36,491 INFO  L140   encePairwiseOnDemand]: 178/198 looper letters, 201 selfloop transitions, 120 changer transitions 254/763 dead transitions.
[2024-03-12 00:36:36,491 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 763 transitions, 9580 flow
[2024-03-12 00:36:36,492 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-12 00:36:36,492 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-12 00:36:36,493 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3331 transitions.
[2024-03-12 00:36:36,494 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7646923783287419
[2024-03-12 00:36:36,494 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 3331 transitions.
[2024-03-12 00:36:36,494 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 3331 transitions.
[2024-03-12 00:36:36,495 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:36,495 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 3331 transitions.
[2024-03-12 00:36:36,498 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 151.4090909090909) internal successors, (3331), 22 states have internal predecessors, (3331), 0 states have call successors, (0), 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:36:36,501 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 198.0) internal successors, (4554), 23 states have internal predecessors, (4554), 0 states have call successors, (0), 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:36:36,502 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 198.0) internal successors, (4554), 23 states have internal predecessors, (4554), 0 states have call successors, (0), 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:36:36,502 INFO  L175             Difference]: Start difference. First operand has 377 places, 607 transitions, 6734 flow. Second operand 22 states and 3331 transitions.
[2024-03-12 00:36:36,502 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 763 transitions, 9580 flow
[2024-03-12 00:36:36,811 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 763 transitions, 9343 flow, removed 41 selfloop flow, removed 20 redundant places.
[2024-03-12 00:36:36,824 INFO  L231             Difference]: Finished difference. Result has 382 places, 454 transitions, 4091 flow
[2024-03-12 00:36:36,824 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=6505, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=120, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=4091, PETRI_PLACES=382, PETRI_TRANSITIONS=454}
[2024-03-12 00:36:36,825 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 192 predicate places.
[2024-03-12 00:36:36,825 INFO  L495      AbstractCegarLoop]: Abstraction has has 382 places, 454 transitions, 4091 flow
[2024-03-12 00:36:36,826 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 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:36:36,826 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:36,826 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:36:36,834 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:36:37,026 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:36:37,027 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:37,028 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:37,028 INFO  L85        PathProgramCache]: Analyzing trace with hash -77549447, now seen corresponding path program 1 times
[2024-03-12 00:36:37,028 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:37,028 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626047717]
[2024-03-12 00:36:37,028 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:37,029 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:37,055 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:37,885 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:36:37,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:37,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626047717]
[2024-03-12 00:36:37,885 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626047717] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:37,885 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635774619]
[2024-03-12 00:36:37,885 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:37,885 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:37,886 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:37,887 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:36:37,888 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:36:38,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:38,037 INFO  L262         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-12 00:36:38,044 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:38,053 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:36:38,074 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:36:38,075 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:36:38,154 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,162 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:36:38,163 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:36:38,486 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:36:38,487 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:36:38,578 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,579 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:36:38,599 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:36:38,644 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:36:38,700 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:36:38,750 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:36:38,750 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:36:38,831 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:36:38,831 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:36:38,912 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,913 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:36:38,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,943 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:36:38,967 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,968 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:36:38,988 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:36:38,989 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:36:39,039 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:36:39,054 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:36:39,054 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:36:39,054 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [635774619] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:39,054 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:36:39,054 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-03-12 00:36:39,055 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458137260]
[2024-03-12 00:36:39,055 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:39,055 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:36:39,056 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:39,056 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:36:39,056 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650
[2024-03-12 00:36:40,668 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-12 00:36:40,669 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 454 transitions, 4091 flow. Second operand  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 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:36:40,669 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:40,669 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-12 00:36:40,669 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:42,910 INFO  L124   PetriNetUnfolderBase]: 1330/6100 cut-off events.
[2024-03-12 00:36:42,911 INFO  L125   PetriNetUnfolderBase]: For 28807/28876 co-relation queries the response was YES.
[2024-03-12 00:36:42,960 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20793 conditions, 6100 events. 1330/6100 cut-off events. For 28807/28876 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 60044 event pairs, 241 based on Foata normal form. 42/5873 useless extension candidates. Maximal degree in co-relation 20683. Up to 619 conditions per place. 
[2024-03-12 00:36:42,970 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 160 selfloop transitions, 100 changer transitions 98/543 dead transitions.
[2024-03-12 00:36:42,971 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 543 transitions, 5707 flow
[2024-03-12 00:36:42,971 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-12 00:36:42,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-12 00:36:42,973 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2842 transitions.
[2024-03-12 00:36:42,974 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7554492291334397
[2024-03-12 00:36:42,974 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2842 transitions.
[2024-03-12 00:36:42,974 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2842 transitions.
[2024-03-12 00:36:42,974 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:42,974 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2842 transitions.
[2024-03-12 00:36:42,977 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 149.57894736842104) internal successors, (2842), 19 states have internal predecessors, (2842), 0 states have call successors, (0), 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:36:42,979 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 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:36:42,979 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 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:36:42,980 INFO  L175             Difference]: Start difference. First operand has 382 places, 454 transitions, 4091 flow. Second operand 19 states and 2842 transitions.
[2024-03-12 00:36:42,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 543 transitions, 5707 flow
[2024-03-12 00:36:43,128 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 543 transitions, 4815 flow, removed 286 selfloop flow, removed 40 redundant places.
[2024-03-12 00:36:43,133 INFO  L231             Difference]: Finished difference. Result has 342 places, 412 transitions, 3278 flow
[2024-03-12 00:36:43,134 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3278, PETRI_PLACES=342, PETRI_TRANSITIONS=412}
[2024-03-12 00:36:43,134 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 152 predicate places.
[2024-03-12 00:36:43,134 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 412 transitions, 3278 flow
[2024-03-12 00:36:43,134 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 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:36:43,134 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:43,135 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:43,142 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:36:43,335 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:36:43,340 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:43,340 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:43,340 INFO  L85        PathProgramCache]: Analyzing trace with hash 2039653700, now seen corresponding path program 1 times
[2024-03-12 00:36:43,340 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:43,341 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115935933]
[2024-03-12 00:36:43,341 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:43,341 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:43,360 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:43,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:36:43,405 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:43,405 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115935933]
[2024-03-12 00:36:43,405 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115935933] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:43,405 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:43,405 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-12 00:36:43,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957986030]
[2024-03-12 00:36:43,406 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:43,406 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:36:43,406 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:43,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:36:43,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:36:43,421 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198
[2024-03-12 00:36:43,422 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 412 transitions, 3278 flow. Second operand  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 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:36:43,422 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:43,422 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198
[2024-03-12 00:36:43,422 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:43,843 INFO  L124   PetriNetUnfolderBase]: 563/3199 cut-off events.
[2024-03-12 00:36:43,843 INFO  L125   PetriNetUnfolderBase]: For 12116/12191 co-relation queries the response was YES.
[2024-03-12 00:36:43,863 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10030 conditions, 3199 events. 563/3199 cut-off events. For 12116/12191 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 27311 event pairs, 41 based on Foata normal form. 12/3123 useless extension candidates. Maximal degree in co-relation 9957. Up to 403 conditions per place. 
[2024-03-12 00:36:43,867 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 3 selfloop transitions, 4 changer transitions 0/387 dead transitions.
[2024-03-12 00:36:43,868 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 387 transitions, 3158 flow
[2024-03-12 00:36:43,868 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:36:43,868 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:36:43,869 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions.
[2024-03-12 00:36:43,869 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9579124579124579
[2024-03-12 00:36:43,869 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 569 transitions.
[2024-03-12 00:36:43,869 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions.
[2024-03-12 00:36:43,869 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:43,869 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions.
[2024-03-12 00:36:43,870 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 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:36:43,870 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:36:43,871 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:36:43,871 INFO  L175             Difference]: Start difference. First operand has 342 places, 412 transitions, 3278 flow. Second operand 3 states and 569 transitions.
[2024-03-12 00:36:43,871 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 387 transitions, 3158 flow
[2024-03-12 00:36:43,925 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 387 transitions, 2816 flow, removed 41 selfloop flow, removed 33 redundant places.
[2024-03-12 00:36:43,929 INFO  L231             Difference]: Finished difference. Result has 301 places, 387 transitions, 2810 flow
[2024-03-12 00:36:43,929 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2802, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2810, PETRI_PLACES=301, PETRI_TRANSITIONS=387}
[2024-03-12 00:36:43,929 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 111 predicate places.
[2024-03-12 00:36:43,929 INFO  L495      AbstractCegarLoop]: Abstraction has has 301 places, 387 transitions, 2810 flow
[2024-03-12 00:36:43,930 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 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:36:43,930 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:43,930 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:36:43,930 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-12 00:36:43,930 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:43,930 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:43,930 INFO  L85        PathProgramCache]: Analyzing trace with hash -719164071, now seen corresponding path program 1 times
[2024-03-12 00:36:43,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:43,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282567064]
[2024-03-12 00:36:43,931 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:43,931 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:43,952 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:44,024 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:36:44,024 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:44,024 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282567064]
[2024-03-12 00:36:44,025 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282567064] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:44,025 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432301606]
[2024-03-12 00:36:44,025 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:44,025 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:44,025 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:44,026 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:36:44,027 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:36:44,181 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:44,182 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-12 00:36:44,184 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:44,279 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:36:44,279 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:36:44,382 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:36:44,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [432301606] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:36:44,383 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:36:44,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-12 00:36:44,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503809187]
[2024-03-12 00:36:44,383 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:36:44,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-12 00:36:44,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:44,385 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-12 00:36:44,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-12 00:36:44,548 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 198
[2024-03-12 00:36:44,549 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 387 transitions, 2810 flow. Second operand  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 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:36:44,549 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:44,549 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 198
[2024-03-12 00:36:44,550 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:44,902 INFO  L124   PetriNetUnfolderBase]: 393/2120 cut-off events.
[2024-03-12 00:36:44,902 INFO  L125   PetriNetUnfolderBase]: For 5251/5321 co-relation queries the response was YES.
[2024-03-12 00:36:44,914 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5892 conditions, 2120 events. 393/2120 cut-off events. For 5251/5321 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 15500 event pairs, 31 based on Foata normal form. 15/2075 useless extension candidates. Maximal degree in co-relation 5795. Up to 205 conditions per place. 
[2024-03-12 00:36:44,918 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 16 selfloop transitions, 14 changer transitions 2/306 dead transitions.
[2024-03-12 00:36:44,919 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 306 transitions, 2144 flow
[2024-03-12 00:36:44,919 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-12 00:36:44,919 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-12 00:36:44,920 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions.
[2024-03-12 00:36:44,920 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9011544011544012
[2024-03-12 00:36:44,920 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions.
[2024-03-12 00:36:44,920 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions.
[2024-03-12 00:36:44,921 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:44,921 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions.
[2024-03-12 00:36:44,922 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 178.42857142857142) internal successors, (1249), 7 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:36:44,923 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 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:36:44,923 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 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:36:44,923 INFO  L175             Difference]: Start difference. First operand has 301 places, 387 transitions, 2810 flow. Second operand 7 states and 1249 transitions.
[2024-03-12 00:36:44,923 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 306 transitions, 2144 flow
[2024-03-12 00:36:44,945 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 306 transitions, 1946 flow, removed 10 selfloop flow, removed 14 redundant places.
[2024-03-12 00:36:44,948 INFO  L231             Difference]: Finished difference. Result has 266 places, 298 transitions, 1890 flow
[2024-03-12 00:36:44,948 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1890, PETRI_PLACES=266, PETRI_TRANSITIONS=298}
[2024-03-12 00:36:44,949 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 76 predicate places.
[2024-03-12 00:36:44,949 INFO  L495      AbstractCegarLoop]: Abstraction has has 266 places, 298 transitions, 1890 flow
[2024-03-12 00:36:44,949 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 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:36:44,949 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:44,949 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, 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]
[2024-03-12 00:36:44,957 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:36:45,150 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,SelfDestructingSolverStorable23
[2024-03-12 00:36:45,154 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:45,155 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:45,155 INFO  L85        PathProgramCache]: Analyzing trace with hash -366618917, now seen corresponding path program 1 times
[2024-03-12 00:36:45,155 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:45,155 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51940642]
[2024-03-12 00:36:45,156 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:45,156 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:45,177 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:45,270 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-03-12 00:36:45,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:45,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51940642]
[2024-03-12 00:36:45,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51940642] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:45,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235560904]
[2024-03-12 00:36:45,270 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:45,271 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:45,271 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:45,272 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:36:45,274 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:36:45,441 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:45,443 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-03-12 00:36:45,444 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:45,619 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:36:45,619 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:36:45,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [235560904] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:45,619 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:36:45,620 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-03-12 00:36:45,620 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770404603]
[2024-03-12 00:36:45,620 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:45,620 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-12 00:36:45,620 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:45,621 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-12 00:36:45,621 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:36:45,736 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198
[2024-03-12 00:36:45,736 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 298 transitions, 1890 flow. Second operand  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 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:36:45,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:45,737 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198
[2024-03-12 00:36:45,737 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:46,105 INFO  L124   PetriNetUnfolderBase]: 357/2050 cut-off events.
[2024-03-12 00:36:46,105 INFO  L125   PetriNetUnfolderBase]: For 3862/3902 co-relation queries the response was YES.
[2024-03-12 00:36:46,116 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5259 conditions, 2050 events. 357/2050 cut-off events. For 3862/3902 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 14839 event pairs, 25 based on Foata normal form. 21/2021 useless extension candidates. Maximal degree in co-relation 5091. Up to 187 conditions per place. 
[2024-03-12 00:36:46,119 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 32 selfloop transitions, 16 changer transitions 0/321 dead transitions.
[2024-03-12 00:36:46,120 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 321 transitions, 2051 flow
[2024-03-12 00:36:46,120 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:36:46,120 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:36:46,121 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1940 transitions.
[2024-03-12 00:36:46,121 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8907254361799817
[2024-03-12 00:36:46,122 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1940 transitions.
[2024-03-12 00:36:46,122 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1940 transitions.
[2024-03-12 00:36:46,122 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:46,122 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1940 transitions.
[2024-03-12 00:36:46,124 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 176.36363636363637) internal successors, (1940), 11 states have internal predecessors, (1940), 0 states have call successors, (0), 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:36:46,125 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 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:36:46,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 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:36:46,126 INFO  L175             Difference]: Start difference. First operand has 266 places, 298 transitions, 1890 flow. Second operand 11 states and 1940 transitions.
[2024-03-12 00:36:46,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 321 transitions, 2051 flow
[2024-03-12 00:36:46,144 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 321 transitions, 2041 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:36:46,147 INFO  L231             Difference]: Finished difference. Result has 278 places, 308 transitions, 1972 flow
[2024-03-12 00:36:46,147 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1972, PETRI_PLACES=278, PETRI_TRANSITIONS=308}
[2024-03-12 00:36:46,147 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 88 predicate places.
[2024-03-12 00:36:46,147 INFO  L495      AbstractCegarLoop]: Abstraction has has 278 places, 308 transitions, 1972 flow
[2024-03-12 00:36:46,148 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 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:36:46,148 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:46,148 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, 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]
[2024-03-12 00:36:46,155 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0
[2024-03-12 00:36:46,349 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:46,350 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:46,350 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:46,351 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272306485, now seen corresponding path program 1 times
[2024-03-12 00:36:46,351 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:46,351 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549533432]
[2024-03-12 00:36:46,351 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:46,352 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:46,371 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:46,471 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:36:46,471 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:46,471 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549533432]
[2024-03-12 00:36:46,472 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549533432] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:36:46,472 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899474200]
[2024-03-12 00:36:46,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:46,472 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:36:46,472 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:36:46,473 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:36:46,475 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:36:46,623 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:46,624 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-12 00:36:46,627 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:36:46,803 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:36:46,804 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:36:47,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:36:47,056 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899474200] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:36:47,056 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:36:47,056 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-03-12 00:36:47,056 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422595391]
[2024-03-12 00:36:47,056 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:36:47,057 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-12 00:36:47,057 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:47,057 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-12 00:36:47,058 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-03-12 00:36:47,279 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198
[2024-03-12 00:36:47,280 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 278 places, 308 transitions, 1972 flow. Second operand  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 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:36:47,280 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:47,280 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198
[2024-03-12 00:36:47,280 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:47,725 INFO  L124   PetriNetUnfolderBase]: 422/2384 cut-off events.
[2024-03-12 00:36:47,725 INFO  L125   PetriNetUnfolderBase]: For 4943/4999 co-relation queries the response was YES.
[2024-03-12 00:36:47,739 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6473 conditions, 2384 events. 422/2384 cut-off events. For 4943/4999 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18305 event pairs, 30 based on Foata normal form. 19/2341 useless extension candidates. Maximal degree in co-relation 6294. Up to 240 conditions per place. 
[2024-03-12 00:36:47,743 INFO  L140   encePairwiseOnDemand]: 188/198 looper letters, 36 selfloop transitions, 15 changer transitions 0/329 dead transitions.
[2024-03-12 00:36:47,743 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 329 transitions, 2161 flow
[2024-03-12 00:36:47,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:36:47,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:36:47,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1783 transitions.
[2024-03-12 00:36:47,746 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9005050505050505
[2024-03-12 00:36:47,746 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1783 transitions.
[2024-03-12 00:36:47,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1783 transitions.
[2024-03-12 00:36:47,746 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:47,746 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1783 transitions.
[2024-03-12 00:36:47,747 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 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:36:47,749 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 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:36:47,749 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 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:36:47,749 INFO  L175             Difference]: Start difference. First operand has 278 places, 308 transitions, 1972 flow. Second operand 10 states and 1783 transitions.
[2024-03-12 00:36:47,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 329 transitions, 2161 flow
[2024-03-12 00:36:47,770 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 329 transitions, 2147 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-03-12 00:36:47,773 INFO  L231             Difference]: Finished difference. Result has 289 places, 318 transitions, 2069 flow
[2024-03-12 00:36:47,774 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1962, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2069, PETRI_PLACES=289, PETRI_TRANSITIONS=318}
[2024-03-12 00:36:47,774 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 99 predicate places.
[2024-03-12 00:36:47,774 INFO  L495      AbstractCegarLoop]: Abstraction has has 289 places, 318 transitions, 2069 flow
[2024-03-12 00:36:47,774 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 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:36:47,774 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:47,774 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, 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, 1, 1]
[2024-03-12 00:36:47,781 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-03-12 00:36:47,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-03-12 00:36:47,976 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-03-12 00:36:47,976 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:47,976 INFO  L85        PathProgramCache]: Analyzing trace with hash 902056160, now seen corresponding path program 1 times
[2024-03-12 00:36:47,977 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:47,977 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555642905]
[2024-03-12 00:36:47,977 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:47,977 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:48,020 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:36:48,020 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 00:36:48,037 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:36:48,068 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 00:36:48,068 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 00:36:48,069 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-12 00:36:48,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-12 00:36:48,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-12 00:36:48,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-12 00:36:48,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-12 00:36:48,070 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-12 00:36:48,071 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-12 00:36:48,072 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-12 00:36:48,072 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-12 00:36:48,072 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 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:36:48,073 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 00:36:48,073 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 00:36:48,094 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 00:36:48,096 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:36:48,141 INFO  L124   PetriNetUnfolderBase]: 27/482 cut-off events.
[2024-03-12 00:36:48,142 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 00:36:48,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 27/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1193 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. 
[2024-03-12 00:36:48,144 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow
[2024-03-12 00:36:48,146 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow
[2024-03-12 00:36:48,146 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:36:48,147 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;@42959f87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:36:48,147 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-12 00:36:48,149 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:36:48,149 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-12 00:36:48,149 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:36:48,149 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:48,149 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]
[2024-03-12 00:36:48,149 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:48,149 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:48,150 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685596353, now seen corresponding path program 1 times
[2024-03-12 00:36:48,150 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:48,150 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462720524]
[2024-03-12 00:36:48,150 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:48,150 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:48,156 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:48,166 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:36:48,167 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:48,167 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462720524]
[2024-03-12 00:36:48,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462720524] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:48,167 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:48,167 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:36:48,167 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700811377]
[2024-03-12 00:36:48,167 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:48,167 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:36:48,167 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:48,168 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:36:48,168 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:36:48,188 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:36:48,189 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 249 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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:36:48,189 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:48,189 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:36:48,189 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:48,446 INFO  L124   PetriNetUnfolderBase]: 237/2093 cut-off events.
[2024-03-12 00:36:48,446 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-03-12 00:36:48,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2093 events. 237/2093 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14919 event pairs, 132 based on Foata normal form. 41/1821 useless extension candidates. Maximal degree in co-relation 1763. Up to 258 conditions per place. 
[2024-03-12 00:36:48,460 INFO  L140   encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions.
[2024-03-12 00:36:48,460 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow
[2024-03-12 00:36:48,461 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:36:48,461 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:36:48,461 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions.
[2024-03-12 00:36:48,462 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-12 00:36:48,462 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 699 transitions.
[2024-03-12 00:36:48,462 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions.
[2024-03-12 00:36:48,462 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:48,462 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions.
[2024-03-12 00:36:48,463 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 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:36:48,463 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:48,463 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:48,464 INFO  L175             Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions.
[2024-03-12 00:36:48,464 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow
[2024-03-12 00:36:48,465 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:36:48,466 INFO  L231             Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow
[2024-03-12 00:36:48,467 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=240, PETRI_TRANSITIONS=242}
[2024-03-12 00:36:48,467 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:36:48,467 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow
[2024-03-12 00:36:48,467 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 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:36:48,467 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:48,467 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]
[2024-03-12 00:36:48,468 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-12 00:36:48,468 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:48,468 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:48,468 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081762899, now seen corresponding path program 1 times
[2024-03-12 00:36:48,468 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:48,468 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904258347]
[2024-03-12 00:36:48,468 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:48,468 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:48,477 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:48,488 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:36:48,488 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:48,489 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904258347]
[2024-03-12 00:36:48,489 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904258347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:48,489 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:48,489 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:36:48,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268437328]
[2024-03-12 00:36:48,489 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:48,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:36:48,490 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:48,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:36:48,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:36:48,520 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249
[2024-03-12 00:36:48,521 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 242 transitions, 504 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:36:48,521 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:48,521 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249
[2024-03-12 00:36:48,521 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:49,153 INFO  L124   PetriNetUnfolderBase]: 1364/6164 cut-off events.
[2024-03-12 00:36:49,154 INFO  L125   PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES.
[2024-03-12 00:36:49,176 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 6164 events. 1364/6164 cut-off events. For 119/131 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 59059 event pairs, 374 based on Foata normal form. 1/5216 useless extension candidates. Maximal degree in co-relation 7766. Up to 850 conditions per place. 
[2024-03-12 00:36:49,191 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions.
[2024-03-12 00:36:49,191 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow
[2024-03-12 00:36:49,192 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:36:49,192 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:36:49,192 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2024-03-12 00:36:49,193 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9491298527443106
[2024-03-12 00:36:49,193 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 709 transitions.
[2024-03-12 00:36:49,193 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions.
[2024-03-12 00:36:49,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:49,193 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions.
[2024-03-12 00:36:49,194 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 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:36:49,194 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:49,194 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:49,195 INFO  L175             Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions.
[2024-03-12 00:36:49,195 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow
[2024-03-12 00:36:49,196 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:36:49,198 INFO  L231             Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow
[2024-03-12 00:36:49,198 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=240, PETRI_TRANSITIONS=253}
[2024-03-12 00:36:49,198 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-12 00:36:49,198 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow
[2024-03-12 00:36:49,199 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:36:49,199 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:49,199 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:36:49,199 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-12 00:36:49,199 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:49,199 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:49,199 INFO  L85        PathProgramCache]: Analyzing trace with hash -623349496, now seen corresponding path program 1 times
[2024-03-12 00:36:49,199 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:49,199 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402108097]
[2024-03-12 00:36:49,199 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:49,200 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:49,211 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:49,249 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:36:49,249 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:49,249 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402108097]
[2024-03-12 00:36:49,249 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402108097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:49,249 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:49,250 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:36:49,250 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696142768]
[2024-03-12 00:36:49,250 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:49,250 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:36:49,251 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:49,251 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:36:49,251 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:36:49,320 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:36:49,321 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 253 transitions, 596 flow. Second operand  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 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:36:49,321 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:49,321 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:36:49,321 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:49,870 INFO  L124   PetriNetUnfolderBase]: 864/5441 cut-off events.
[2024-03-12 00:36:49,870 INFO  L125   PetriNetUnfolderBase]: For 273/281 co-relation queries the response was YES.
[2024-03-12 00:36:49,891 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 5441 events. 864/5441 cut-off events. For 273/281 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 53225 event pairs, 269 based on Foata normal form. 1/4677 useless extension candidates. Maximal degree in co-relation 3901. Up to 569 conditions per place. 
[2024-03-12 00:36:49,903 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions.
[2024-03-12 00:36:49,903 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow
[2024-03-12 00:36:49,904 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:36:49,904 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:36:49,904 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions.
[2024-03-12 00:36:49,905 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210174029451138
[2024-03-12 00:36:49,905 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions.
[2024-03-12 00:36:49,905 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions.
[2024-03-12 00:36:49,905 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:49,905 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions.
[2024-03-12 00:36:49,906 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 0 states have call successors, (0), 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:36:49,907 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:36:49,907 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:36:49,907 INFO  L175             Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions.
[2024-03-12 00:36:49,907 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow
[2024-03-12 00:36:49,910 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:36:49,912 INFO  L231             Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow
[2024-03-12 00:36:49,912 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=247, PETRI_TRANSITIONS=258}
[2024-03-12 00:36:49,912 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places.
[2024-03-12 00:36:49,912 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow
[2024-03-12 00:36:49,913 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 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:36:49,913 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:49,913 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:36:49,913 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-12 00:36:49,913 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:49,913 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:49,914 INFO  L85        PathProgramCache]: Analyzing trace with hash 993495992, now seen corresponding path program 1 times
[2024-03-12 00:36:49,914 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:49,914 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572918244]
[2024-03-12 00:36:49,914 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:49,914 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:49,925 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:50,049 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:36:50,049 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:50,049 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572918244]
[2024-03-12 00:36:50,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572918244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:50,049 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:50,049 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:36:50,049 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009040744]
[2024-03-12 00:36:50,050 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:50,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:36:50,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:50,050 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:36:50,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:36:50,237 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249
[2024-03-12 00:36:50,238 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 620 flow. Second operand  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 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:36:50,238 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:50,238 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249
[2024-03-12 00:36:50,238 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:53,099 INFO  L124   PetriNetUnfolderBase]: 6503/26023 cut-off events.
[2024-03-12 00:36:53,099 INFO  L125   PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES.
[2024-03-12 00:36:53,177 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36352 conditions, 26023 events. 6503/26023 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 323912 event pairs, 1207 based on Foata normal form. 0/22666 useless extension candidates. Maximal degree in co-relation 36195. Up to 5287 conditions per place. 
[2024-03-12 00:36:53,247 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions.
[2024-03-12 00:36:53,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:36:53,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:36:53,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:36:53,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions.
[2024-03-12 00:36:53,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9042838018741634
[2024-03-12 00:36:53,250 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions.
[2024-03-12 00:36:53,250 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions.
[2024-03-12 00:36:53,250 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:53,250 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions.
[2024-03-12 00:36:53,252 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 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:36:53,253 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:36:53,253 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:36:53,253 INFO  L175             Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions.
[2024-03-12 00:36:53,253 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow
[2024-03-12 00:36:53,256 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:36:53,258 INFO  L231             Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow
[2024-03-12 00:36:53,259 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=960, PETRI_PLACES=256, PETRI_TRANSITIONS=306}
[2024-03-12 00:36:53,259 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:36:53,259 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow
[2024-03-12 00:36:53,260 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 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:36:53,260 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:53,260 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:36:53,260 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-12 00:36:53,260 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:53,260 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:53,260 INFO  L85        PathProgramCache]: Analyzing trace with hash 2041281070, now seen corresponding path program 1 times
[2024-03-12 00:36:53,261 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:53,261 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154580140]
[2024-03-12 00:36:53,261 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:53,261 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:53,270 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:53,284 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:36:53,284 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:53,284 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154580140]
[2024-03-12 00:36:53,285 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154580140] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:53,285 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:53,285 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:36:53,285 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285771682]
[2024-03-12 00:36:53,285 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:53,285 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:36:53,286 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:53,286 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:36:53,286 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:36:53,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:36:53,307 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 306 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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:36:53,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:53,308 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:36:53,308 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:53,981 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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[][164], [278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 29#L1061-6true, Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 199#L1041-10true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:36:53,981 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:53,981 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:53,981 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:53,981 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:55,680 INFO  L124   PetriNetUnfolderBase]: 4821/23949 cut-off events.
[2024-03-12 00:36:55,680 INFO  L125   PetriNetUnfolderBase]: For 1626/1674 co-relation queries the response was YES.
[2024-03-12 00:36:55,771 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35181 conditions, 23949 events. 4821/23949 cut-off events. For 1626/1674 co-relation queries the response was YES. Maximal size of possible extension queue 583. Compared 306299 event pairs, 1025 based on Foata normal form. 0/21010 useless extension candidates. Maximal degree in co-relation 16682. Up to 2444 conditions per place. 
[2024-03-12 00:36:55,826 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 20 selfloop transitions, 3 changer transitions 4/309 dead transitions.
[2024-03-12 00:36:55,826 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 309 transitions, 1017 flow
[2024-03-12 00:36:55,827 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:36:55,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:36:55,828 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions.
[2024-03-12 00:36:55,828 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384203480589023
[2024-03-12 00:36:55,828 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 701 transitions.
[2024-03-12 00:36:55,828 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions.
[2024-03-12 00:36:55,828 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:55,828 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions.
[2024-03-12 00:36:55,829 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 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:36:55,829 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:55,829 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:36:55,829 INFO  L175             Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 701 transitions.
[2024-03-12 00:36:55,829 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 309 transitions, 1017 flow
[2024-03-12 00:36:55,845 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 309 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:36:55,847 INFO  L231             Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow
[2024-03-12 00:36:55,848 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=256, PETRI_TRANSITIONS=302}
[2024-03-12 00:36:55,848 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-12 00:36:55,848 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow
[2024-03-12 00:36:55,848 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 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:36:55,848 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:55,848 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]
[2024-03-12 00:36:55,848 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-12 00:36:55,848 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:55,849 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:55,849 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295096415, now seen corresponding path program 1 times
[2024-03-12 00:36:55,849 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:55,849 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177959634]
[2024-03-12 00:36:55,849 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:55,849 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:55,856 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:55,891 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:36:55,892 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:55,892 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177959634]
[2024-03-12 00:36:55,892 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177959634] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:55,892 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:55,892 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:36:55,892 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047510584]
[2024-03-12 00:36:55,892 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:55,893 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:36:55,893 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:55,893 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:36:55,894 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:36:55,970 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:36:55,971 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 302 transitions, 951 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:36:55,971 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:55,971 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:36:55,971 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:56,505 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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[][157], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), 29#L1061-6true, Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:36:56,506 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,506 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,506 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,506 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,519 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][166], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:36:56,519 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,519 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,519 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,520 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-12 00:36:56,549 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][166], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 255#(<= |ULTIMATE.start_main_~breads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~0#1| 0)), Black: 256#(and (<= |ULTIMATE.start_main_~breads_total~0#1| 0) (= |ULTIMATE.start_main_~i~1#1| 0)), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-03-12 00:36:56,549 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:56,549 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:56,549 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:56,549 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:58,630 INFO  L124   PetriNetUnfolderBase]: 5018/24084 cut-off events.
[2024-03-12 00:36:58,630 INFO  L125   PetriNetUnfolderBase]: For 2031/2036 co-relation queries the response was YES.
[2024-03-12 00:36:58,730 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37568 conditions, 24084 events. 5018/24084 cut-off events. For 2031/2036 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 309004 event pairs, 1370 based on Foata normal form. 1/21434 useless extension candidates. Maximal degree in co-relation 35573. Up to 2662 conditions per place. 
[2024-03-12 00:36:58,787 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:36:58,787 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:36:58,788 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:36:58,788 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:36:58,788 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:36:58,788 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:36:58,789 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:36:58,789 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:36:58,789 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:36:58,789 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:36:58,790 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 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:36:58,790 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:36:58,791 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:36:58,791 INFO  L175             Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:36:58,791 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow
[2024-03-12 00:36:58,831 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 00:36:58,834 INFO  L231             Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow
[2024-03-12 00:36:58,834 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=966, PETRI_PLACES=255, PETRI_TRANSITIONS=305}
[2024-03-12 00:36:58,834 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places.
[2024-03-12 00:36:58,834 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow
[2024-03-12 00:36:58,835 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:36:58,835 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:36:58,835 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]
[2024-03-12 00:36:58,835 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-12 00:36:58,835 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:36:58,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:36:58,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542162764, now seen corresponding path program 1 times
[2024-03-12 00:36:58,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:36:58,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508112865]
[2024-03-12 00:36:58,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:36:58,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:36:58,843 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:36:58,875 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:36:58,875 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:36:58,875 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508112865]
[2024-03-12 00:36:58,875 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508112865] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:36:58,875 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:36:58,875 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:36:58,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238306250]
[2024-03-12 00:36:58,876 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:36:58,876 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:36:58,876 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:36:58,876 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:36:58,877 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:36:58,950 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:36:58,950 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 305 transitions, 966 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:36:58,950 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:36:58,951 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:36:58,951 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:36:59,379 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 29#L1061-6true, 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:36:59,379 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,379 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,379 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,379 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,392 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][165], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 183#L1041-9true, Black: 264#true, 27#L1063-6true, Black: 267#(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: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:36:59,392 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,392 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,392 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,392 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:36:59,420 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][165], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(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)), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:36:59,420 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-12 00:36:59,420 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:36:59,420 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:36:59,421 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:37:01,608 INFO  L124   PetriNetUnfolderBase]: 5017/24082 cut-off events.
[2024-03-12 00:37:01,609 INFO  L125   PetriNetUnfolderBase]: For 2159/2164 co-relation queries the response was YES.
[2024-03-12 00:37:01,695 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37638 conditions, 24082 events. 5017/24082 cut-off events. For 2159/2164 co-relation queries the response was YES. Maximal size of possible extension queue 616. Compared 308993 event pairs, 1370 based on Foata normal form. 1/21377 useless extension candidates. Maximal degree in co-relation 35634. Up to 2662 conditions per place. 
[2024-03-12 00:37:01,747 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:37:01,748 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:37:01,749 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:37:01,749 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:37:01,750 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions.
[2024-03-12 00:37:01,750 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.929718875502008
[2024-03-12 00:37:01,750 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 926 transitions.
[2024-03-12 00:37:01,750 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions.
[2024-03-12 00:37:01,751 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:01,751 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions.
[2024-03-12 00:37:01,752 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 0 states have call successors, (0), 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:37:01,752 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:01,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:01,753 INFO  L175             Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions.
[2024-03-12 00:37:01,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow
[2024-03-12 00:37:01,772 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:37:01,775 INFO  L231             Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow
[2024-03-12 00:37:01,775 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=985, PETRI_PLACES=260, PETRI_TRANSITIONS=306}
[2024-03-12 00:37:01,776 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places.
[2024-03-12 00:37:01,776 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow
[2024-03-12 00:37:01,776 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:37:01,776 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:01,776 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]
[2024-03-12 00:37:01,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-12 00:37:01,777 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:01,777 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:01,777 INFO  L85        PathProgramCache]: Analyzing trace with hash 1562573418, now seen corresponding path program 1 times
[2024-03-12 00:37:01,777 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:01,777 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301915206]
[2024-03-12 00:37:01,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:01,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:01,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:01,821 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:37:01,821 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:01,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301915206]
[2024-03-12 00:37:01,822 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301915206] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:01,822 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:01,822 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:37:01,822 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341776546]
[2024-03-12 00:37:01,823 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:01,823 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:37:01,823 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:01,824 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:37:01,824 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:37:01,889 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-12 00:37:01,889 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 306 transitions, 985 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:37:01,889 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:01,889 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-12 00:37:01,890 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:02,343 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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[][157], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 29#L1061-6true, 269#(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)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:02,343 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,343 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,343 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,344 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,357 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][166], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:02,357 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-12 00:37:02,387 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][166], [278#(= |#race~datas~0| 0), 281#true, 72#L1041-8true, 288#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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)), 199#L1041-10true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:02,388 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-12 00:37:02,388 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:37:02,388 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:37:02,388 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-12 00:37:04,827 INFO  L124   PetriNetUnfolderBase]: 5028/24109 cut-off events.
[2024-03-12 00:37:04,827 INFO  L125   PetriNetUnfolderBase]: For 2341/2346 co-relation queries the response was YES.
[2024-03-12 00:37:04,978 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37853 conditions, 24109 events. 5028/24109 cut-off events. For 2341/2346 co-relation queries the response was YES. Maximal size of possible extension queue 623. Compared 309528 event pairs, 1376 based on Foata normal form. 1/21487 useless extension candidates. Maximal degree in co-relation 37734. Up to 2672 conditions per place. 
[2024-03-12 00:37:05,048 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-12 00:37:05,048 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:37:05,049 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:37:05,049 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:37:05,050 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-12 00:37:05,050 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-12 00:37:05,051 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-12 00:37:05,051 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-12 00:37:05,051 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:05,051 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-12 00:37:05,052 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 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:37:05,053 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:05,053 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:05,053 INFO  L175             Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 927 transitions.
[2024-03-12 00:37:05,053 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1041 flow
[2024-03-12 00:37:05,079 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:37:05,082 INFO  L231             Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow
[2024-03-12 00:37:05,082 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=994, PETRI_PLACES=263, PETRI_TRANSITIONS=306}
[2024-03-12 00:37:05,083 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places.
[2024-03-12 00:37:05,083 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow
[2024-03-12 00:37:05,083 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 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:37:05,083 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:05,084 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]
[2024-03-12 00:37:05,084 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-12 00:37:05,084 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:05,084 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:05,084 INFO  L85        PathProgramCache]: Analyzing trace with hash -493115211, now seen corresponding path program 1 times
[2024-03-12 00:37:05,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:05,085 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428345825]
[2024-03-12 00:37:05,085 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:05,085 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:05,093 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:05,127 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:37:05,127 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:05,127 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428345825]
[2024-03-12 00:37:05,128 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428345825] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:05,128 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:05,128 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-12 00:37:05,128 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687453076]
[2024-03-12 00:37:05,129 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:05,129 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-12 00:37:05,129 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:05,130 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-12 00:37:05,130 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-12 00:37:05,210 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:37:05,210 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 306 transitions, 994 flow. Second operand  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 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:37:05,210 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:05,211 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:37:05,211 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:05,711 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 29#L1061-6true, Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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)), 199#L1041-10true, 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:05,712 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,712 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,712 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,712 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,724 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][165], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, 183#L1041-9true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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)), 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:05,724 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,724 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,725 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,725 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:05,753 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][165], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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)), 199#L1041-10true, 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:05,753 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:05,753 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:05,753 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:05,754 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:08,069 INFO  L124   PetriNetUnfolderBase]: 5134/24297 cut-off events.
[2024-03-12 00:37:08,070 INFO  L125   PetriNetUnfolderBase]: For 2483/2488 co-relation queries the response was YES.
[2024-03-12 00:37:08,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38368 conditions, 24297 events. 5134/24297 cut-off events. For 2483/2488 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 312140 event pairs, 1472 based on Foata normal form. 1/21621 useless extension candidates. Maximal degree in co-relation 38248. Up to 2860 conditions per place. 
[2024-03-12 00:37:08,320 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-12 00:37:08,320 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:37:08,321 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-12 00:37:08,321 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-12 00:37:08,322 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions.
[2024-03-12 00:37:08,322 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267068273092369
[2024-03-12 00:37:08,322 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 923 transitions.
[2024-03-12 00:37:08,322 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 923 transitions.
[2024-03-12 00:37:08,323 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:08,323 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 923 transitions.
[2024-03-12 00:37:08,324 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 230.75) internal successors, (923), 4 states have internal predecessors, (923), 0 states have call successors, (0), 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:37:08,325 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:08,325 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 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:37:08,325 INFO  L175             Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 923 transitions.
[2024-03-12 00:37:08,325 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1048 flow
[2024-03-12 00:37:08,356 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1040 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:37:08,359 INFO  L231             Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow
[2024-03-12 00:37:08,359 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=264, PETRI_TRANSITIONS=306}
[2024-03-12 00:37:08,360 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places.
[2024-03-12 00:37:08,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow
[2024-03-12 00:37:08,360 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 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:37:08,360 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:08,360 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]
[2024-03-12 00:37:08,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-12 00:37:08,361 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:08,361 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:08,361 INFO  L85        PathProgramCache]: Analyzing trace with hash 337626724, now seen corresponding path program 1 times
[2024-03-12 00:37:08,361 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:08,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851108282]
[2024-03-12 00:37:08,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:08,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:08,370 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:08,384 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:37:08,384 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:08,384 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851108282]
[2024-03-12 00:37:08,385 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851108282] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:08,385 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:08,385 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:37:08,385 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005818708]
[2024-03-12 00:37:08,386 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:08,386 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:37:08,386 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:08,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:37:08,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:37:08,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249
[2024-03-12 00:37:08,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 306 transitions, 998 flow. Second operand  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 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:37:08,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:08,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249
[2024-03-12 00:37:08,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:09,022 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([601] L1061-5-->L1061-6: Formula: (let ((.cse0 (select |v_#race_30| |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| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, 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_30|, 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[][154], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), 29#L1061-6true, Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 199#L1041-10true, 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:09,023 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,023 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,023 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,023 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,038 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][163], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 183#L1041-9true, Black: 264#true, 27#L1063-6true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:09,039 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,039 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,039 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,039 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-12 00:37:09,076 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([527] L1063-5-->L1063-6: Formula: (let ((.cse0 (select |v_#race_50| |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| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, 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_50|, 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[][163], [281#true, 278#(= |#race~datas~0| 0), 72#L1041-8true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(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: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(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)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, 27#L1063-6true, Black: 267#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 199#L1041-10true, 309#true, Black: 276#true, 301#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-03-12 00:37:09,076 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:09,076 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:09,077 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:09,077 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-12 00:37:11,498 INFO  L124   PetriNetUnfolderBase]: 5506/25025 cut-off events.
[2024-03-12 00:37:11,499 INFO  L125   PetriNetUnfolderBase]: For 3457/3791 co-relation queries the response was YES.
[2024-03-12 00:37:11,612 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39617 conditions, 25025 events. 5506/25025 cut-off events. For 3457/3791 co-relation queries the response was YES. Maximal size of possible extension queue 601. Compared 318677 event pairs, 1296 based on Foata normal form. 42/22195 useless extension candidates. Maximal degree in co-relation 39498. Up to 3542 conditions per place. 
[2024-03-12 00:37:11,674 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions.
[2024-03-12 00:37:11,674 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:37:11,675 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:37:11,675 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:37:11,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2024-03-12 00:37:11,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9370816599732262
[2024-03-12 00:37:11,676 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 700 transitions.
[2024-03-12 00:37:11,676 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions.
[2024-03-12 00:37:11,676 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:11,677 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions.
[2024-03-12 00:37:11,677 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 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:37:11,678 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:37:11,678 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:37:11,678 INFO  L175             Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions.
[2024-03-12 00:37:11,678 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow
[2024-03-12 00:37:11,696 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-12 00:37:11,698 INFO  L231             Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:37:11,699 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=265, PETRI_TRANSITIONS=316}
[2024-03-12 00:37:11,699 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-03-12 00:37:11,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow
[2024-03-12 00:37:11,699 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 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:37:11,700 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:11,700 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]
[2024-03-12 00:37:11,700 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-12 00:37:11,700 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:11,700 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:11,700 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957827092, now seen corresponding path program 1 times
[2024-03-12 00:37:11,701 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:11,701 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082049918]
[2024-03-12 00:37:11,701 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:11,701 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:11,719 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:11,909 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:37:11,909 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:11,909 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082049918]
[2024-03-12 00:37:11,909 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082049918] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:11,909 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:11,910 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:37:11,910 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724887232]
[2024-03-12 00:37:11,910 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:11,910 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:37:11,910 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:11,911 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:37:11,911 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:37:12,063 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249
[2024-03-12 00:37:12,064 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 316 transitions, 1096 flow. Second operand  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 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:37:12,065 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:12,065 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249
[2024-03-12 00:37:12,065 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:19,165 INFO  L124   PetriNetUnfolderBase]: 16582/60869 cut-off events.
[2024-03-12 00:37:19,165 INFO  L125   PetriNetUnfolderBase]: For 13822/15308 co-relation queries the response was YES.
[2024-03-12 00:37:19,633 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106952 conditions, 60869 events. 16582/60869 cut-off events. For 13822/15308 co-relation queries the response was YES. Maximal size of possible extension queue 1657. Compared 847523 event pairs, 4232 based on Foata normal form. 45/53546 useless extension candidates. Maximal degree in co-relation 106671. Up to 14791 conditions per place. 
[2024-03-12 00:37:19,828 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 125 selfloop transitions, 136 changer transitions 0/492 dead transitions.
[2024-03-12 00:37:19,829 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 492 transitions, 2362 flow
[2024-03-12 00:37:19,830 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:37:19,830 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:37:19,830 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions.
[2024-03-12 00:37:19,831 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.928380187416332
[2024-03-12 00:37:19,831 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions.
[2024-03-12 00:37:19,831 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions.
[2024-03-12 00:37:19,831 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:19,831 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions.
[2024-03-12 00:37:19,833 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 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:37:19,833 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:37:19,834 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:37:19,834 INFO  L175             Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 6 states and 1387 transitions.
[2024-03-12 00:37:19,834 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 492 transitions, 2362 flow
[2024-03-12 00:37:19,923 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 492 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:37:19,927 INFO  L231             Difference]: Finished difference. Result has 272 places, 449 transitions, 2210 flow
[2024-03-12 00:37:19,928 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=272, PETRI_TRANSITIONS=449}
[2024-03-12 00:37:19,928 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places.
[2024-03-12 00:37:19,928 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 449 transitions, 2210 flow
[2024-03-12 00:37:19,929 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 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:37:19,929 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:19,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:19,929 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-12 00:37:19,929 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:19,929 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:19,930 INFO  L85        PathProgramCache]: Analyzing trace with hash 807622693, now seen corresponding path program 1 times
[2024-03-12 00:37:19,930 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:19,930 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111880395]
[2024-03-12 00:37:19,930 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:19,930 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:19,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:20,133 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:37:20,133 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:20,133 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111880395]
[2024-03-12 00:37:20,134 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111880395] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:20,134 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:20,134 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:37:20,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393846775]
[2024-03-12 00:37:20,134 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:20,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:37:20,135 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:20,135 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:37:20,135 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:37:20,371 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-12 00:37:20,372 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 449 transitions, 2210 flow. Second operand  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 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:37:20,373 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:20,373 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-12 00:37:20,373 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:29,161 INFO  L124   PetriNetUnfolderBase]: 16236/68449 cut-off events.
[2024-03-12 00:37:29,161 INFO  L125   PetriNetUnfolderBase]: For 29732/31012 co-relation queries the response was YES.
[2024-03-12 00:37:29,602 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127436 conditions, 68449 events. 16236/68449 cut-off events. For 29732/31012 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 1019038 event pairs, 2971 based on Foata normal form. 52/60438 useless extension candidates. Maximal degree in co-relation 127144. Up to 12712 conditions per place. 
[2024-03-12 00:37:29,788 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 132 selfloop transitions, 119 changer transitions 0/581 dead transitions.
[2024-03-12 00:37:29,789 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 3612 flow
[2024-03-12 00:37:29,790 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:37:29,790 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:37:29,790 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions.
[2024-03-12 00:37:29,791 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-12 00:37:29,791 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions.
[2024-03-12 00:37:29,791 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions.
[2024-03-12 00:37:29,791 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:29,792 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions.
[2024-03-12 00:37:29,793 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 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:37:29,793 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:37:29,794 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 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:37:29,794 INFO  L175             Difference]: Start difference. First operand has 272 places, 449 transitions, 2210 flow. Second operand 6 states and 1371 transitions.
[2024-03-12 00:37:29,794 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 3612 flow
[2024-03-12 00:37:29,894 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 581 transitions, 3558 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 00:37:29,900 INFO  L231             Difference]: Finished difference. Result has 282 places, 563 transitions, 3576 flow
[2024-03-12 00:37:29,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3576, PETRI_PLACES=282, PETRI_TRANSITIONS=563}
[2024-03-12 00:37:29,900 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places.
[2024-03-12 00:37:29,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 563 transitions, 3576 flow
[2024-03-12 00:37:29,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 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:37:29,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:29,901 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, 1, 1, 1, 1, 1]
[2024-03-12 00:37:29,901 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-12 00:37:29,901 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:29,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:29,902 INFO  L85        PathProgramCache]: Analyzing trace with hash -120555844, now seen corresponding path program 1 times
[2024-03-12 00:37:29,902 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:29,902 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005850071]
[2024-03-12 00:37:29,902 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:29,902 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:29,918 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:30,218 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:37:30,218 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:30,218 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005850071]
[2024-03-12 00:37:30,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005850071] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:30,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:30,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:37:30,219 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220268938]
[2024-03-12 00:37:30,219 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:30,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:37:30,220 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:30,220 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:37:30,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:37:30,952 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249
[2024-03-12 00:37:30,954 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 563 transitions, 3576 flow. Second operand  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 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:37:30,954 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:30,954 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249
[2024-03-12 00:37:30,954 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:42,624 INFO  L124   PetriNetUnfolderBase]: 23340/78289 cut-off events.
[2024-03-12 00:37:42,625 INFO  L125   PetriNetUnfolderBase]: For 59242/64882 co-relation queries the response was YES.
[2024-03-12 00:37:43,251 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 181974 conditions, 78289 events. 23340/78289 cut-off events. For 59242/64882 co-relation queries the response was YES. Maximal size of possible extension queue 2162. Compared 1101721 event pairs, 5216 based on Foata normal form. 849/70923 useless extension candidates. Maximal degree in co-relation 181690. Up to 14933 conditions per place. 
[2024-03-12 00:37:43,636 INFO  L140   encePairwiseOnDemand]: 229/249 looper letters, 424 selfloop transitions, 224 changer transitions 0/874 dead transitions.
[2024-03-12 00:37:43,637 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 874 transitions, 7068 flow
[2024-03-12 00:37:43,637 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-12 00:37:43,637 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-12 00:37:43,639 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions.
[2024-03-12 00:37:43,640 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8682000730193501
[2024-03-12 00:37:43,640 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions.
[2024-03-12 00:37:43,640 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions.
[2024-03-12 00:37:43,640 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:43,641 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions.
[2024-03-12 00:37:43,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 216.1818181818182) internal successors, (2378), 11 states have internal predecessors, (2378), 0 states have call successors, (0), 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:37:43,644 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 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:37:43,645 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 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:37:43,645 INFO  L175             Difference]: Start difference. First operand has 282 places, 563 transitions, 3576 flow. Second operand 11 states and 2378 transitions.
[2024-03-12 00:37:43,645 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 874 transitions, 7068 flow
[2024-03-12 00:37:44,172 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 874 transitions, 7020 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-12 00:37:44,180 INFO  L231             Difference]: Finished difference. Result has 299 places, 689 transitions, 5536 flow
[2024-03-12 00:37:44,181 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5536, PETRI_PLACES=299, PETRI_TRANSITIONS=689}
[2024-03-12 00:37:44,181 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 60 predicate places.
[2024-03-12 00:37:44,181 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 689 transitions, 5536 flow
[2024-03-12 00:37:44,182 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 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:37:44,182 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:44,182 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, 1, 1, 1, 1, 1]
[2024-03-12 00:37:44,182 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-12 00:37:44,182 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:44,183 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:44,183 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053655554, now seen corresponding path program 1 times
[2024-03-12 00:37:44,183 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:44,183 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278436532]
[2024-03-12 00:37:44,183 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:44,183 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:44,202 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:44,561 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:37:44,562 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:44,562 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278436532]
[2024-03-12 00:37:44,562 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278436532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:44,563 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:44,563 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-12 00:37:44,563 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350073536]
[2024-03-12 00:37:44,563 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:44,564 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-12 00:37:44,564 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:44,565 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-12 00:37:44,565 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-12 00:37:45,381 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 249
[2024-03-12 00:37:45,382 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 689 transitions, 5536 flow. Second operand  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 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:37:45,382 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:45,383 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 249
[2024-03-12 00:37:45,383 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:37:56,579 INFO  L124   PetriNetUnfolderBase]: 19999/74649 cut-off events.
[2024-03-12 00:37:56,579 INFO  L125   PetriNetUnfolderBase]: For 103051/106678 co-relation queries the response was YES.
[2024-03-12 00:37:57,215 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 185107 conditions, 74649 events. 19999/74649 cut-off events. For 103051/106678 co-relation queries the response was YES. Maximal size of possible extension queue 2167. Compared 1092262 event pairs, 4708 based on Foata normal form. 1033/67505 useless extension candidates. Maximal degree in co-relation 184813. Up to 20563 conditions per place. 
[2024-03-12 00:37:57,457 INFO  L140   encePairwiseOnDemand]: 237/249 looper letters, 404 selfloop transitions, 18 changer transitions 0/702 dead transitions.
[2024-03-12 00:37:57,457 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 702 transitions, 6478 flow
[2024-03-12 00:37:57,458 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-12 00:37:57,458 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-12 00:37:57,459 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2072 transitions.
[2024-03-12 00:37:57,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8321285140562249
[2024-03-12 00:37:57,460 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2072 transitions.
[2024-03-12 00:37:57,460 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2072 transitions.
[2024-03-12 00:37:57,461 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:37:57,461 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2072 transitions.
[2024-03-12 00:37:57,463 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 207.2) internal successors, (2072), 10 states have internal predecessors, (2072), 0 states have call successors, (0), 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:37:57,465 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 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:37:57,465 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 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:37:57,465 INFO  L175             Difference]: Start difference. First operand has 299 places, 689 transitions, 5536 flow. Second operand 10 states and 2072 transitions.
[2024-03-12 00:37:57,465 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 702 transitions, 6478 flow
[2024-03-12 00:37:58,274 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 702 transitions, 6434 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-03-12 00:37:58,406 INFO  L231             Difference]: Finished difference. Result has 306 places, 690 transitions, 5564 flow
[2024-03-12 00:37:58,407 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5480, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5564, PETRI_PLACES=306, PETRI_TRANSITIONS=690}
[2024-03-12 00:37:58,408 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 67 predicate places.
[2024-03-12 00:37:58,408 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 690 transitions, 5564 flow
[2024-03-12 00:37:58,408 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 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:37:58,408 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:37:58,408 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, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:37:58,408 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-12 00:37:58,409 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:37:58,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:37:58,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 1230779042, now seen corresponding path program 1 times
[2024-03-12 00:37:58,409 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:37:58,409 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676137324]
[2024-03-12 00:37:58,409 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:37:58,410 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:37:58,424 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:37:58,442 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:37:58,442 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:37:58,443 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676137324]
[2024-03-12 00:37:58,443 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676137324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:37:58,443 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:37:58,443 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-12 00:37:58,443 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450386761]
[2024-03-12 00:37:58,443 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:37:58,444 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-12 00:37:58,444 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:37:58,444 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-12 00:37:58,444 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-12 00:37:58,482 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-12 00:37:58,483 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 690 transitions, 5564 flow. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:37:58,483 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:37:58,483 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-12 00:37:58,483 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:38:01,586 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(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: 320#(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: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(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)))), 166#L1063-2true, 91#L1043-1true, Black: 391#(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: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(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: 387#(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: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(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)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(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: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 267#(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)), 315#true, Black: 276#true, 393#(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|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 338#true, 215#L1042-3true, Black: 361#(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|))), threadThread1of2ForFork0InUse, Black: 347#(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: 359#(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|))), threadThread2of2ForFork0InUse, Black: 357#(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: 355#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true])
[2024-03-12 00:38:01,587 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-12 00:38:01,587 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:38:01,587 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:38:01,587 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-12 00:38:03,226 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(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: 320#(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: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(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)))), 166#L1063-2true, Black: 391#(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: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(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: 387#(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: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(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)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(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: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 267#(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: 276#true, 315#true, 264#true, 393#(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: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, 235#L1043-19true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(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: 347#(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)))), threadThread1of2ForFork0InUse, Black: 359#(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|))), threadThread2of2ForFork0InUse, Black: 357#(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: 355#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), Black: 246#true])
[2024-03-12 00:38:03,227 INFO  L294   olderBase$Statistics]: this new event has 174 ancestors and is cut-off event
[2024-03-12 00:38:03,227 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:38:03,227 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:38:03,227 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-12 00:38:03,438 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(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: 320#(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: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(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)))), 166#L1063-2true, Black: 391#(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: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(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: 387#(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: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(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)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(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: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(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)), 315#true, Black: 276#true, 393#(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|))), 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(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: 347#(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)))), threadThread1of2ForFork0InUse, 10#L1043-20true, Black: 359#(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: 357#(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|))), threadThread2of2ForFork0InUse, Black: 355#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)])
[2024-03-12 00:38:03,438 INFO  L294   olderBase$Statistics]: this new event has 175 ancestors and is cut-off event
[2024-03-12 00:38:03,438 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:38:03,439 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:38:03,439 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-12 00:38:03,683 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][614], [278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(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: 320#(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: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 318#(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)))), 166#L1063-2true, Black: 391#(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: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(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: 387#(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: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(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)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(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: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(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)), 315#true, Black: 276#true, 393#(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|))), 196#L1043-21true, 264#true, Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 281#true, 326#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), 215#L1042-3true, Black: 338#true, Black: 361#(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: 347#(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)))), threadThread1of2ForFork0InUse, Black: 359#(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: 357#(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|))), threadThread2of2ForFork0InUse, Black: 355#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|), 401#(= |threadThread1of2ForFork0_#t~nondet8| |#race~threads_mask~0|)])
[2024-03-12 00:38:03,684 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-12 00:38:03,684 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:38:03,684 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:38:03,684 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-12 00:38:05,094 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([775] L1042-->L1042-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17|))) (and (= (select .cse0 |v_~#threads_mask_mutex~0.offset_17|) 0) (= |v_threadThread2of2ForFork0_#t~nondet5_1| 0) (= |v_#pthreadsMutex_21| (store |v_#pthreadsMutex_22| |v_~#threads_mask_mutex~0.base_17| (store .cse0 |v_~#threads_mask_mutex~0.offset_17| 1)))))  InVars {#pthreadsMutex=|v_#pthreadsMutex_22|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|}  OutVars{#pthreadsMutex=|v_#pthreadsMutex_21|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_17|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_17|, threadThread2of2ForFork0_#t~nondet5=|v_threadThread2of2ForFork0_#t~nondet5_1|}  AuxVars[]  AssignedVars[#pthreadsMutex, threadThread2of2ForFork0_#t~nondet5][410], [60#L1044-3true, 278#(= |#race~datas~0| 0), Black: 317#(= |threadThread1of2ForFork0_#t~nondet4| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 319#(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: 320#(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: 318#(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: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 166#L1063-2true, Black: 391#(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: 385#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 329#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 389#(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: 387#(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: 328#(= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0), Black: 268#(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)), Black: 331#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|))) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 3 |ULTIMATE.start_main_#t~mem25#1.offset|)) 0)), Black: 269#(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: 330#(and (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) |ULTIMATE.start_main_#t~mem25#1.offset|)) 0) (= 0 (select (select |#race| |ULTIMATE.start_main_#t~mem25#1.base|) (+ (* |ULTIMATE.start_main_~i~1#1| 4) 2 |ULTIMATE.start_main_#t~mem25#1.offset|)))), Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 353#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#tids~0#1.base|) (not (= ~datas~0.base |ULTIMATE.start_main_~#tids~0#1.base|))), Black: 267#(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)), 315#true, Black: 276#true, 264#true, 393#(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: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0)), 326#true, 281#true, Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 399#true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), Black: 338#true, 215#L1042-3true, Black: 361#(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: 347#(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)))), threadThread1of2ForFork0InUse, Black: 359#(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|))), threadThread2of2ForFork0InUse, Black: 357#(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: 355#(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: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), Black: 248#(= |#race~threads_mask~0| 0), Black: 311#(= |#race~threads_mask~0| |ULTIMATE.start_main_#t~nondet19#1|)])
[2024-03-12 00:38:05,095 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-12 00:38:05,095 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:38:05,095 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:38:05,095 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-12 00:38:09,807 INFO  L124   PetriNetUnfolderBase]: 17816/75735 cut-off events.
[2024-03-12 00:38:09,807 INFO  L125   PetriNetUnfolderBase]: For 79446/85745 co-relation queries the response was YES.
[2024-03-12 00:38:10,563 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 167349 conditions, 75735 events. 17816/75735 cut-off events. For 79446/85745 co-relation queries the response was YES. Maximal size of possible extension queue 2013. Compared 1149149 event pairs, 2684 based on Foata normal form. 259/67801 useless extension candidates. Maximal degree in co-relation 166963. Up to 9388 conditions per place. 
[2024-03-12 00:38:10,793 INFO  L140   encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/711 dead transitions.
[2024-03-12 00:38:10,793 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 711 transitions, 5772 flow
[2024-03-12 00:38:10,794 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-12 00:38:10,794 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-12 00:38:10,795 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions.
[2024-03-12 00:38:10,795 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9464524765729585
[2024-03-12 00:38:10,795 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 707 transitions.
[2024-03-12 00:38:10,795 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions.
[2024-03-12 00:38:10,795 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:38:10,795 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions.
[2024-03-12 00:38:10,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 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:38:10,797 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:38:10,797 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 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:38:10,797 INFO  L175             Difference]: Start difference. First operand has 306 places, 690 transitions, 5564 flow. Second operand 3 states and 707 transitions.
[2024-03-12 00:38:10,797 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 711 transitions, 5772 flow
[2024-03-12 00:38:11,613 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 711 transitions, 5736 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-12 00:38:11,620 INFO  L231             Difference]: Finished difference. Result has 305 places, 705 transitions, 5710 flow
[2024-03-12 00:38:11,620 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5528, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5710, PETRI_PLACES=305, PETRI_TRANSITIONS=705}
[2024-03-12 00:38:11,620 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places.
[2024-03-12 00:38:11,621 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 705 transitions, 5710 flow
[2024-03-12 00:38:11,621 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 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:38:11,621 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:38:11,621 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:38:11,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-12 00:38:11,621 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:38:11,622 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:38:11,622 INFO  L85        PathProgramCache]: Analyzing trace with hash -341571048, now seen corresponding path program 1 times
[2024-03-12 00:38:11,622 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:38:11,622 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100003585]
[2024-03-12 00:38:11,622 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:38:11,622 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:38:11,644 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:38:12,191 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:38:12,191 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:38:12,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100003585]
[2024-03-12 00:38:12,191 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100003585] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:38:12,191 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710837513]
[2024-03-12 00:38:12,192 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:38:12,192 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:38:12,192 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:38:12,193 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:38:12,195 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:38:12,383 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:38:12,385 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-03-12 00:38:12,390 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:38:12,423 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:38:12,494 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:38:12,494 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:38:12,847 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:38:12,848 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:38:12,896 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:12,897 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:38:12,984 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:38:12,997 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:38:13,004 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:38:13,017 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:38:13,017 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:38:13,044 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:38:13,044 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:38:13,074 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:38:13,085 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:38:13,085 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:38:13,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710837513] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:38:13,085 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:38:13,085 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21
[2024-03-12 00:38:13,085 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137408004]
[2024-03-12 00:38:13,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:38:13,086 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-12 00:38:13,086 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:38:13,086 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-12 00:38:13,087 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2024-03-12 00:38:14,258 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:38:14,260 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 705 transitions, 5710 flow. Second operand  has 14 states, 14 states have (on average 188.35714285714286) internal successors, (2637), 14 states have internal predecessors, (2637), 0 states have call successors, (0), 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:38:14,260 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:38:14,260 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:38:14,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:38:36,028 INFO  L124   PetriNetUnfolderBase]: 36676/117459 cut-off events.
[2024-03-12 00:38:36,028 INFO  L125   PetriNetUnfolderBase]: For 205771/206989 co-relation queries the response was YES.
[2024-03-12 00:38:37,276 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 318076 conditions, 117459 events. 36676/117459 cut-off events. For 205771/206989 co-relation queries the response was YES. Maximal size of possible extension queue 2988. Compared 1708588 event pairs, 6256 based on Foata normal form. 250/107152 useless extension candidates. Maximal degree in co-relation 317303. Up to 14313 conditions per place. 
[2024-03-12 00:38:37,690 INFO  L140   encePairwiseOnDemand]: 225/249 looper letters, 1024 selfloop transitions, 487 changer transitions 0/1736 dead transitions.
[2024-03-12 00:38:37,691 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1736 transitions, 19539 flow
[2024-03-12 00:38:37,692 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-12 00:38:37,692 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-12 00:38:37,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3998 transitions.
[2024-03-12 00:38:37,694 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8028112449799196
[2024-03-12 00:38:37,694 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3998 transitions.
[2024-03-12 00:38:37,694 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3998 transitions.
[2024-03-12 00:38:37,695 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:38:37,695 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3998 transitions.
[2024-03-12 00:38:37,698 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 199.9) internal successors, (3998), 20 states have internal predecessors, (3998), 0 states have call successors, (0), 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:38:37,700 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 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:38:37,701 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 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:38:37,701 INFO  L175             Difference]: Start difference. First operand has 305 places, 705 transitions, 5710 flow. Second operand 20 states and 3998 transitions.
[2024-03-12 00:38:37,701 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1736 transitions, 19539 flow
[2024-03-12 00:38:39,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1736 transitions, 19501 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-12 00:38:39,807 INFO  L231             Difference]: Finished difference. Result has 332 places, 1116 transitions, 12628 flow
[2024-03-12 00:38:39,808 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5672, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12628, PETRI_PLACES=332, PETRI_TRANSITIONS=1116}
[2024-03-12 00:38:39,808 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 93 predicate places.
[2024-03-12 00:38:39,808 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 1116 transitions, 12628 flow
[2024-03-12 00:38:39,809 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 188.35714285714286) internal successors, (2637), 14 states have internal predecessors, (2637), 0 states have call successors, (0), 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:38:39,809 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:38:39,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:38:39,817 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:38:40,009 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:38:40,010 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:38:40,011 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:38:40,011 INFO  L85        PathProgramCache]: Analyzing trace with hash -1494089320, now seen corresponding path program 2 times
[2024-03-12 00:38:40,011 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:38:40,012 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248912615]
[2024-03-12 00:38:40,012 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:38:40,012 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:38:40,036 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:38:40,826 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:38:40,826 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:38:40,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248912615]
[2024-03-12 00:38:40,826 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248912615] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:38:40,826 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432796494]
[2024-03-12 00:38:40,827 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:38:40,827 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:38:40,827 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:38:40,828 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:38:40,830 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:38:41,018 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:38:41,018 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:38:41,019 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 00:38:41,025 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:38:41,056 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:38:41,151 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:38:41,151 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:38:41,604 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:38:41,605 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:38:41,685 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:41,687 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:38:41,712 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:38:41,763 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:38:41,834 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:38:41,834 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:38:41,911 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:38:41,911 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:38:42,260 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:38:42,347 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:42,348 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:38:42,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:42,382 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:38:42,414 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:42,416 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:38:42,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:38:42,456 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:38:42,517 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:38:42,532 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:38:42,532 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:38:42,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [432796494] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:38:42,533 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:38:42,533 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:38:42,533 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545124409]
[2024-03-12 00:38:42,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:38:42,534 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:38:42,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:38:42,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:38:42,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:38:43,691 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:38:43,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1116 transitions, 12628 flow. Second operand  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 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:38:43,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:38:43,694 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:38:43,694 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:39:11,263 INFO  L124   PetriNetUnfolderBase]: 37383/118274 cut-off events.
[2024-03-12 00:39:11,263 INFO  L125   PetriNetUnfolderBase]: For 350195/354913 co-relation queries the response was YES.
[2024-03-12 00:39:12,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 356755 conditions, 118274 events. 37383/118274 cut-off events. For 350195/354913 co-relation queries the response was YES. Maximal size of possible extension queue 3106. Compared 1720492 event pairs, 5733 based on Foata normal form. 516/107743 useless extension candidates. Maximal degree in co-relation 356153. Up to 18633 conditions per place. 
[2024-03-12 00:39:13,370 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 825 selfloop transitions, 806 changer transitions 0/1856 dead transitions.
[2024-03-12 00:39:13,370 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1856 transitions, 24287 flow
[2024-03-12 00:39:13,372 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-12 00:39:13,372 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-12 00:39:13,374 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5046 transitions.
[2024-03-12 00:39:13,375 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8106024096385542
[2024-03-12 00:39:13,375 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 5046 transitions.
[2024-03-12 00:39:13,375 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 5046 transitions.
[2024-03-12 00:39:13,376 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:39:13,376 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5046 transitions.
[2024-03-12 00:39:13,379 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 201.84) internal successors, (5046), 25 states have internal predecessors, (5046), 0 states have call successors, (0), 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:39:13,382 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 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:39:13,382 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 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:39:13,382 INFO  L175             Difference]: Start difference. First operand has 332 places, 1116 transitions, 12628 flow. Second operand 25 states and 5046 transitions.
[2024-03-12 00:39:13,383 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1856 transitions, 24287 flow
[2024-03-12 00:39:17,576 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1856 transitions, 24157 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-03-12 00:39:17,594 INFO  L231             Difference]: Finished difference. Result has 359 places, 1449 transitions, 20376 flow
[2024-03-12 00:39:17,595 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12504, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=484, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=20376, PETRI_PLACES=359, PETRI_TRANSITIONS=1449}
[2024-03-12 00:39:17,596 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 120 predicate places.
[2024-03-12 00:39:17,596 INFO  L495      AbstractCegarLoop]: Abstraction has has 359 places, 1449 transitions, 20376 flow
[2024-03-12 00:39:17,596 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 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:39:17,596 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:39:17,596 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:39:17,603 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-12 00:39:17,797 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,SelfDestructingSolverStorable43
[2024-03-12 00:39:17,798 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:39:17,798 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:39:17,799 INFO  L85        PathProgramCache]: Analyzing trace with hash -1416884328, now seen corresponding path program 3 times
[2024-03-12 00:39:17,799 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:39:17,799 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889459567]
[2024-03-12 00:39:17,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:39:17,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:39:17,825 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:39:18,547 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:39:18,547 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:39:18,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889459567]
[2024-03-12 00:39:18,548 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889459567] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:39:18,548 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1154283324]
[2024-03-12 00:39:18,548 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:39:18,549 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:39:18,549 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:39:18,550 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:39:18,552 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:39:18,747 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:39:18,747 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:39:18,749 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-12 00:39:18,755 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:39:18,796 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:39:18,879 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:39:18,880 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:39:19,344 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:39:19,345 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:39:19,417 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:39:19,418 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:39:19,462 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:39:19,523 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:39:19,598 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:39:19,599 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:39:19,865 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:39:19,933 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:39:19,934 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:39:20,020 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:39:20,021 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:39:20,053 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:39:20,054 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:39:20,088 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:39:20,089 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:39:20,122 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:39:20,122 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:39:20,171 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:39:20,185 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:39:20,186 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:39:20,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1154283324] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:39:20,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:39:20,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-12 00:39:20,187 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129553611]
[2024-03-12 00:39:20,187 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:39:20,187 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-12 00:39:20,188 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:39:20,188 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-12 00:39:20,189 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-12 00:39:21,675 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-12 00:39:21,677 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1449 transitions, 20376 flow. Second operand  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 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:39:21,678 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:39:21,678 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-12 00:39:21,678 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:39:53,939 INFO  L124   PetriNetUnfolderBase]: 39792/124613 cut-off events.
[2024-03-12 00:39:53,939 INFO  L125   PetriNetUnfolderBase]: For 573591/579139 co-relation queries the response was YES.
[2024-03-12 00:39:55,752 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 414309 conditions, 124613 events. 39792/124613 cut-off events. For 573591/579139 co-relation queries the response was YES. Maximal size of possible extension queue 3293. Compared 1817697 event pairs, 5892 based on Foata normal form. 892/113983 useless extension candidates. Maximal degree in co-relation 413700. Up to 19410 conditions per place. 
[2024-03-12 00:39:56,346 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 879 selfloop transitions, 1090 changer transitions 0/2194 dead transitions.
[2024-03-12 00:39:56,346 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 2194 transitions, 33316 flow
[2024-03-12 00:39:56,347 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-12 00:39:56,347 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-12 00:39:56,350 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5253 transitions.
[2024-03-12 00:39:56,351 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8113994439295644
[2024-03-12 00:39:56,351 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 5253 transitions.
[2024-03-12 00:39:56,351 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 5253 transitions.
[2024-03-12 00:39:56,352 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:39:56,352 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5253 transitions.
[2024-03-12 00:39:56,356 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 27 states, 26 states have (on average 202.03846153846155) internal successors, (5253), 26 states have internal predecessors, (5253), 0 states have call successors, (0), 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:39:56,359 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 0 states have call successors, (0), 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:39:56,359 INFO  L81            ComplementDD]: Finished complementDD. Result  has 27 states, 27 states have (on average 249.0) internal successors, (6723), 27 states have internal predecessors, (6723), 0 states have call successors, (0), 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:39:56,359 INFO  L175             Difference]: Start difference. First operand has 359 places, 1449 transitions, 20376 flow. Second operand 26 states and 5253 transitions.
[2024-03-12 00:39:56,359 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 2194 transitions, 33316 flow
[2024-03-12 00:40:05,463 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 2194 transitions, 32510 flow, removed 397 selfloop flow, removed 6 redundant places.
[2024-03-12 00:40:05,488 INFO  L231             Difference]: Finished difference. Result has 388 places, 1754 transitions, 28678 flow
[2024-03-12 00:40:05,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19634, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=803, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=28678, PETRI_PLACES=388, PETRI_TRANSITIONS=1754}
[2024-03-12 00:40:05,489 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 149 predicate places.
[2024-03-12 00:40:05,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 388 places, 1754 transitions, 28678 flow
[2024-03-12 00:40:05,490 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 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:05,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:40:05,490 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:40:05,498 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:40:05,691 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,14 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:40:05,692 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-12 00:40:05,693 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:40:05,693 INFO  L85        PathProgramCache]: Analyzing trace with hash -2129244486, now seen corresponding path program 4 times
[2024-03-12 00:40:05,694 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:40:05,694 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781897572]
[2024-03-12 00:40:05,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:40:05,695 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:40:05,716 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:40:06,468 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:06,469 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:40:06,469 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781897572]
[2024-03-12 00:40:06,469 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781897572] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:40:06,470 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57797885]
[2024-03-12 00:40:06,470 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 00:40:06,470 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:40:06,470 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:40:06,472 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:40:06,473 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:40:06,779 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 00:40:06,780 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:40:06,782 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 68 conjunts are in the unsatisfiable core
[2024-03-12 00:40:06,790 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:40:06,799 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:06,835 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:06,836 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14
[2024-03-12 00:40:06,953 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:06,968 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 00:40:06,968 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:40:07,975 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 00:40:07,975 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 50 treesize of output 45
[2024-03-12 00:40:07,980 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:40:07,981 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 24 treesize of output 11
[2024-03-12 00:40:08,305 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:08,312 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:08,408 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 11 treesize of output 7
[2024-03-12 00:40:08,477 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 19 treesize of output 18
[2024-03-12 00:40:08,801 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 7 treesize of output 3
[2024-03-12 00:40:08,809 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 25 treesize of output 13
[2024-03-12 00:40:08,874 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 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:08,964 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 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:09,068 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:09,103 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:09,140 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:09,168 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:09,303 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:40:09,361 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:09,362 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-12 00:40:09,362 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [57797885] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:40:09,362 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-12 00:40:09,362 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32
[2024-03-12 00:40:09,362 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900354128]
[2024-03-12 00:40:09,362 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:40:09,363 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-12 00:40:09,363 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:40:09,363 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-12 00:40:09,364 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056
[2024-03-12 00:40:12,343 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 249
[2024-03-12 00:40:12,347 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1754 transitions, 28678 flow. Second operand  has 19 states, 19 states have (on average 179.94736842105263) internal successors, (3419), 19 states have internal predecessors, (3419), 0 states have call successors, (0), 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:12,347 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:40:12,347 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 249
[2024-03-12 00:40:12,348 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:41:51,793 INFO  L124   PetriNetUnfolderBase]: 111893/331048 cut-off events.
[2024-03-12 00:41:51,794 INFO  L125   PetriNetUnfolderBase]: For 2057300/2063871 co-relation queries the response was YES.
[2024-03-12 00:41:57,714 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1181156 conditions, 331048 events. 111893/331048 cut-off events. For 2057300/2063871 co-relation queries the response was YES. Maximal size of possible extension queue 8525. Compared 5305912 event pairs, 22875 based on Foata normal form. 1188/298833 useless extension candidates. Maximal degree in co-relation 1162550. Up to 58592 conditions per place. 
