./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.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.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 45e0b1bcb7e3b0f9a4a9c2b3c308b2bd82f05051956f6981c826030ab9acbdbf
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-09 05:46:04,060 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 05:46:04,099 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 05:46:04,103 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-09 05:46:04,103 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-09 05:46:04,121 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 05:46:04,121 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 05:46:04,121 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 05:46:04,122 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 05:46:04,122 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 05:46:04,123 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 05:46:04,123 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 05:46:04,124 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-09 05:46:04,124 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 05:46:04,124 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 05:46:04,125 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-09 05:46:04,125 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 05:46:04,125 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 05:46:04,126 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 05:46:04,126 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 05:46:04,126 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 05:46:04,127 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 05:46:04,127 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 05:46:04,128 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-09 05:46:04,128 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-09 05:46:04,128 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 05:46:04,129 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-09 05:46:04,129 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 05:46:04,129 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 05:46:04,129 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 05:46:04,130 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:46:04,130 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 05:46:04,130 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 05:46:04,131 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-09 05:46:04,131 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 05:46:04,131 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 05:46:04,131 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-09 05:46:04,132 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 05:46:04,132 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 05:46:04,132 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 05:46:04,132 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 05:46:04,133 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 -> 45e0b1bcb7e3b0f9a4a9c2b3c308b2bd82f05051956f6981c826030ab9acbdbf
[2024-03-09 05:46:04,298 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 05:46:04,330 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 05:46:04,332 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 05:46:04,333 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-09 05:46:04,334 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-09 05:46:04,335 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-03-09 05:46:05,429 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 05:46:05,643 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-09 05:46:05,644 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-03-09 05:46:05,659 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/593f3d336/f2fcfc113ee440feab94e6175045a910/FLAG79b91892e
[2024-03-09 05:46:05,669 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/593f3d336/f2fcfc113ee440feab94e6175045a910
[2024-03-09 05:46:05,671 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 05:46:05,672 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 05:46:05,673 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 05:46:05,673 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 05:46:05,677 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 05:46:05,677 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:46:05" (1/1) ...
[2024-03-09 05:46:05,678 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@544286fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:05, skipping insertion in model container
[2024-03-09 05:46:05,678 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:46:05" (1/1) ...
[2024-03-09 05:46:05,714 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-09 05:46:06,015 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:46:06,026 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-09 05:46:06,064 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-09 05:46:06,117 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-03-09 05:46:06,122 INFO  L206         MainTranslator]: Completed translation
[2024-03-09 05:46:06,123 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06 WrapperNode
[2024-03-09 05:46:06,123 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 05:46:06,124 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 05:46:06,124 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 05:46:06,124 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 05:46:06,130 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,145 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,165 INFO  L138                Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-03-09 05:46:06,166 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 05:46:06,166 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 05:46:06,166 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 05:46:06,167 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 05:46:06,173 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,174 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,177 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,177 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,185 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,188 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,191 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,192 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,195 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 05:46:06,195 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 05:46:06,196 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 05:46:06,196 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-09 05:46:06,196 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (1/1) ...
[2024-03-09 05:46:06,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-09 05:46:06,208 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:06,237 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-09 05:46:06,245 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-09 05:46:06,268 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 05:46:06,268 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 05:46:06,268 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 05:46:06,268 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 05:46:06,269 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-03-09 05:46:06,270 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-03-09 05:46:06,270 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-03-09 05:46:06,270 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 05:46:06,270 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 05:46:06,270 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 05:46:06,271 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 05:46:06,272 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-09 05:46:06,422 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-09 05:46:06,424 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 05:46:06,669 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-09 05:46:06,685 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 05:46:06,686 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 05:46:06,687 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:46:06 BoogieIcfgContainer
[2024-03-09 05:46:06,687 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 05:46:06,689 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 05:46:06,689 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 05:46:06,692 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-09 05:46:06,692 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:46:05" (1/3) ...
[2024-03-09 05:46:06,693 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f477e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:46:06, skipping insertion in model container
[2024-03-09 05:46:06,693 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:46:06" (2/3) ...
[2024-03-09 05:46:06,693 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f477e22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:46:06, skipping insertion in model container
[2024-03-09 05:46:06,693 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 05:46:06" (3/3) ...
[2024-03-09 05:46:06,694 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask.i
[2024-03-09 05:46:06,700 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 05:46:06,708 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 05:46:06,708 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-03-09 05:46:06,708 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 05:46:06,759 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 05:46:06,787 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow
[2024-03-09 05:46:06,865 INFO  L124   PetriNetUnfolderBase]: 16/287 cut-off events.
[2024-03-09 05:46:06,865 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-09 05:46:06,871 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-09 05:46:06,871 INFO  L82        GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow
[2024-03-09 05:46:06,876 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow
[2024-03-09 05:46:06,884 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:46:06,889 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;@539dea3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:46:06,889 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-03-09 05:46:06,896 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:46:06,896 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-09 05:46:06,897 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:46:06,897 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:06,897 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-09 05:46:06,898 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-09 05:46:06,902 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:06,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 2042425697, now seen corresponding path program 1 times
[2024-03-09 05:46:06,909 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:06,910 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861991298]
[2024-03-09 05:46:06,910 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:06,910 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:06,995 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:07,090 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-09 05:46:07,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:07,091 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861991298]
[2024-03-09 05:46:07,091 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861991298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:07,091 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:07,092 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:07,093 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287548175]
[2024-03-09 05:46:07,093 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:07,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:07,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:07,121 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:07,122 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:07,149 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-09 05:46:07,152 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-09 05:46:07,152 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:07,152 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-09 05:46:07,153 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:07,229 INFO  L124   PetriNetUnfolderBase]: 34/480 cut-off events.
[2024-03-09 05:46:07,229 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 05:46:07,231 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-09 05:46:07,233 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions.
[2024-03-09 05:46:07,233 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow
[2024-03-09 05:46:07,235 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:07,236 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:07,243 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2024-03-09 05:46:07,245 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.936026936026936
[2024-03-09 05:46:07,246 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2024-03-09 05:46:07,246 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2024-03-09 05:46:07,248 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:07,250 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2024-03-09 05:46:07,254 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-09 05:46:07,259 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-09 05:46:07,259 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-09 05:46:07,261 INFO  L175             Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions.
[2024-03-09 05:46:07,262 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow
[2024-03-09 05:46:07,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-09 05:46:07,267 INFO  L231             Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow
[2024-03-09 05:46:07,269 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-09 05:46:07,272 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-09 05:46:07,273 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow
[2024-03-09 05:46:07,273 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-09 05:46:07,273 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:07,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-09 05:46:07,274 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 05:46:07,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-09 05:46:07,275 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:07,275 INFO  L85        PathProgramCache]: Analyzing trace with hash -103642509, now seen corresponding path program 1 times
[2024-03-09 05:46:07,275 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:07,275 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91045530]
[2024-03-09 05:46:07,275 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:07,276 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:07,296 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:07,342 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-09 05:46:07,343 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:07,344 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91045530]
[2024-03-09 05:46:07,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91045530] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:07,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:07,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:07,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478749108]
[2024-03-09 05:46:07,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:07,347 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:07,348 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:07,348 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:07,348 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:07,371 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-09 05:46:07,372 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-09 05:46:07,372 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:07,372 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-09 05:46:07,372 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:07,468 INFO  L124   PetriNetUnfolderBase]: 87/676 cut-off events.
[2024-03-09 05:46:07,468 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-09 05:46:07,470 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-09 05:46:07,471 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions.
[2024-03-09 05:46:07,472 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow
[2024-03-09 05:46:07,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:07,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:07,474 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-03-09 05:46:07,474 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-03-09 05:46:07,474 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-03-09 05:46:07,474 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-03-09 05:46:07,475 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:07,475 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-03-09 05:46:07,476 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-09 05:46:07,478 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-09 05:46:07,479 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-09 05:46:07,479 INFO  L175             Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions.
[2024-03-09 05:46:07,479 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow
[2024-03-09 05:46:07,480 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:46:07,482 INFO  L231             Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow
[2024-03-09 05:46:07,483 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-09 05:46:07,483 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-03-09 05:46:07,484 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow
[2024-03-09 05:46:07,484 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-09 05:46:07,484 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:07,484 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-09 05:46:07,485 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 05:46:07,485 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-09 05:46:07,485 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:07,485 INFO  L85        PathProgramCache]: Analyzing trace with hash -1853499857, now seen corresponding path program 1 times
[2024-03-09 05:46:07,486 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:07,486 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056135621]
[2024-03-09 05:46:07,486 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:07,486 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:07,508 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:07,601 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-09 05:46:07,601 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:07,601 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056135621]
[2024-03-09 05:46:07,601 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056135621] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:07,602 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:07,602 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:46:07,602 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786699233]
[2024-03-09 05:46:07,602 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:07,603 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:46:07,603 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:07,603 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:46:07,604 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:46:07,660 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-09 05:46:07,661 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-09 05:46:07,661 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:07,661 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-09 05:46:07,661 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:07,763 INFO  L124   PetriNetUnfolderBase]: 68/710 cut-off events.
[2024-03-09 05:46:07,763 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-03-09 05:46:07,764 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-09 05:46:07,766 INFO  L140   encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions.
[2024-03-09 05:46:07,766 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow
[2024-03-09 05:46:07,767 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:46:07,767 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:46:07,769 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions.
[2024-03-09 05:46:07,770 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-03-09 05:46:07,770 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions.
[2024-03-09 05:46:07,770 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions.
[2024-03-09 05:46:07,771 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:07,771 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions.
[2024-03-09 05:46:07,773 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-09 05:46:07,776 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-09 05:46:07,776 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-09 05:46:07,777 INFO  L175             Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions.
[2024-03-09 05:46:07,777 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow
[2024-03-09 05:46:07,779 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:46:07,781 INFO  L231             Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow
[2024-03-09 05:46:07,782 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-09 05:46:07,782 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places.
[2024-03-09 05:46:07,783 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow
[2024-03-09 05:46:07,783 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-09 05:46:07,783 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:07,784 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-09 05:46:07,784 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 05:46:07,784 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-09 05:46:07,784 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:07,785 INFO  L85        PathProgramCache]: Analyzing trace with hash 1513540216, now seen corresponding path program 1 times
[2024-03-09 05:46:07,785 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:07,785 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462969737]
[2024-03-09 05:46:07,785 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:07,785 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:07,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:08,098 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-09 05:46:08,099 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:08,099 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462969737]
[2024-03-09 05:46:08,099 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462969737] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:08,099 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:08,099 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:46:08,100 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117730124]
[2024-03-09 05:46:08,100 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:08,100 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:46:08,101 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:08,101 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:46:08,101 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:46:08,322 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198
[2024-03-09 05:46:08,324 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-09 05:46:08,324 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:08,324 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198
[2024-03-09 05:46:08,325 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:08,583 INFO  L124   PetriNetUnfolderBase]: 300/1732 cut-off events.
[2024-03-09 05:46:08,584 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-09 05:46:08,586 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-09 05:46:08,590 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 52 selfloop transitions, 29 changer transitions 0/252 dead transitions.
[2024-03-09 05:46:08,590 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 748 flow
[2024-03-09 05:46:08,591 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:46:08,591 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:46:08,592 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions.
[2024-03-09 05:46:08,593 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-03-09 05:46:08,593 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions.
[2024-03-09 05:46:08,593 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions.
[2024-03-09 05:46:08,594 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:08,594 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions.
[2024-03-09 05:46:08,596 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-09 05:46:08,598 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-09 05:46:08,599 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-09 05:46:08,599 INFO  L175             Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1056 transitions.
[2024-03-09 05:46:08,599 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 748 flow
[2024-03-09 05:46:08,602 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 252 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:46:08,604 INFO  L231             Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow
[2024-03-09 05:46:08,604 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-09 05:46:08,605 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places.
[2024-03-09 05:46:08,605 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow
[2024-03-09 05:46:08,606 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-09 05:46:08,606 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:08,606 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-09 05:46:08,606 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 05:46:08,606 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-09 05:46:08,607 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:08,607 INFO  L85        PathProgramCache]: Analyzing trace with hash 1962435246, now seen corresponding path program 1 times
[2024-03-09 05:46:08,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:08,608 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331560850]
[2024-03-09 05:46:08,608 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:08,608 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:08,620 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:08,640 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-09 05:46:08,640 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:08,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331560850]
[2024-03-09 05:46:08,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331560850] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:08,641 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:08,641 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:08,641 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221428522]
[2024-03-09 05:46:08,641 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:08,641 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:08,642 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:08,642 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:08,642 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:08,654 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198
[2024-03-09 05:46:08,655 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-09 05:46:08,655 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:08,655 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198
[2024-03-09 05:46:08,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:08,775 INFO  L124   PetriNetUnfolderBase]: 205/1519 cut-off events.
[2024-03-09 05:46:08,776 INFO  L125   PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES.
[2024-03-09 05:46:08,779 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-09 05:46:08,783 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 13 selfloop transitions, 2 changer transitions 4/234 dead transitions.
[2024-03-09 05:46:08,783 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 234 transitions, 737 flow
[2024-03-09 05:46:08,783 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:08,783 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:08,784 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions.
[2024-03-09 05:46:08,785 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2024-03-09 05:46:08,785 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 560 transitions.
[2024-03-09 05:46:08,785 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions.
[2024-03-09 05:46:08,785 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:08,785 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions.
[2024-03-09 05:46:08,787 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-09 05:46:08,788 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-09 05:46:08,788 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-09 05:46:08,788 INFO  L175             Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 560 transitions.
[2024-03-09 05:46:08,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 234 transitions, 737 flow
[2024-03-09 05:46:08,792 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 234 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:46:08,794 INFO  L231             Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow
[2024-03-09 05:46:08,794 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-09 05:46:08,795 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places.
[2024-03-09 05:46:08,795 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow
[2024-03-09 05:46:08,795 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-09 05:46:08,795 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:08,796 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-09 05:46:08,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 05:46:08,796 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-09 05:46:08,796 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:08,796 INFO  L85        PathProgramCache]: Analyzing trace with hash -1906226017, now seen corresponding path program 1 times
[2024-03-09 05:46:08,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:08,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703903738]
[2024-03-09 05:46:08,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:08,797 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:08,806 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:08,866 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-09 05:46:08,866 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:08,866 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703903738]
[2024-03-09 05:46:08,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703903738] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:08,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:08,867 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:46:08,867 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680188253]
[2024-03-09 05:46:08,867 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:08,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:46:08,868 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:08,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:46:08,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:46:08,907 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-09 05:46:08,908 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-09 05:46:08,908 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:08,908 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-09 05:46:08,908 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:09,046 INFO  L124   PetriNetUnfolderBase]: 200/1438 cut-off events.
[2024-03-09 05:46:09,047 INFO  L125   PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES.
[2024-03-09 05:46:09,050 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-09 05:46:09,054 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-09 05:46:09,055 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow
[2024-03-09 05:46:09,055 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:46:09,055 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:46:09,056 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-09 05:46:09,057 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-09 05:46:09,057 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,057 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,058 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:09,058 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,059 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-09 05:46:09,060 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-09 05:46:09,061 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-09 05:46:09,061 INFO  L175             Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions.
[2024-03-09 05:46:09,061 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow
[2024-03-09 05:46:09,064 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-09 05:46:09,067 INFO  L231             Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow
[2024-03-09 05:46:09,068 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-09 05:46:09,068 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places.
[2024-03-09 05:46:09,068 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow
[2024-03-09 05:46:09,069 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-09 05:46:09,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:09,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:46:09,069 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 05:46:09,069 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-09 05:46:09,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:09,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -448517900, now seen corresponding path program 1 times
[2024-03-09 05:46:09,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:09,071 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758986953]
[2024-03-09 05:46:09,071 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:09,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:09,084 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:09,153 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-09 05:46:09,154 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:09,154 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758986953]
[2024-03-09 05:46:09,155 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758986953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:09,155 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:09,155 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:46:09,155 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638500636]
[2024-03-09 05:46:09,155 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:09,156 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:46:09,156 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:09,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:46:09,157 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:46:09,220 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-09 05:46:09,221 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-09 05:46:09,221 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:09,221 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-09 05:46:09,221 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:09,357 INFO  L124   PetriNetUnfolderBase]: 199/1436 cut-off events.
[2024-03-09 05:46:09,357 INFO  L125   PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES.
[2024-03-09 05:46:09,360 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-09 05:46:09,364 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-09 05:46:09,364 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow
[2024-03-09 05:46:09,364 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:46:09,364 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:46:09,365 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2024-03-09 05:46:09,366 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9305555555555556
[2024-03-09 05:46:09,366 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2024-03-09 05:46:09,366 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2024-03-09 05:46:09,367 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:09,367 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2024-03-09 05:46:09,368 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-09 05:46:09,369 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-09 05:46:09,370 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-09 05:46:09,370 INFO  L175             Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions.
[2024-03-09 05:46:09,370 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow
[2024-03-09 05:46:09,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:46:09,375 INFO  L231             Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow
[2024-03-09 05:46:09,375 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-09 05:46:09,376 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places.
[2024-03-09 05:46:09,376 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow
[2024-03-09 05:46:09,376 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-09 05:46:09,377 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:09,377 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-09 05:46:09,377 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 05:46:09,377 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-09 05:46:09,377 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:09,377 INFO  L85        PathProgramCache]: Analyzing trace with hash 1105825585, now seen corresponding path program 1 times
[2024-03-09 05:46:09,378 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:09,378 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78770822]
[2024-03-09 05:46:09,378 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:09,378 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:09,396 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:09,455 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-09 05:46:09,455 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:09,456 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78770822]
[2024-03-09 05:46:09,456 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78770822] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:09,456 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:09,456 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:46:09,457 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397478491]
[2024-03-09 05:46:09,457 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:09,457 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:46:09,458 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:09,458 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:46:09,458 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:46:09,515 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-09 05:46:09,515 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-09 05:46:09,516 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:09,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-09 05:46:09,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:09,650 INFO  L124   PetriNetUnfolderBase]: 198/1434 cut-off events.
[2024-03-09 05:46:09,651 INFO  L125   PetriNetUnfolderBase]: For 134/134 co-relation queries the response was YES.
[2024-03-09 05:46:09,654 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-09 05:46:09,657 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-03-09 05:46:09,657 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow
[2024-03-09 05:46:09,658 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:46:09,658 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:46:09,659 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-03-09 05:46:09,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-03-09 05:46:09,660 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,660 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,660 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:09,661 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-03-09 05:46:09,662 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-09 05:46:09,663 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-09 05:46:09,663 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-09 05:46:09,663 INFO  L175             Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions.
[2024-03-09 05:46:09,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow
[2024-03-09 05:46:09,666 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:46:09,668 INFO  L231             Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow
[2024-03-09 05:46:09,669 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-09 05:46:09,669 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places.
[2024-03-09 05:46:09,669 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow
[2024-03-09 05:46:09,670 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-09 05:46:09,670 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:09,670 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-09 05:46:09,670 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-09 05:46:09,670 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-09 05:46:09,671 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:09,671 INFO  L85        PathProgramCache]: Analyzing trace with hash -949863044, now seen corresponding path program 1 times
[2024-03-09 05:46:09,671 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:09,671 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234708090]
[2024-03-09 05:46:09,671 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:09,671 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:09,679 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:09,724 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-09 05:46:09,724 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:09,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234708090]
[2024-03-09 05:46:09,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234708090] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:09,725 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:09,726 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:46:09,726 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017353621]
[2024-03-09 05:46:09,726 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:09,727 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:46:09,727 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:09,728 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:46:09,728 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:46:09,766 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198
[2024-03-09 05:46:09,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-09 05:46:09,767 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:09,767 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198
[2024-03-09 05:46:09,767 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:09,925 INFO  L124   PetriNetUnfolderBase]: 201/1436 cut-off events.
[2024-03-09 05:46:09,925 INFO  L125   PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES.
[2024-03-09 05:46:09,929 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-09 05:46:09,933 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-03-09 05:46:09,933 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow
[2024-03-09 05:46:09,934 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:46:09,934 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:46:09,935 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions.
[2024-03-09 05:46:09,935 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267676767676768
[2024-03-09 05:46:09,935 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 734 transitions.
[2024-03-09 05:46:09,935 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions.
[2024-03-09 05:46:09,936 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:09,936 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions.
[2024-03-09 05:46:09,937 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-09 05:46:09,938 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-09 05:46:09,939 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-09 05:46:09,939 INFO  L175             Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions.
[2024-03-09 05:46:09,939 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow
[2024-03-09 05:46:09,942 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:46:09,944 INFO  L231             Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow
[2024-03-09 05:46:09,945 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-09 05:46:09,945 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places.
[2024-03-09 05:46:09,946 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow
[2024-03-09 05:46:09,946 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-09 05:46:09,946 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:09,946 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-09 05:46:09,946 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-09 05:46:09,946 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-09 05:46:09,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:09,947 INFO  L85        PathProgramCache]: Analyzing trace with hash 1442556267, now seen corresponding path program 1 times
[2024-03-09 05:46:09,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:09,947 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71107820]
[2024-03-09 05:46:09,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:09,947 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:09,956 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:09,972 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-09 05:46:09,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:09,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71107820]
[2024-03-09 05:46:09,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71107820] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:09,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:09,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:09,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992571403]
[2024-03-09 05:46:09,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:09,974 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:09,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:09,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:09,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:10,001 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-03-09 05:46:10,002 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-09 05:46:10,002 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:10,002 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-03-09 05:46:10,002 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:10,137 INFO  L124   PetriNetUnfolderBase]: 223/1511 cut-off events.
[2024-03-09 05:46:10,137 INFO  L125   PetriNetUnfolderBase]: For 187/196 co-relation queries the response was YES.
[2024-03-09 05:46:10,141 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-09 05:46:10,145 INFO  L140   encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions.
[2024-03-09 05:46:10,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow
[2024-03-09 05:46:10,146 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:10,146 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:10,147 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions.
[2024-03-09 05:46:10,148 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9343434343434344
[2024-03-09 05:46:10,148 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 555 transitions.
[2024-03-09 05:46:10,148 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions.
[2024-03-09 05:46:10,148 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:10,148 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions.
[2024-03-09 05:46:10,149 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-09 05:46:10,150 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-09 05:46:10,151 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-09 05:46:10,151 INFO  L175             Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions.
[2024-03-09 05:46:10,151 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow
[2024-03-09 05:46:10,154 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:46:10,156 INFO  L231             Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow
[2024-03-09 05:46:10,156 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-09 05:46:10,157 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places.
[2024-03-09 05:46:10,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow
[2024-03-09 05:46:10,157 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-09 05:46:10,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:10,158 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-09 05:46:10,158 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-09 05:46:10,158 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-09 05:46:10,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:10,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -481296020, now seen corresponding path program 1 times
[2024-03-09 05:46:10,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:10,159 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721112706]
[2024-03-09 05:46:10,159 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:10,159 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:10,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:10,459 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-09 05:46:10,459 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:10,459 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721112706]
[2024-03-09 05:46:10,459 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721112706] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:10,459 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:10,459 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:46:10,460 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730512947]
[2024-03-09 05:46:10,460 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:10,460 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:46:10,460 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:10,461 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:46:10,461 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:46:10,590 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198
[2024-03-09 05:46:10,591 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-09 05:46:10,591 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:10,591 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198
[2024-03-09 05:46:10,591 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:10,976 INFO  L124   PetriNetUnfolderBase]: 567/2728 cut-off events.
[2024-03-09 05:46:10,976 INFO  L125   PetriNetUnfolderBase]: For 664/719 co-relation queries the response was YES.
[2024-03-09 05:46:10,981 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-09 05:46:10,988 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 64 selfloop transitions, 83 changer transitions 0/326 dead transitions.
[2024-03-09 05:46:10,989 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 326 transitions, 1428 flow
[2024-03-09 05:46:10,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:46:10,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:46:10,991 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions.
[2024-03-09 05:46:10,992 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9065656565656566
[2024-03-09 05:46:10,992 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions.
[2024-03-09 05:46:10,992 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions.
[2024-03-09 05:46:10,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:10,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions.
[2024-03-09 05:46:10,994 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-09 05:46:10,996 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-09 05:46:10,997 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-09 05:46:10,997 INFO  L175             Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 6 states and 1077 transitions.
[2024-03-09 05:46:10,997 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 326 transitions, 1428 flow
[2024-03-09 05:46:11,001 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 326 transitions, 1414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:46:11,006 INFO  L231             Difference]: Finished difference. Result has 224 places, 318 transitions, 1504 flow
[2024-03-09 05:46:11,006 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-09 05:46:11,006 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 34 predicate places.
[2024-03-09 05:46:11,007 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 318 transitions, 1504 flow
[2024-03-09 05:46:11,007 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-09 05:46:11,007 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:11,007 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-09 05:46:11,007 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-09 05:46:11,008 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-09 05:46:11,008 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:11,008 INFO  L85        PathProgramCache]: Analyzing trace with hash 7104340, now seen corresponding path program 1 times
[2024-03-09 05:46:11,008 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:11,008 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039289336]
[2024-03-09 05:46:11,008 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:11,009 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:11,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:11,321 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-09 05:46:11,322 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:11,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039289336]
[2024-03-09 05:46:11,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039289336] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:11,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:11,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:46:11,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086163208]
[2024-03-09 05:46:11,323 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:11,323 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:46:11,323 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:11,323 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:46:11,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:46:11,500 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198
[2024-03-09 05:46:11,502 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-09 05:46:11,502 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:11,502 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198
[2024-03-09 05:46:11,502 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:11,804 INFO  L124   PetriNetUnfolderBase]: 520/2369 cut-off events.
[2024-03-09 05:46:11,804 INFO  L125   PetriNetUnfolderBase]: For 1360/1387 co-relation queries the response was YES.
[2024-03-09 05:46:11,809 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-09 05:46:11,815 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 43 changer transitions 12/366 dead transitions.
[2024-03-09 05:46:11,815 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 366 transitions, 2003 flow
[2024-03-09 05:46:11,816 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:46:11,816 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:46:11,818 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions.
[2024-03-09 05:46:11,819 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-03-09 05:46:11,819 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions.
[2024-03-09 05:46:11,819 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions.
[2024-03-09 05:46:11,819 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:11,819 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions.
[2024-03-09 05:46:11,821 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-09 05:46:11,823 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-09 05:46:11,823 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-09 05:46:11,823 INFO  L175             Difference]: Start difference. First operand has 224 places, 318 transitions, 1504 flow. Second operand 6 states and 1080 transitions.
[2024-03-09 05:46:11,824 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 366 transitions, 2003 flow
[2024-03-09 05:46:11,832 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 366 transitions, 1949 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 05:46:11,836 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 1907 flow
[2024-03-09 05:46:11,836 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-09 05:46:11,836 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 44 predicate places.
[2024-03-09 05:46:11,837 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 1907 flow
[2024-03-09 05:46:11,837 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-09 05:46:11,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:11,837 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-09 05:46:11,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 05:46:11,838 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-09 05:46:11,838 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:11,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -1630577086, now seen corresponding path program 1 times
[2024-03-09 05:46:11,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:11,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468924654]
[2024-03-09 05:46:11,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:11,839 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:11,861 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:12,250 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-09 05:46:12,250 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:12,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468924654]
[2024-03-09 05:46:12,251 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468924654] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:12,251 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:12,251 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:46:12,251 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615521418]
[2024-03-09 05:46:12,251 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:12,252 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:46:12,252 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:12,252 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:46:12,253 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:46:12,612 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198
[2024-03-09 05:46:12,613 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-09 05:46:12,614 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:12,614 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198
[2024-03-09 05:46:12,614 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:13,420 INFO  L124   PetriNetUnfolderBase]: 624/2784 cut-off events.
[2024-03-09 05:46:13,420 INFO  L125   PetriNetUnfolderBase]: For 2186/2398 co-relation queries the response was YES.
[2024-03-09 05:46:13,427 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-09 05:46:13,434 INFO  L140   encePairwiseOnDemand]: 182/198 looper letters, 220 selfloop transitions, 73 changer transitions 1/462 dead transitions.
[2024-03-09 05:46:13,434 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 462 transitions, 3201 flow
[2024-03-09 05:46:13,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 05:46:13,438 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 05:46:13,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1839 transitions.
[2024-03-09 05:46:13,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8443526170798898
[2024-03-09 05:46:13,441 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1839 transitions.
[2024-03-09 05:46:13,441 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1839 transitions.
[2024-03-09 05:46:13,442 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:13,443 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1839 transitions.
[2024-03-09 05:46:13,447 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-09 05:46:13,451 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-09 05:46:13,451 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-09 05:46:13,452 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 1907 flow. Second operand 11 states and 1839 transitions.
[2024-03-09 05:46:13,452 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 462 transitions, 3201 flow
[2024-03-09 05:46:13,464 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 462 transitions, 3165 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-09 05:46:13,469 INFO  L231             Difference]: Finished difference. Result has 246 places, 374 transitions, 2339 flow
[2024-03-09 05:46:13,469 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-09 05:46:13,470 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places.
[2024-03-09 05:46:13,470 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 374 transitions, 2339 flow
[2024-03-09 05:46:13,471 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-09 05:46:13,471 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:13,471 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-09 05:46:13,471 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-03-09 05:46:13,471 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-09 05:46:13,471 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:13,471 INFO  L85        PathProgramCache]: Analyzing trace with hash -843954482, now seen corresponding path program 1 times
[2024-03-09 05:46:13,472 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:13,472 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108871028]
[2024-03-09 05:46:13,472 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:13,472 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:13,495 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:13,864 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-09 05:46:13,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:13,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108871028]
[2024-03-09 05:46:13,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108871028] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:13,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:13,866 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:46:13,866 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948829370]
[2024-03-09 05:46:13,866 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:13,867 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:46:13,867 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:13,868 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:46:13,868 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:46:14,221 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 198
[2024-03-09 05:46:14,222 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-09 05:46:14,223 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:14,223 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 198
[2024-03-09 05:46:14,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:14,673 INFO  L124   PetriNetUnfolderBase]: 533/2461 cut-off events.
[2024-03-09 05:46:14,673 INFO  L125   PetriNetUnfolderBase]: For 3895/4124 co-relation queries the response was YES.
[2024-03-09 05:46:14,683 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-09 05:46:14,690 INFO  L140   encePairwiseOnDemand]: 186/198 looper letters, 161 selfloop transitions, 18 changer transitions 1/382 dead transitions.
[2024-03-09 05:46:14,690 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 382 transitions, 2757 flow
[2024-03-09 05:46:14,691 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:46:14,691 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:46:14,693 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1627 transitions.
[2024-03-09 05:46:14,693 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8217171717171717
[2024-03-09 05:46:14,693 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1627 transitions.
[2024-03-09 05:46:14,694 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1627 transitions.
[2024-03-09 05:46:14,694 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:14,694 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1627 transitions.
[2024-03-09 05:46:14,697 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-09 05:46:14,699 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-09 05:46:14,700 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-09 05:46:14,700 INFO  L175             Difference]: Start difference. First operand has 246 places, 374 transitions, 2339 flow. Second operand 10 states and 1627 transitions.
[2024-03-09 05:46:14,700 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 382 transitions, 2757 flow
[2024-03-09 05:46:14,718 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 382 transitions, 2751 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:46:14,722 INFO  L231             Difference]: Finished difference. Result has 253 places, 375 transitions, 2405 flow
[2024-03-09 05:46:14,722 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-09 05:46:14,723 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places.
[2024-03-09 05:46:14,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 375 transitions, 2405 flow
[2024-03-09 05:46:14,724 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-09 05:46:14,724 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:14,724 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-09 05:46:14,724 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-03-09 05:46:14,725 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-09 05:46:14,725 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:14,725 INFO  L85        PathProgramCache]: Analyzing trace with hash 2091322874, now seen corresponding path program 1 times
[2024-03-09 05:46:14,725 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:14,725 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728759587]
[2024-03-09 05:46:14,725 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:14,726 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:14,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:14,770 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:46:14,770 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:14,770 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728759587]
[2024-03-09 05:46:14,770 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728759587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:14,771 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:46:14,771 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:46:14,771 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056559398]
[2024-03-09 05:46:14,771 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:14,771 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:46:14,772 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:14,772 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:46:14,772 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:46:14,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-03-09 05:46:14,789 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-09 05:46:14,789 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:14,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-03-09 05:46:14,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:15,060 INFO  L124   PetriNetUnfolderBase]: 492/2306 cut-off events.
[2024-03-09 05:46:15,061 INFO  L125   PetriNetUnfolderBase]: For 3298/3383 co-relation queries the response was YES.
[2024-03-09 05:46:15,069 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-09 05:46:15,073 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 20 selfloop transitions, 11 changer transitions 31/384 dead transitions.
[2024-03-09 05:46:15,073 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 384 transitions, 2499 flow
[2024-03-09 05:46:15,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:46:15,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:46:15,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2024-03-09 05:46:15,075 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9410774410774411
[2024-03-09 05:46:15,075 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2024-03-09 05:46:15,075 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2024-03-09 05:46:15,075 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:15,076 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2024-03-09 05:46:15,076 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-09 05:46:15,077 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-09 05:46:15,077 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-09 05:46:15,077 INFO  L175             Difference]: Start difference. First operand has 253 places, 375 transitions, 2405 flow. Second operand 3 states and 559 transitions.
[2024-03-09 05:46:15,078 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 384 transitions, 2499 flow
[2024-03-09 05:46:15,097 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 2463 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-09 05:46:15,100 INFO  L231             Difference]: Finished difference. Result has 252 places, 351 transitions, 2140 flow
[2024-03-09 05:46:15,101 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-09 05:46:15,101 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places.
[2024-03-09 05:46:15,101 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 351 transitions, 2140 flow
[2024-03-09 05:46:15,102 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-09 05:46:15,102 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:15,102 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-09 05:46:15,102 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-09 05:46:15,102 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-09 05:46:15,103 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:15,103 INFO  L85        PathProgramCache]: Analyzing trace with hash -1074967984, now seen corresponding path program 1 times
[2024-03-09 05:46:15,103 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:15,103 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935252788]
[2024-03-09 05:46:15,103 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:15,103 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:15,125 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:15,667 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-09 05:46:15,667 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:15,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935252788]
[2024-03-09 05:46:15,667 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935252788] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:15,667 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960371244]
[2024-03-09 05:46:15,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:15,668 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:15,668 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:15,671 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-09 05:46:15,678 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-09 05:46:15,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:15,824 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-09 05:46:15,832 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:15,877 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-09 05:46:15,910 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:46:15,911 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-09 05:46:16,000 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-09 05:46:16,000 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-09 05:46:16,378 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:46:16,379 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-09 05:46:16,453 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-09 05:46:16,479 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-09 05:46:16,488 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-09 05:46:16,503 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:16,504 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-09 05:46:16,526 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:16,526 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-09 05:46:16,559 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:46:16,570 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-09 05:46:16,570 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:16,570 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [960371244] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:16,570 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:16,571 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 19
[2024-03-09 05:46:16,571 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799741855]
[2024-03-09 05:46:16,571 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:16,572 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-09 05:46:16,572 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:16,573 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-09 05:46:16,573 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2024-03-09 05:46:17,157 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-09 05:46:17,159 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-09 05:46:17,159 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:17,159 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-09 05:46:17,159 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:18,252 INFO  L124   PetriNetUnfolderBase]: 821/3232 cut-off events.
[2024-03-09 05:46:18,253 INFO  L125   PetriNetUnfolderBase]: For 5924/6023 co-relation queries the response was YES.
[2024-03-09 05:46:18,261 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-09 05:46:18,267 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 272 selfloop transitions, 81 changer transitions 38/550 dead transitions.
[2024-03-09 05:46:18,267 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 550 transitions, 4722 flow
[2024-03-09 05:46:18,268 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 05:46:18,268 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 05:46:18,271 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2853 transitions.
[2024-03-09 05:46:18,272 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7583732057416268
[2024-03-09 05:46:18,272 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2853 transitions.
[2024-03-09 05:46:18,272 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2853 transitions.
[2024-03-09 05:46:18,273 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:18,273 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2853 transitions.
[2024-03-09 05:46:18,277 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-09 05:46:18,281 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-09 05:46:18,281 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-09 05:46:18,282 INFO  L175             Difference]: Start difference. First operand has 252 places, 351 transitions, 2140 flow. Second operand 19 states and 2853 transitions.
[2024-03-09 05:46:18,282 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 550 transitions, 4722 flow
[2024-03-09 05:46:18,306 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 550 transitions, 4689 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-03-09 05:46:18,311 INFO  L231             Difference]: Finished difference. Result has 269 places, 402 transitions, 3003 flow
[2024-03-09 05:46:18,311 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-09 05:46:18,311 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 79 predicate places.
[2024-03-09 05:46:18,312 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 402 transitions, 3003 flow
[2024-03-09 05:46:18,312 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-09 05:46:18,312 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:18,312 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-09 05:46:18,329 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 05:46:18,518 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-09 05:46:18,519 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-09 05:46:18,520 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:18,520 INFO  L85        PathProgramCache]: Analyzing trace with hash 439816372, now seen corresponding path program 2 times
[2024-03-09 05:46:18,520 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:18,521 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026032059]
[2024-03-09 05:46:18,521 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:18,521 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:18,561 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:19,239 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-09 05:46:19,240 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:19,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026032059]
[2024-03-09 05:46:19,240 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026032059] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:19,240 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [350570249]
[2024-03-09 05:46:19,240 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:46:19,240 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:19,241 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:19,242 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-09 05:46:19,243 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-09 05:46:19,391 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:46:19,391 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:46:19,393 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-09 05:46:19,400 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:19,425 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-09 05:46:19,497 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:46:19,498 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-09 05:46:19,843 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:46:19,843 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-09 05:46:19,895 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:19,895 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-09 05:46:19,915 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-09 05:46:19,959 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-09 05:46:20,023 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:20,023 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-09 05:46:20,190 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-09 05:46:20,238 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:20,239 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-09 05:46:20,276 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:46:20,276 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-09 05:46:20,339 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:20,340 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-09 05:46:20,359 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:20,360 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-09 05:46:20,387 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:20,388 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-09 05:46:20,425 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-09 05:46:20,432 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-09 05:46:20,433 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:20,433 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [350570249] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:20,433 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:20,433 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:46:20,433 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99764773]
[2024-03-09 05:46:20,433 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:20,434 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:46:20,434 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:20,435 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:46:20,435 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:46:21,539 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-09 05:46:21,540 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-09 05:46:21,540 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:21,540 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-09 05:46:21,541 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:23,325 INFO  L124   PetriNetUnfolderBase]: 783/3111 cut-off events.
[2024-03-09 05:46:23,325 INFO  L125   PetriNetUnfolderBase]: For 9085/9196 co-relation queries the response was YES.
[2024-03-09 05:46:23,337 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-09 05:46:23,344 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 270 selfloop transitions, 137 changer transitions 21/588 dead transitions.
[2024-03-09 05:46:23,345 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 588 transitions, 5417 flow
[2024-03-09 05:46:23,345 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 05:46:23,345 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 05:46:23,349 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 3794 transitions.
[2024-03-09 05:46:23,350 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7664646464646465
[2024-03-09 05:46:23,350 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 3794 transitions.
[2024-03-09 05:46:23,350 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 3794 transitions.
[2024-03-09 05:46:23,352 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:23,352 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 3794 transitions.
[2024-03-09 05:46:23,356 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-09 05:46:23,361 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-09 05:46:23,362 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-09 05:46:23,362 INFO  L175             Difference]: Start difference. First operand has 269 places, 402 transitions, 3003 flow. Second operand 25 states and 3794 transitions.
[2024-03-09 05:46:23,362 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 588 transitions, 5417 flow
[2024-03-09 05:46:23,396 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 588 transitions, 5365 flow, removed 9 selfloop flow, removed 9 redundant places.
[2024-03-09 05:46:23,401 INFO  L231             Difference]: Finished difference. Result has 288 places, 456 transitions, 3986 flow
[2024-03-09 05:46:23,402 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-09 05:46:23,402 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 98 predicate places.
[2024-03-09 05:46:23,402 INFO  L495      AbstractCegarLoop]: Abstraction has has 288 places, 456 transitions, 3986 flow
[2024-03-09 05:46:23,403 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-09 05:46:23,403 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:23,403 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-09 05:46:23,411 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-09 05:46:23,603 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-09 05:46:23,606 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-09 05:46:23,606 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:23,607 INFO  L85        PathProgramCache]: Analyzing trace with hash -588257106, now seen corresponding path program 3 times
[2024-03-09 05:46:23,607 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:23,607 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117648795]
[2024-03-09 05:46:23,607 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:23,607 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:23,642 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:24,365 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-09 05:46:24,365 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:24,365 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117648795]
[2024-03-09 05:46:24,366 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117648795] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:24,366 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171538481]
[2024-03-09 05:46:24,366 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:46:24,366 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:24,366 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:24,367 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-09 05:46:24,368 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-09 05:46:24,543 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:46:24,543 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:46:24,546 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-03-09 05:46:24,555 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:24,690 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-09 05:46:24,814 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:46:24,814 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-09 05:46:25,910 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:46:25,910 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-09 05:46:25,917 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:25,918 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-09 05:46:26,306 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:26,307 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-09 05:46:26,329 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:26,330 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-09 05:46:26,428 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-09 05:46:26,827 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-09 05:46:26,834 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-09 05:46:26,885 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-09 05:46:26,983 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-09 05:46:27,066 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-09 05:46:27,141 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:27,142 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-09 05:46:27,176 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:27,177 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-09 05:46:27,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:27,192 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-09 05:46:27,227 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:27,227 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-09 05:46:27,317 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-09 05:46:27,368 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-09 05:46:27,368 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:27,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171538481] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:27,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:27,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-03-09 05:46:27,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875811370]
[2024-03-09 05:46:27,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:27,369 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-03-09 05:46:27,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:27,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-03-09 05:46:27,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406
[2024-03-09 05:46:30,542 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 198
[2024-03-09 05:46:30,544 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-09 05:46:30,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:30,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 198
[2024-03-09 05:46:30,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:37,190 INFO  L124   PetriNetUnfolderBase]: 2506/9173 cut-off events.
[2024-03-09 05:46:37,191 INFO  L125   PetriNetUnfolderBase]: For 35994/36041 co-relation queries the response was YES.
[2024-03-09 05:46:37,223 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-09 05:46:37,245 INFO  L140   encePairwiseOnDemand]: 159/198 looper letters, 883 selfloop transitions, 238 changer transitions 28/1287 dead transitions.
[2024-03-09 05:46:37,245 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1287 transitions, 14874 flow
[2024-03-09 05:46:37,245 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. 
[2024-03-09 05:46:37,245 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 46 states.
[2024-03-09 05:46:37,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 5992 transitions.
[2024-03-09 05:46:37,250 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.65788317962231
[2024-03-09 05:46:37,251 INFO  L72            ComplementDD]: Start complementDD. Operand 46 states and 5992 transitions.
[2024-03-09 05:46:37,251 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 46 states and 5992 transitions.
[2024-03-09 05:46:37,252 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:37,252 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 46 states and 5992 transitions.
[2024-03-09 05:46:37,259 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-09 05:46:37,266 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-09 05:46:37,267 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-09 05:46:37,267 INFO  L175             Difference]: Start difference. First operand has 288 places, 456 transitions, 3986 flow. Second operand 46 states and 5992 transitions.
[2024-03-09 05:46:37,267 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1287 transitions, 14874 flow
[2024-03-09 05:46:37,411 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 1287 transitions, 14336 flow, removed 135 selfloop flow, removed 9 redundant places.
[2024-03-09 05:46:37,424 INFO  L231             Difference]: Finished difference. Result has 350 places, 672 transitions, 7438 flow
[2024-03-09 05:46:37,424 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-09 05:46:37,424 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 160 predicate places.
[2024-03-09 05:46:37,425 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 672 transitions, 7438 flow
[2024-03-09 05:46:37,425 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-09 05:46:37,425 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:37,425 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-09 05:46:37,432 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-09 05:46:37,626 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-09 05:46:37,627 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-09 05:46:37,628 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:37,628 INFO  L85        PathProgramCache]: Analyzing trace with hash -1016450842, now seen corresponding path program 1 times
[2024-03-09 05:46:37,628 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:37,628 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278430432]
[2024-03-09 05:46:37,629 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:37,629 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:37,654 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:38,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:46:38,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:38,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278430432]
[2024-03-09 05:46:38,161 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278430432] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:38,161 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041151197]
[2024-03-09 05:46:38,161 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:38,161 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:38,162 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:38,162 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-09 05:46:38,163 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-09 05:46:38,273 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:38,275 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-03-09 05:46:38,281 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:38,359 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-09 05:46:38,394 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:46:38,395 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-09 05:46:38,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:38,493 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:46:38,493 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-09 05:46:39,042 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:46:39,043 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-09 05:46:39,051 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-09 05:46:39,128 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:39,129 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-09 05:46:39,158 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:39,159 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-09 05:46:39,283 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-09 05:46:39,287 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-09 05:46:39,344 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-09 05:46:39,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-03-09 05:46:39,418 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-09 05:46:39,481 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-09 05:46:39,551 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-09 05:46:39,594 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-09 05:46:39,594 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:46:39,634 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-09 05:46:39,664 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-09 05:46:39,686 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-09 05:46:44,220 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-09 05:46:44,645 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-09 05:46:44,669 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-09 05:46:44,675 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-09 05:46:44,724 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-09 05:46:44,944 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-09 05:46:44,944 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041151197] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:46:44,944 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:46:44,944 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 46
[2024-03-09 05:46:44,944 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919678497]
[2024-03-09 05:46:44,945 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:46:44,945 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2024-03-09 05:46:44,946 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:44,947 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2024-03-09 05:46:44,947 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1599, Unknown=20, NotChecked=340, Total=2162
[2024-03-09 05:46:45,385 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 198
[2024-03-09 05:46:45,387 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 672 transitions, 7438 flow. Second operand  has 47 states, 47 states have (on average 109.12765957446808) internal successors, (5129), 47 states have internal predecessors, (5129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:46:45,387 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:45,387 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 198
[2024-03-09 05:46:45,387 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:46:50,714 INFO  L124   PetriNetUnfolderBase]: 2548/9958 cut-off events.
[2024-03-09 05:46:50,714 INFO  L125   PetriNetUnfolderBase]: For 57415/57430 co-relation queries the response was YES.
[2024-03-09 05:46:50,761 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38988 conditions, 9958 events. 2548/9958 cut-off events. For 57415/57430 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 105905 event pairs, 296 based on Foata normal form. 65/9649 useless extension candidates. Maximal degree in co-relation 38232. Up to 1338 conditions per place. 
[2024-03-09 05:46:50,777 INFO  L140   encePairwiseOnDemand]: 167/198 looper letters, 295 selfloop transitions, 103 changer transitions 366/917 dead transitions.
[2024-03-09 05:46:50,777 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 374 places, 917 transitions, 12103 flow
[2024-03-09 05:46:50,777 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-03-09 05:46:50,777 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-03-09 05:46:50,779 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3182 transitions.
[2024-03-09 05:46:50,780 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.573953823953824
[2024-03-09 05:46:50,780 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 3182 transitions.
[2024-03-09 05:46:50,780 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 3182 transitions.
[2024-03-09 05:46:50,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:46:50,781 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3182 transitions.
[2024-03-09 05:46:50,784 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-09 05:46:50,788 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-09 05:46:50,788 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-09 05:46:50,788 INFO  L175             Difference]: Start difference. First operand has 350 places, 672 transitions, 7438 flow. Second operand 28 states and 3182 transitions.
[2024-03-09 05:46:50,788 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 374 places, 917 transitions, 12103 flow
[2024-03-09 05:46:51,077 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 917 transitions, 11836 flow, removed 112 selfloop flow, removed 11 redundant places.
[2024-03-09 05:46:51,085 INFO  L231             Difference]: Finished difference. Result has 364 places, 440 transitions, 3601 flow
[2024-03-09 05:46:51,086 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=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=3601, PETRI_PLACES=364, PETRI_TRANSITIONS=440}
[2024-03-09 05:46:51,086 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 174 predicate places.
[2024-03-09 05:46:51,086 INFO  L495      AbstractCegarLoop]: Abstraction has has 364 places, 440 transitions, 3601 flow
[2024-03-09 05:46:51,087 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 109.12765957446808) internal successors, (5129), 47 states have internal predecessors, (5129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:46:51,087 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:46:51,087 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-09 05:46:51,094 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-09 05:46:51,287 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-09 05:46:51,288 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-09 05:46:51,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:46:51,289 INFO  L85        PathProgramCache]: Analyzing trace with hash 1033066848, now seen corresponding path program 4 times
[2024-03-09 05:46:51,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:46:51,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040113255]
[2024-03-09 05:46:51,290 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:46:51,290 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:46:51,314 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:46:52,028 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-09 05:46:52,028 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:46:52,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040113255]
[2024-03-09 05:46:52,028 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040113255] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:46:52,028 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044095953]
[2024-03-09 05:46:52,028 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 05:46:52,028 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:46:52,029 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:46:52,030 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-09 05:46:52,031 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-09 05:46:52,240 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 05:46:52,240 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:46:52,242 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 55 conjunts are in the unsatisfiable core
[2024-03-09 05:46:52,247 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:46:52,296 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-09 05:46:52,405 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:46:52,406 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-09 05:46:53,339 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-09 05:46:53,339 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-09 05:46:53,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:53,659 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-09 05:46:53,799 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-09 05:46:53,878 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-09 05:46:53,963 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-09 05:46:54,030 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:54,031 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-09 05:46:54,063 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-09 05:46:54,146 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:54,147 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-09 05:46:54,174 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:54,175 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-09 05:46:54,199 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:46:54,200 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-09 05:46:54,251 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-09 05:46:54,349 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-09 05:46:54,412 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-09 05:46:54,412 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:46:54,412 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044095953] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:46:54,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:46:54,413 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [15] total 32
[2024-03-09 05:46:54,413 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216236319]
[2024-03-09 05:46:54,413 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:46:54,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 19 states
[2024-03-09 05:46:54,414 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:46:54,414 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants.
[2024-03-09 05:46:54,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=936, Unknown=0, NotChecked=0, Total=1056
[2024-03-09 05:46:56,441 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 137 out of 198
[2024-03-09 05:46:56,443 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 364 places, 440 transitions, 3601 flow. Second operand  has 19 states, 19 states have (on average 138.94736842105263) internal successors, (2640), 19 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:46:56,443 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:46:56,443 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 198
[2024-03-09 05:46:56,443 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:00,961 INFO  L124   PetriNetUnfolderBase]: 1621/6725 cut-off events.
[2024-03-09 05:47:00,961 INFO  L125   PetriNetUnfolderBase]: For 27255/27428 co-relation queries the response was YES.
[2024-03-09 05:47:00,993 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22714 conditions, 6725 events. 1621/6725 cut-off events. For 27255/27428 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 65955 event pairs, 348 based on Foata normal form. 69/6507 useless extension candidates. Maximal degree in co-relation 22463. Up to 1316 conditions per place. 
[2024-03-09 05:47:01,004 INFO  L140   encePairwiseOnDemand]: 171/198 looper letters, 436 selfloop transitions, 122 changer transitions 105/817 dead transitions.
[2024-03-09 05:47:01,004 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 817 transitions, 8466 flow
[2024-03-09 05:47:01,004 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-09 05:47:01,004 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-09 05:47:01,006 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 5121 transitions.
[2024-03-09 05:47:01,007 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7389610389610389
[2024-03-09 05:47:01,007 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 5121 transitions.
[2024-03-09 05:47:01,007 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 5121 transitions.
[2024-03-09 05:47:01,008 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:01,008 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 5121 transitions.
[2024-03-09 05:47:01,013 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 146.31428571428572) internal successors, (5121), 35 states have internal predecessors, (5121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:01,017 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 198.0) internal successors, (7128), 36 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:01,018 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 198.0) internal successors, (7128), 36 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:01,018 INFO  L175             Difference]: Start difference. First operand has 364 places, 440 transitions, 3601 flow. Second operand 35 states and 5121 transitions.
[2024-03-09 05:47:01,018 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 817 transitions, 8466 flow
[2024-03-09 05:47:01,149 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 345 places, 817 transitions, 7406 flow, removed 363 selfloop flow, removed 38 redundant places.
[2024-03-09 05:47:01,156 INFO  L231             Difference]: Finished difference. Result has 350 places, 462 transitions, 3743 flow
[2024-03-09 05:47:01,156 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3138, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=104, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=3743, PETRI_PLACES=350, PETRI_TRANSITIONS=462}
[2024-03-09 05:47:01,157 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 160 predicate places.
[2024-03-09 05:47:01,157 INFO  L495      AbstractCegarLoop]: Abstraction has has 350 places, 462 transitions, 3743 flow
[2024-03-09 05:47:01,157 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 19 states, 19 states have (on average 138.94736842105263) internal successors, (2640), 19 states have internal predecessors, (2640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:01,157 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:01,157 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-09 05:47:01,166 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-03-09 05:47:01,358 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-09 05:47:01,359 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-09 05:47:01,359 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:01,360 INFO  L85        PathProgramCache]: Analyzing trace with hash -1151850115, now seen corresponding path program 1 times
[2024-03-09 05:47:01,360 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:01,360 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970349539]
[2024-03-09 05:47:01,360 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:01,360 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:01,387 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:02,144 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-09 05:47:02,144 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:02,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970349539]
[2024-03-09 05:47:02,144 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970349539] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:02,144 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [405324387]
[2024-03-09 05:47:02,145 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:02,145 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:02,145 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:02,146 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-09 05:47:02,147 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-09 05:47:02,269 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:02,270 INFO  L262         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-09 05:47:02,277 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:02,282 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-09 05:47:02,304 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-09 05:47:02,304 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-09 05:47:02,381 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:02,389 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:47:02,389 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-09 05:47:02,761 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:47:02,761 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-09 05:47:02,872 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:02,873 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-09 05:47:02,890 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-09 05:47:02,972 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-09 05:47:03,032 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-09 05:47:03,093 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:47:03,093 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-09 05:47:03,146 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:03,148 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35
[2024-03-09 05:47:03,189 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:47:03,189 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-09 05:47:03,261 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:03,262 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-09 05:47:03,291 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:03,293 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-09 05:47:03,321 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:03,322 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-09 05:47:03,370 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-09 05:47:03,383 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-09 05:47:03,383 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:47:03,383 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [405324387] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:03,383 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:47:03,383 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-03-09 05:47:03,383 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681812627]
[2024-03-09 05:47:03,383 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:03,384 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:47:03,384 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:03,384 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:47:03,385 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=556, Unknown=0, NotChecked=0, Total=650
[2024-03-09 05:47:04,629 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-03-09 05:47:04,630 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 462 transitions, 3743 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-09 05:47:04,630 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:04,630 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-03-09 05:47:04,630 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:06,758 INFO  L124   PetriNetUnfolderBase]: 1256/5841 cut-off events.
[2024-03-09 05:47:06,758 INFO  L125   PetriNetUnfolderBase]: For 18093/18230 co-relation queries the response was YES.
[2024-03-09 05:47:06,792 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 18292 conditions, 5841 events. 1256/5841 cut-off events. For 18093/18230 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 56616 event pairs, 200 based on Foata normal form. 44/5638 useless extension candidates. Maximal degree in co-relation 18113. Up to 618 conditions per place. 
[2024-03-09 05:47:06,803 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 213 selfloop transitions, 96 changer transitions 88/579 dead transitions.
[2024-03-09 05:47:06,803 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 579 transitions, 5588 flow
[2024-03-09 05:47:06,804 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-03-09 05:47:06,804 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-03-09 05:47:06,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2836 transitions.
[2024-03-09 05:47:06,806 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7538543328017012
[2024-03-09 05:47:06,806 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2836 transitions.
[2024-03-09 05:47:06,806 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2836 transitions.
[2024-03-09 05:47:06,806 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:06,806 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2836 transitions.
[2024-03-09 05:47:06,860 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 149.26315789473685) internal successors, (2836), 19 states have internal predecessors, (2836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:06,863 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-09 05:47:06,863 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-09 05:47:06,863 INFO  L175             Difference]: Start difference. First operand has 350 places, 462 transitions, 3743 flow. Second operand 19 states and 2836 transitions.
[2024-03-09 05:47:06,863 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 579 transitions, 5588 flow
[2024-03-09 05:47:06,933 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 579 transitions, 5177 flow, removed 105 selfloop flow, removed 32 redundant places.
[2024-03-09 05:47:06,939 INFO  L231             Difference]: Finished difference. Result has 336 places, 453 transitions, 3652 flow
[2024-03-09 05:47:06,939 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3437, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3652, PETRI_PLACES=336, PETRI_TRANSITIONS=453}
[2024-03-09 05:47:06,939 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 146 predicate places.
[2024-03-09 05:47:06,939 INFO  L495      AbstractCegarLoop]: Abstraction has has 336 places, 453 transitions, 3652 flow
[2024-03-09 05:47:06,940 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-09 05:47:06,940 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:06,940 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-09 05:47:06,947 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 05:47:07,141 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-09 05:47:07,142 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-09 05:47:07,142 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:07,143 INFO  L85        PathProgramCache]: Analyzing trace with hash 903457307, now seen corresponding path program 2 times
[2024-03-09 05:47:07,143 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:07,143 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943491135]
[2024-03-09 05:47:07,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:07,143 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:07,166 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:07,768 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-09 05:47:07,768 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:07,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943491135]
[2024-03-09 05:47:07,768 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943491135] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:07,768 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633119473]
[2024-03-09 05:47:07,768 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:47:07,768 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:07,768 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:07,770 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-09 05:47:07,771 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-09 05:47:07,960 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:47:07,961 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:47:07,962 INFO  L262         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-09 05:47:07,968 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:08,001 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-09 05:47:08,078 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:47:08,078 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-09 05:47:08,435 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:47:08,436 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-09 05:47:08,489 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:08,490 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-09 05:47:08,580 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-09 05:47:08,629 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-09 05:47:08,712 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-09 05:47:08,827 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:08,828 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 32 treesize of output 25
[2024-03-09 05:47:08,844 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:08,844 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 32 treesize of output 25
[2024-03-09 05:47:08,853 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:08,854 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 32 treesize of output 25
[2024-03-09 05:47:08,876 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:47:08,877 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 32 treesize of output 25
[2024-03-09 05:47:08,905 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:47:08,906 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-09 05:47:08,929 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:47:08,929 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-09 05:47:08,956 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-09 05:47:08,966 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-09 05:47:08,967 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:47:08,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [633119473] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:08,967 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:47:08,967 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 24
[2024-03-09 05:47:08,967 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064984493]
[2024-03-09 05:47:08,967 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:08,967 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:47:08,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:08,968 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:47:08,968 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600
[2024-03-09 05:47:10,116 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-03-09 05:47:10,117 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 453 transitions, 3652 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-09 05:47:10,118 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:10,118 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-03-09 05:47:10,118 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:12,309 INFO  L124   PetriNetUnfolderBase]: 1181/5654 cut-off events.
[2024-03-09 05:47:12,309 INFO  L125   PetriNetUnfolderBase]: For 17991/18128 co-relation queries the response was YES.
[2024-03-09 05:47:12,339 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 17290 conditions, 5654 events. 1181/5654 cut-off events. For 17991/18128 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 54818 event pairs, 193 based on Foata normal form. 68/5479 useless extension candidates. Maximal degree in co-relation 17213. Up to 539 conditions per place. 
[2024-03-09 05:47:12,348 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 147 selfloop transitions, 131 changer transitions 72/528 dead transitions.
[2024-03-09 05:47:12,349 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 528 transitions, 4921 flow
[2024-03-09 05:47:12,350 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 05:47:12,350 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 05:47:12,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3147 transitions.
[2024-03-09 05:47:12,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7568542568542569
[2024-03-09 05:47:12,355 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 3147 transitions.
[2024-03-09 05:47:12,355 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 3147 transitions.
[2024-03-09 05:47:12,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:12,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 3147 transitions.
[2024-03-09 05:47:12,361 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 149.85714285714286) internal successors, (3147), 21 states have internal predecessors, (3147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:12,366 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 198.0) internal successors, (4356), 22 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:12,366 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 198.0) internal successors, (4356), 22 states have internal predecessors, (4356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:47:12,366 INFO  L175             Difference]: Start difference. First operand has 336 places, 453 transitions, 3652 flow. Second operand 21 states and 3147 transitions.
[2024-03-09 05:47:12,367 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 528 transitions, 4921 flow
[2024-03-09 05:47:12,439 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 528 transitions, 4644 flow, removed 41 selfloop flow, removed 17 redundant places.
[2024-03-09 05:47:12,444 INFO  L231             Difference]: Finished difference. Result has 339 places, 412 transitions, 3351 flow
[2024-03-09 05:47:12,444 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3399, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=131, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3351, PETRI_PLACES=339, PETRI_TRANSITIONS=412}
[2024-03-09 05:47:12,445 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 149 predicate places.
[2024-03-09 05:47:12,445 INFO  L495      AbstractCegarLoop]: Abstraction has has 339 places, 412 transitions, 3351 flow
[2024-03-09 05:47:12,445 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-09 05:47:12,445 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:12,445 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-09 05:47:12,453 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-09 05:47:12,646 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-09 05:47:12,647 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-09 05:47:12,648 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:12,648 INFO  L85        PathProgramCache]: Analyzing trace with hash -1439928990, now seen corresponding path program 1 times
[2024-03-09 05:47:12,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:12,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704264600]
[2024-03-09 05:47:12,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:12,648 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:12,668 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:12,710 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-09 05:47:12,710 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:12,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704264600]
[2024-03-09 05:47:12,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704264600] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:12,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:12,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-03-09 05:47:12,711 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848104170]
[2024-03-09 05:47:12,711 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:12,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:47:12,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:12,712 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:47:12,712 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:47:12,725 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198
[2024-03-09 05:47:12,726 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 412 transitions, 3351 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-09 05:47:12,726 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:12,726 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198
[2024-03-09 05:47:12,726 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:13,163 INFO  L124   PetriNetUnfolderBase]: 564/3257 cut-off events.
[2024-03-09 05:47:13,163 INFO  L125   PetriNetUnfolderBase]: For 10990/11063 co-relation queries the response was YES.
[2024-03-09 05:47:13,178 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9785 conditions, 3257 events. 564/3257 cut-off events. For 10990/11063 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 28062 event pairs, 44 based on Foata normal form. 11/3169 useless extension candidates. Maximal degree in co-relation 9721. Up to 400 conditions per place. 
[2024-03-09 05:47:13,184 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 3 selfloop transitions, 4 changer transitions 0/387 dead transitions.
[2024-03-09 05:47:13,184 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 387 transitions, 3231 flow
[2024-03-09 05:47:13,184 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:47:13,185 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:47:13,185 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions.
[2024-03-09 05:47:13,185 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9579124579124579
[2024-03-09 05:47:13,185 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 569 transitions.
[2024-03-09 05:47:13,185 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions.
[2024-03-09 05:47:13,186 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:13,186 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions.
[2024-03-09 05:47:13,186 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-09 05:47:13,187 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-09 05:47:13,187 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-09 05:47:13,187 INFO  L175             Difference]: Start difference. First operand has 339 places, 412 transitions, 3351 flow. Second operand 3 states and 569 transitions.
[2024-03-09 05:47:13,187 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 387 transitions, 3231 flow
[2024-03-09 05:47:13,233 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 387 transitions, 2917 flow, removed 27 selfloop flow, removed 28 redundant places.
[2024-03-09 05:47:13,237 INFO  L231             Difference]: Finished difference. Result has 287 places, 387 transitions, 2911 flow
[2024-03-09 05:47:13,237 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2903, PETRI_DIFFERENCE_MINUEND_PLACES=285, 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=2911, PETRI_PLACES=287, PETRI_TRANSITIONS=387}
[2024-03-09 05:47:13,237 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 97 predicate places.
[2024-03-09 05:47:13,238 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 387 transitions, 2911 flow
[2024-03-09 05:47:13,238 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-09 05:47:13,238 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:13,238 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-09 05:47:13,238 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-03-09 05:47:13,238 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-09 05:47:13,238 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:13,239 INFO  L85        PathProgramCache]: Analyzing trace with hash 1699963355, now seen corresponding path program 1 times
[2024-03-09 05:47:13,239 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:13,239 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506764307]
[2024-03-09 05:47:13,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:13,239 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:13,261 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:13,330 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-09 05:47:13,330 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:13,330 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506764307]
[2024-03-09 05:47:13,330 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506764307] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:13,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650295191]
[2024-03-09 05:47:13,331 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:13,331 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:13,331 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:13,332 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-09 05:47:13,333 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-09 05:47:13,478 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:13,479 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 05:47:13,482 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:13,550 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-09 05:47:13,550 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:47:13,637 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-09 05:47:13,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650295191] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:47:13,637 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:47:13,638 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-03-09 05:47:13,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67629323]
[2024-03-09 05:47:13,638 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:47:13,639 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 05:47:13,640 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:13,640 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 05:47:13,640 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 05:47:13,773 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 198
[2024-03-09 05:47:13,774 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 387 transitions, 2911 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-09 05:47:13,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:13,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 198
[2024-03-09 05:47:13,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:14,073 INFO  L124   PetriNetUnfolderBase]: 406/2196 cut-off events.
[2024-03-09 05:47:14,073 INFO  L125   PetriNetUnfolderBase]: For 4890/4951 co-relation queries the response was YES.
[2024-03-09 05:47:14,082 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5856 conditions, 2196 events. 406/2196 cut-off events. For 4890/4951 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 16334 event pairs, 28 based on Foata normal form. 17/2145 useless extension candidates. Maximal degree in co-relation 5801. Up to 204 conditions per place. 
[2024-03-09 05:47:14,086 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 16 selfloop transitions, 11 changer transitions 3/306 dead transitions.
[2024-03-09 05:47:14,086 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 306 transitions, 2206 flow
[2024-03-09 05:47:14,087 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-03-09 05:47:14,087 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-03-09 05:47:14,087 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions.
[2024-03-09 05:47:14,088 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9011544011544012
[2024-03-09 05:47:14,088 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions.
[2024-03-09 05:47:14,088 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions.
[2024-03-09 05:47:14,088 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:14,088 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions.
[2024-03-09 05:47:14,089 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-09 05:47:14,090 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-09 05:47:14,091 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-09 05:47:14,091 INFO  L175             Difference]: Start difference. First operand has 287 places, 387 transitions, 2911 flow. Second operand 7 states and 1249 transitions.
[2024-03-09 05:47:14,091 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 306 transitions, 2206 flow
[2024-03-09 05:47:14,110 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 306 transitions, 1968 flow, removed 8 selfloop flow, removed 12 redundant places.
[2024-03-09 05:47:14,113 INFO  L231             Difference]: Finished difference. Result has 253 places, 297 transitions, 1904 flow
[2024-03-09 05:47:14,113 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1882, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1904, PETRI_PLACES=253, PETRI_TRANSITIONS=297}
[2024-03-09 05:47:14,113 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places.
[2024-03-09 05:47:14,114 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 297 transitions, 1904 flow
[2024-03-09 05:47:14,114 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-09 05:47:14,114 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:14,114 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-09 05:47:14,121 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0
[2024-03-09 05:47:14,315 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-09 05:47:14,315 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-09 05:47:14,316 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:14,316 INFO  L85        PathProgramCache]: Analyzing trace with hash -366618917, now seen corresponding path program 1 times
[2024-03-09 05:47:14,316 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:14,316 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173908292]
[2024-03-09 05:47:14,316 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:14,317 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:14,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:14,416 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-09 05:47:14,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:14,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173908292]
[2024-03-09 05:47:14,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173908292] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:14,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787262157]
[2024-03-09 05:47:14,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:14,417 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:14,417 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:14,418 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-09 05:47:14,419 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-09 05:47:14,566 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:14,567 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-03-09 05:47:14,569 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:14,711 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-09 05:47:14,711 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:47:14,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [787262157] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:14,712 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:47:14,712 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-03-09 05:47:14,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295139688]
[2024-03-09 05:47:14,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:14,712 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-03-09 05:47:14,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:14,713 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-03-09 05:47:14,713 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:47:14,803 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198
[2024-03-09 05:47:14,804 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 297 transitions, 1904 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-09 05:47:14,804 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:14,804 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198
[2024-03-09 05:47:14,804 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:15,138 INFO  L124   PetriNetUnfolderBase]: 377/2134 cut-off events.
[2024-03-09 05:47:15,138 INFO  L125   PetriNetUnfolderBase]: For 3783/3825 co-relation queries the response was YES.
[2024-03-09 05:47:15,147 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5350 conditions, 2134 events. 377/2134 cut-off events. For 3783/3825 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15695 event pairs, 28 based on Foata normal form. 22/2096 useless extension candidates. Maximal degree in co-relation 5301. Up to 184 conditions per place. 
[2024-03-09 05:47:15,178 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 32 selfloop transitions, 16 changer transitions 0/320 dead transitions.
[2024-03-09 05:47:15,179 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 320 transitions, 2065 flow
[2024-03-09 05:47:15,179 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 05:47:15,179 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 05:47:15,180 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1940 transitions.
[2024-03-09 05:47:15,181 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8907254361799817
[2024-03-09 05:47:15,181 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1940 transitions.
[2024-03-09 05:47:15,181 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1940 transitions.
[2024-03-09 05:47:15,181 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:15,181 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1940 transitions.
[2024-03-09 05:47:15,183 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-09 05:47:15,184 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-09 05:47:15,185 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-09 05:47:15,185 INFO  L175             Difference]: Start difference. First operand has 253 places, 297 transitions, 1904 flow. Second operand 11 states and 1940 transitions.
[2024-03-09 05:47:15,185 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 320 transitions, 2065 flow
[2024-03-09 05:47:15,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 320 transitions, 2025 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-09 05:47:15,202 INFO  L231             Difference]: Finished difference. Result has 262 places, 307 transitions, 1956 flow
[2024-03-09 05:47:15,203 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1956, PETRI_PLACES=262, PETRI_TRANSITIONS=307}
[2024-03-09 05:47:15,203 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 72 predicate places.
[2024-03-09 05:47:15,203 INFO  L495      AbstractCegarLoop]: Abstraction has has 262 places, 307 transitions, 1956 flow
[2024-03-09 05:47:15,203 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-09 05:47:15,203 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:15,204 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-09 05:47:15,212 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 05:47:15,404 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-09 05:47:15,405 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-09 05:47:15,405 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:15,405 INFO  L85        PathProgramCache]: Analyzing trace with hash 1272306485, now seen corresponding path program 1 times
[2024-03-09 05:47:15,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:15,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679166697]
[2024-03-09 05:47:15,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:15,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:15,426 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:15,513 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-09 05:47:15,513 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:15,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679166697]
[2024-03-09 05:47:15,513 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679166697] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:47:15,513 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248474696]
[2024-03-09 05:47:15,513 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:15,513 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:47:15,514 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:47:15,514 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-09 05:47:15,519 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-09 05:47:15,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:15,654 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-03-09 05:47:15,656 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:47:15,824 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-09 05:47:15,824 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:47:16,049 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-09 05:47:16,049 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [248474696] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:47:16,049 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:47:16,050 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-03-09 05:47:16,050 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229572673]
[2024-03-09 05:47:16,050 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:47:16,050 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-03-09 05:47:16,050 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:16,051 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-03-09 05:47:16,051 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-03-09 05:47:16,264 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198
[2024-03-09 05:47:16,266 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 307 transitions, 1956 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-09 05:47:16,266 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:16,266 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198
[2024-03-09 05:47:16,266 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:16,660 INFO  L124   PetriNetUnfolderBase]: 421/2321 cut-off events.
[2024-03-09 05:47:16,660 INFO  L125   PetriNetUnfolderBase]: For 4558/4610 co-relation queries the response was YES.
[2024-03-09 05:47:16,671 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6379 conditions, 2321 events. 421/2321 cut-off events. For 4558/4610 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 17685 event pairs, 30 based on Foata normal form. 20/2281 useless extension candidates. Maximal degree in co-relation 6325. Up to 237 conditions per place. 
[2024-03-09 05:47:16,675 INFO  L140   encePairwiseOnDemand]: 188/198 looper letters, 36 selfloop transitions, 15 changer transitions 0/328 dead transitions.
[2024-03-09 05:47:16,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 328 transitions, 2145 flow
[2024-03-09 05:47:16,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:47:16,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:47:16,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1783 transitions.
[2024-03-09 05:47:16,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9005050505050505
[2024-03-09 05:47:16,677 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1783 transitions.
[2024-03-09 05:47:16,677 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1783 transitions.
[2024-03-09 05:47:16,677 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:16,677 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1783 transitions.
[2024-03-09 05:47:16,679 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-09 05:47:16,680 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-09 05:47:16,680 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-09 05:47:16,680 INFO  L175             Difference]: Start difference. First operand has 262 places, 307 transitions, 1956 flow. Second operand 10 states and 1783 transitions.
[2024-03-09 05:47:16,680 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 328 transitions, 2145 flow
[2024-03-09 05:47:16,701 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 328 transitions, 2131 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-03-09 05:47:16,704 INFO  L231             Difference]: Finished difference. Result has 273 places, 317 transitions, 2053 flow
[2024-03-09 05:47:16,704 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1946, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2053, PETRI_PLACES=273, PETRI_TRANSITIONS=317}
[2024-03-09 05:47:16,704 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 83 predicate places.
[2024-03-09 05:47:16,704 INFO  L495      AbstractCegarLoop]: Abstraction has has 273 places, 317 transitions, 2053 flow
[2024-03-09 05:47:16,705 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-09 05:47:16,705 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:16,705 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-09 05:47:16,712 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-09 05:47:16,906 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-09 05:47:16,906 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-09 05:47:16,907 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:16,907 INFO  L85        PathProgramCache]: Analyzing trace with hash 902056160, now seen corresponding path program 1 times
[2024-03-09 05:47:16,907 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:16,907 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485761253]
[2024-03-09 05:47:16,907 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:16,908 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:16,940 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:47:16,940 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 05:47:16,953 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 05:47:16,979 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 05:47:16,979 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 05:47:16,980 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-03-09 05:47:16,981 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-03-09 05:47:16,982 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-03-09 05:47:16,982 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-03-09 05:47:16,982 INFO  L445         BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 05:47:16,984 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 05:47:16,984 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 05:47:17,003 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 05:47:17,006 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow
[2024-03-09 05:47:17,049 INFO  L124   PetriNetUnfolderBase]: 27/482 cut-off events.
[2024-03-09 05:47:17,050 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-09 05:47:17,051 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-09 05:47:17,051 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow
[2024-03-09 05:47:17,053 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow
[2024-03-09 05:47:17,054 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 05:47:17,055 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;@539dea3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-09 05:47:17,055 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-03-09 05:47:17,057 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-09 05:47:17,057 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-03-09 05:47:17,057 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-09 05:47:17,057 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:17,057 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-09 05:47:17,057 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-09 05:47:17,057 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:17,057 INFO  L85        PathProgramCache]: Analyzing trace with hash 1685596353, now seen corresponding path program 1 times
[2024-03-09 05:47:17,057 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:17,057 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523197806]
[2024-03-09 05:47:17,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:17,057 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:17,063 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:17,072 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-09 05:47:17,072 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:17,072 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523197806]
[2024-03-09 05:47:17,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523197806] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:17,072 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:17,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:47:17,072 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636125374]
[2024-03-09 05:47:17,072 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:17,072 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:47:17,072 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:17,073 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:47:17,073 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:47:17,096 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-09 05:47:17,097 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-09 05:47:17,097 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:17,097 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-09 05:47:17,097 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:17,313 INFO  L124   PetriNetUnfolderBase]: 237/2093 cut-off events.
[2024-03-09 05:47:17,314 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-03-09 05:47:17,320 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-09 05:47:17,325 INFO  L140   encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions.
[2024-03-09 05:47:17,325 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow
[2024-03-09 05:47:17,325 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:47:17,325 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:47:17,326 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions.
[2024-03-09 05:47:17,326 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-03-09 05:47:17,326 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 699 transitions.
[2024-03-09 05:47:17,326 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions.
[2024-03-09 05:47:17,326 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:17,327 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions.
[2024-03-09 05:47:17,327 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-09 05:47:17,328 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-09 05:47:17,328 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-09 05:47:17,328 INFO  L175             Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions.
[2024-03-09 05:47:17,328 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow
[2024-03-09 05:47:17,329 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:47:17,331 INFO  L231             Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow
[2024-03-09 05:47:17,331 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-09 05:47:17,331 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-09 05:47:17,332 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow
[2024-03-09 05:47:17,332 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-09 05:47:17,332 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:17,332 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-09 05:47:17,332 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-03-09 05:47:17,332 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-09 05:47:17,332 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:17,332 INFO  L85        PathProgramCache]: Analyzing trace with hash 2081762899, now seen corresponding path program 1 times
[2024-03-09 05:47:17,332 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:17,332 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848241421]
[2024-03-09 05:47:17,332 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:17,332 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:17,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:17,348 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:47:17,348 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:17,348 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848241421]
[2024-03-09 05:47:17,348 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848241421] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:17,348 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:17,348 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:47:17,348 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175077469]
[2024-03-09 05:47:17,348 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:17,349 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:47:17,349 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:17,349 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:47:17,349 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:47:17,376 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249
[2024-03-09 05:47:17,377 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-09 05:47:17,377 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:17,377 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249
[2024-03-09 05:47:17,377 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:17,931 INFO  L124   PetriNetUnfolderBase]: 1364/6164 cut-off events.
[2024-03-09 05:47:17,931 INFO  L125   PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES.
[2024-03-09 05:47:17,944 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-09 05:47:17,956 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions.
[2024-03-09 05:47:17,957 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow
[2024-03-09 05:47:17,958 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:47:17,958 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:47:17,958 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2024-03-09 05:47:17,958 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9491298527443106
[2024-03-09 05:47:17,958 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 709 transitions.
[2024-03-09 05:47:17,958 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions.
[2024-03-09 05:47:17,958 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:17,959 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions.
[2024-03-09 05:47:17,959 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-09 05:47:17,960 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-09 05:47:17,960 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-09 05:47:17,960 INFO  L175             Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions.
[2024-03-09 05:47:17,960 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow
[2024-03-09 05:47:17,961 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:47:17,963 INFO  L231             Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow
[2024-03-09 05:47:17,963 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-09 05:47:17,964 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-03-09 05:47:17,964 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow
[2024-03-09 05:47:17,964 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-09 05:47:17,964 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:17,964 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-09 05:47:17,964 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-03-09 05:47:17,964 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-09 05:47:17,964 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:17,964 INFO  L85        PathProgramCache]: Analyzing trace with hash -623349496, now seen corresponding path program 1 times
[2024-03-09 05:47:17,964 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:17,964 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621184663]
[2024-03-09 05:47:17,964 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:17,965 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:17,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:18,013 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-09 05:47:18,013 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:18,014 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621184663]
[2024-03-09 05:47:18,014 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621184663] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:18,014 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:18,014 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:47:18,014 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445797975]
[2024-03-09 05:47:18,014 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:18,014 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-09 05:47:18,014 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:18,014 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-09 05:47:18,014 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-09 05:47:18,080 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-09 05:47:18,081 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-09 05:47:18,081 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:18,081 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-09 05:47:18,081 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:18,638 INFO  L124   PetriNetUnfolderBase]: 864/5441 cut-off events.
[2024-03-09 05:47:18,638 INFO  L125   PetriNetUnfolderBase]: For 273/281 co-relation queries the response was YES.
[2024-03-09 05:47:18,657 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-09 05:47:18,671 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions.
[2024-03-09 05:47:18,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow
[2024-03-09 05:47:18,672 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:47:18,672 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:47:18,673 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions.
[2024-03-09 05:47:18,673 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210174029451138
[2024-03-09 05:47:18,673 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions.
[2024-03-09 05:47:18,674 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions.
[2024-03-09 05:47:18,674 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:18,674 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions.
[2024-03-09 05:47:18,675 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-09 05:47:18,676 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-09 05:47:18,676 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-09 05:47:18,676 INFO  L175             Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions.
[2024-03-09 05:47:18,676 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow
[2024-03-09 05:47:18,679 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:47:18,681 INFO  L231             Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow
[2024-03-09 05:47:18,681 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-09 05:47:18,682 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places.
[2024-03-09 05:47:18,682 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow
[2024-03-09 05:47:18,682 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-09 05:47:18,682 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:18,682 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-09 05:47:18,682 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-03-09 05:47:18,682 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-09 05:47:18,683 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:18,683 INFO  L85        PathProgramCache]: Analyzing trace with hash 993495992, now seen corresponding path program 1 times
[2024-03-09 05:47:18,683 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:18,683 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865867514]
[2024-03-09 05:47:18,683 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:18,683 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:18,691 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:18,816 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-09 05:47:18,816 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:18,816 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865867514]
[2024-03-09 05:47:18,816 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865867514] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:18,816 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:18,816 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:47:18,817 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916573505]
[2024-03-09 05:47:18,817 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:18,817 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:47:18,817 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:18,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:47:18,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:47:19,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249
[2024-03-09 05:47:19,039 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-09 05:47:19,039 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:19,039 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249
[2024-03-09 05:47:19,040 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:21,710 INFO  L124   PetriNetUnfolderBase]: 6503/26023 cut-off events.
[2024-03-09 05:47:21,711 INFO  L125   PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES.
[2024-03-09 05:47:21,763 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-09 05:47:21,812 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions.
[2024-03-09 05:47:21,812 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow
[2024-03-09 05:47:21,813 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:47:21,813 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:47:21,814 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions.
[2024-03-09 05:47:21,814 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9042838018741634
[2024-03-09 05:47:21,814 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions.
[2024-03-09 05:47:21,814 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions.
[2024-03-09 05:47:21,815 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:21,815 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions.
[2024-03-09 05:47:21,816 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-09 05:47:21,817 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-09 05:47:21,817 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-09 05:47:21,817 INFO  L175             Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions.
[2024-03-09 05:47:21,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow
[2024-03-09 05:47:21,820 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:47:21,822 INFO  L231             Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow
[2024-03-09 05:47:21,822 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-09 05:47:21,822 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-09 05:47:21,823 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow
[2024-03-09 05:47:21,823 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-09 05:47:21,823 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:21,823 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-09 05:47:21,823 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-03-09 05:47:21,823 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-09 05:47:21,823 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:21,823 INFO  L85        PathProgramCache]: Analyzing trace with hash 2041281070, now seen corresponding path program 1 times
[2024-03-09 05:47:21,823 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:21,823 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614600640]
[2024-03-09 05:47:21,823 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:21,824 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:21,832 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:21,843 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-09 05:47:21,843 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:21,843 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614600640]
[2024-03-09 05:47:21,843 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614600640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:21,843 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:21,843 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:47:21,843 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055745566]
[2024-03-09 05:47:21,844 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:21,844 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:47:21,844 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:21,844 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:47:21,844 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:47:21,859 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-09 05:47:21,860 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-09 05:47:21,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:21,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-09 05:47:21,860 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:22,385 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_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 29#L1061-6true, Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~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, 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-09 05:47:22,385 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:22,385 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:22,385 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:22,385 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,145 INFO  L124   PetriNetUnfolderBase]: 4821/23949 cut-off events.
[2024-03-09 05:47:24,146 INFO  L125   PetriNetUnfolderBase]: For 1626/1674 co-relation queries the response was YES.
[2024-03-09 05:47:24,208 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-09 05:47:24,258 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 20 selfloop transitions, 3 changer transitions 4/309 dead transitions.
[2024-03-09 05:47:24,258 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 309 transitions, 1017 flow
[2024-03-09 05:47:24,259 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:47:24,260 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:47:24,261 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions.
[2024-03-09 05:47:24,261 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384203480589023
[2024-03-09 05:47:24,261 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 701 transitions.
[2024-03-09 05:47:24,261 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions.
[2024-03-09 05:47:24,262 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:24,262 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions.
[2024-03-09 05:47:24,264 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-09 05:47:24,265 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-09 05:47:24,265 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-09 05:47:24,265 INFO  L175             Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 701 transitions.
[2024-03-09 05:47:24,265 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 309 transitions, 1017 flow
[2024-03-09 05:47:24,285 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 309 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:47:24,287 INFO  L231             Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow
[2024-03-09 05:47:24,288 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-09 05:47:24,288 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-03-09 05:47:24,288 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow
[2024-03-09 05:47:24,288 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-09 05:47:24,288 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:24,288 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-09 05:47:24,289 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-03-09 05:47:24,289 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-09 05:47:24,289 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:24,289 INFO  L85        PathProgramCache]: Analyzing trace with hash 1295096415, now seen corresponding path program 1 times
[2024-03-09 05:47:24,289 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:24,289 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878220040]
[2024-03-09 05:47:24,289 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:24,289 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:24,297 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:24,336 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-09 05:47:24,336 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:24,336 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878220040]
[2024-03-09 05:47:24,337 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878220040] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:24,337 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:24,337 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:47:24,337 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51491684]
[2024-03-09 05:47:24,337 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:24,337 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:47:24,338 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:24,338 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:47:24,338 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:47:24,419 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-09 05:47:24,420 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-09 05:47:24,420 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:24,420 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-09 05:47:24,420 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:24,959 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_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 29#L1061-6true, Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~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, 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-09 05:47:24,960 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,960 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,960 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,960 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,974 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_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~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, 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-09 05:47:24,975 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,975 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,975 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:24,975 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-03-09 05:47:25,008 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_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~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)])
[2024-03-09 05:47:25,008 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:25,008 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:25,008 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:25,008 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,031 INFO  L124   PetriNetUnfolderBase]: 5018/24084 cut-off events.
[2024-03-09 05:47:27,031 INFO  L125   PetriNetUnfolderBase]: For 2031/2036 co-relation queries the response was YES.
[2024-03-09 05:47:27,100 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-09 05:47:27,149 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-09 05:47:27,149 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow
[2024-03-09 05:47:27,151 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:47:27,151 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:47:27,151 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-09 05:47:27,152 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-09 05:47:27,152 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-09 05:47:27,152 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-09 05:47:27,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:27,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-09 05:47:27,153 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-09 05:47:27,153 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-09 05:47:27,154 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-09 05:47:27,154 INFO  L175             Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions.
[2024-03-09 05:47:27,154 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow
[2024-03-09 05:47:27,175 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-09 05:47:27,177 INFO  L231             Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow
[2024-03-09 05:47:27,177 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-09 05:47:27,178 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places.
[2024-03-09 05:47:27,178 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow
[2024-03-09 05:47:27,178 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-09 05:47:27,178 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:27,178 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-09 05:47:27,178 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-03-09 05:47:27,178 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-09 05:47:27,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:27,179 INFO  L85        PathProgramCache]: Analyzing trace with hash -1542162764, now seen corresponding path program 1 times
[2024-03-09 05:47:27,179 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:27,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055730391]
[2024-03-09 05:47:27,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:27,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:27,186 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:27,220 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-09 05:47:27,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:27,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055730391]
[2024-03-09 05:47:27,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055730391] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:27,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:27,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:47:27,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070450345]
[2024-03-09 05:47:27,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:27,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:47:27,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:27,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:47:27,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:47:27,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-09 05:47:27,318 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-09 05:47:27,318 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:27,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-09 05:47:27,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:27,753 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-09 05:47:27,753 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,753 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,753 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,753 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,764 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-09 05:47:27,765 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,765 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,765 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,765 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:27,864 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-09 05:47:27,865 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:27,865 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:27,865 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:27,865 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:30,011 INFO  L124   PetriNetUnfolderBase]: 5017/24082 cut-off events.
[2024-03-09 05:47:30,011 INFO  L125   PetriNetUnfolderBase]: For 2159/2164 co-relation queries the response was YES.
[2024-03-09 05:47:30,101 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-09 05:47:30,163 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-09 05:47:30,163 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow
[2024-03-09 05:47:30,164 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:47:30,164 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:47:30,165 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions.
[2024-03-09 05:47:30,165 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.929718875502008
[2024-03-09 05:47:30,165 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 926 transitions.
[2024-03-09 05:47:30,166 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions.
[2024-03-09 05:47:30,166 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:30,166 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions.
[2024-03-09 05:47:30,167 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-09 05:47:30,168 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-09 05:47:30,168 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-09 05:47:30,168 INFO  L175             Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions.
[2024-03-09 05:47:30,168 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow
[2024-03-09 05:47:30,192 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 05:47:30,195 INFO  L231             Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow
[2024-03-09 05:47:30,195 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-09 05:47:30,196 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places.
[2024-03-09 05:47:30,196 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow
[2024-03-09 05:47:30,196 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-09 05:47:30,196 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:30,196 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-09 05:47:30,196 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-03-09 05:47:30,197 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-09 05:47:30,197 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:30,197 INFO  L85        PathProgramCache]: Analyzing trace with hash 1562573418, now seen corresponding path program 1 times
[2024-03-09 05:47:30,197 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:30,197 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854904238]
[2024-03-09 05:47:30,197 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:30,198 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:30,205 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:30,241 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-09 05:47:30,241 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:30,241 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854904238]
[2024-03-09 05:47:30,241 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854904238] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:30,242 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:30,242 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:47:30,242 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345256432]
[2024-03-09 05:47:30,242 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:30,242 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:47:30,243 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:30,243 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:47:30,243 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:47:30,306 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-03-09 05:47:30,307 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-09 05:47:30,307 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:30,307 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-03-09 05:47:30,307 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:30,822 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-09 05:47:30,823 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,823 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,823 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,823 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,837 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-09 05:47:30,838 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,838 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,838 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,838 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-03-09 05:47:30,871 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-09 05:47:30,871 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:30,872 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:30,872 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:30,872 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-03-09 05:47:32,973 INFO  L124   PetriNetUnfolderBase]: 5028/24109 cut-off events.
[2024-03-09 05:47:32,974 INFO  L125   PetriNetUnfolderBase]: For 2341/2346 co-relation queries the response was YES.
[2024-03-09 05:47:33,087 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-09 05:47:33,282 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-03-09 05:47:33,283 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1041 flow
[2024-03-09 05:47:33,284 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:47:33,284 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:47:33,284 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-03-09 05:47:33,285 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-03-09 05:47:33,285 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-03-09 05:47:33,285 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-03-09 05:47:33,285 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:33,285 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-03-09 05:47:33,286 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-09 05:47:33,287 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-09 05:47:33,287 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-09 05:47:33,287 INFO  L175             Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 927 transitions.
[2024-03-09 05:47:33,287 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1041 flow
[2024-03-09 05:47:33,307 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-09 05:47:33,309 INFO  L231             Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow
[2024-03-09 05:47:33,310 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-09 05:47:33,310 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places.
[2024-03-09 05:47:33,310 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow
[2024-03-09 05:47:33,311 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-09 05:47:33,311 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:33,311 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-09 05:47:33,311 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-03-09 05:47:33,311 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-09 05:47:33,311 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:33,311 INFO  L85        PathProgramCache]: Analyzing trace with hash -493115211, now seen corresponding path program 1 times
[2024-03-09 05:47:33,312 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:33,312 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942712136]
[2024-03-09 05:47:33,312 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:33,312 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:33,318 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:33,345 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-09 05:47:33,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:33,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942712136]
[2024-03-09 05:47:33,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942712136] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:33,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:33,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-03-09 05:47:33,346 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038998456]
[2024-03-09 05:47:33,346 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:33,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-03-09 05:47:33,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:33,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-03-09 05:47:33,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-03-09 05:47:33,426 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-09 05:47:33,427 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-09 05:47:33,427 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:33,427 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-09 05:47:33,427 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:33,900 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-09 05:47:33,900 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,900 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,900 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,900 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,912 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-09 05:47:33,913 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,913 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,913 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,913 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:33,942 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-09 05:47:33,942 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:33,942 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:33,942 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:33,942 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:36,189 INFO  L124   PetriNetUnfolderBase]: 5134/24297 cut-off events.
[2024-03-09 05:47:36,190 INFO  L125   PetriNetUnfolderBase]: For 2483/2488 co-relation queries the response was YES.
[2024-03-09 05:47:36,279 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-09 05:47:36,336 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-03-09 05:47:36,336 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1048 flow
[2024-03-09 05:47:36,337 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-03-09 05:47:36,337 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-03-09 05:47:36,338 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions.
[2024-03-09 05:47:36,338 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267068273092369
[2024-03-09 05:47:36,338 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 923 transitions.
[2024-03-09 05:47:36,338 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 923 transitions.
[2024-03-09 05:47:36,339 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:36,339 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 923 transitions.
[2024-03-09 05:47:36,340 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-09 05:47:36,340 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-09 05:47:36,340 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-09 05:47:36,341 INFO  L175             Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 923 transitions.
[2024-03-09 05:47:36,341 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1048 flow
[2024-03-09 05:47:36,364 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1040 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:47:36,366 INFO  L231             Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow
[2024-03-09 05:47:36,367 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-09 05:47:36,367 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places.
[2024-03-09 05:47:36,367 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow
[2024-03-09 05:47:36,367 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-09 05:47:36,367 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:36,368 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-09 05:47:36,368 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-03-09 05:47:36,368 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-09 05:47:36,368 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:36,368 INFO  L85        PathProgramCache]: Analyzing trace with hash 337626724, now seen corresponding path program 1 times
[2024-03-09 05:47:36,368 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:36,369 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081480479]
[2024-03-09 05:47:36,369 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:36,369 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:36,375 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:36,386 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-09 05:47:36,386 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:36,386 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081480479]
[2024-03-09 05:47:36,386 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081480479] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:36,386 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:36,386 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:47:36,387 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979865223]
[2024-03-09 05:47:36,387 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:36,387 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:47:36,387 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:36,387 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:47:36,387 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:47:36,436 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249
[2024-03-09 05:47:36,437 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-09 05:47:36,437 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:36,437 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249
[2024-03-09 05:47:36,437 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:36,890 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-09 05:47:36,890 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,890 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,891 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,891 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,904 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-09 05:47:36,904 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,904 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,904 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,904 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-03-09 05:47:36,936 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-09 05:47:36,936 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:36,936 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:36,936 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:36,936 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-03-09 05:47:39,465 INFO  L124   PetriNetUnfolderBase]: 5506/25025 cut-off events.
[2024-03-09 05:47:39,465 INFO  L125   PetriNetUnfolderBase]: For 3457/3791 co-relation queries the response was YES.
[2024-03-09 05:47:39,615 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-09 05:47:39,695 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions.
[2024-03-09 05:47:39,696 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow
[2024-03-09 05:47:39,696 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:47:39,696 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:47:39,697 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2024-03-09 05:47:39,697 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9370816599732262
[2024-03-09 05:47:39,697 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 700 transitions.
[2024-03-09 05:47:39,697 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions.
[2024-03-09 05:47:39,697 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:39,697 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions.
[2024-03-09 05:47:39,698 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-09 05:47:39,699 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-09 05:47:39,699 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-09 05:47:39,699 INFO  L175             Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions.
[2024-03-09 05:47:39,699 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow
[2024-03-09 05:47:39,722 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-03-09 05:47:39,724 INFO  L231             Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow
[2024-03-09 05:47:39,725 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-09 05:47:39,725 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-03-09 05:47:39,725 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow
[2024-03-09 05:47:39,725 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-09 05:47:39,725 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:39,726 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-09 05:47:39,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-03-09 05:47:39,726 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-09 05:47:39,726 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:39,726 INFO  L85        PathProgramCache]: Analyzing trace with hash 1957827092, now seen corresponding path program 1 times
[2024-03-09 05:47:39,726 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:39,727 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009431491]
[2024-03-09 05:47:39,727 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:39,727 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:39,740 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:39,956 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-09 05:47:39,956 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:39,956 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009431491]
[2024-03-09 05:47:39,956 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009431491] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:39,957 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:39,957 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:47:39,957 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604062464]
[2024-03-09 05:47:39,957 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:39,957 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:47:39,958 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:39,958 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:47:39,958 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:47:40,110 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249
[2024-03-09 05:47:40,111 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-09 05:47:40,111 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:40,111 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249
[2024-03-09 05:47:40,111 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:47,545 INFO  L124   PetriNetUnfolderBase]: 16582/60869 cut-off events.
[2024-03-09 05:47:47,546 INFO  L125   PetriNetUnfolderBase]: For 13822/15308 co-relation queries the response was YES.
[2024-03-09 05:47:47,774 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-09 05:47:47,923 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 125 selfloop transitions, 136 changer transitions 0/492 dead transitions.
[2024-03-09 05:47:47,924 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 492 transitions, 2362 flow
[2024-03-09 05:47:47,924 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:47:47,925 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:47:47,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions.
[2024-03-09 05:47:47,926 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.928380187416332
[2024-03-09 05:47:47,926 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions.
[2024-03-09 05:47:47,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions.
[2024-03-09 05:47:47,926 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:47,926 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions.
[2024-03-09 05:47:47,928 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-09 05:47:47,928 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-09 05:47:47,929 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-09 05:47:47,929 INFO  L175             Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 6 states and 1387 transitions.
[2024-03-09 05:47:47,929 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 492 transitions, 2362 flow
[2024-03-09 05:47:48,007 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 492 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:47:48,011 INFO  L231             Difference]: Finished difference. Result has 272 places, 449 transitions, 2210 flow
[2024-03-09 05:47:48,011 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-09 05:47:48,011 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places.
[2024-03-09 05:47:48,011 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 449 transitions, 2210 flow
[2024-03-09 05:47:48,012 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-09 05:47:48,012 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:48,012 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-09 05:47:48,012 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-03-09 05:47:48,012 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-09 05:47:48,012 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:48,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 807622693, now seen corresponding path program 1 times
[2024-03-09 05:47:48,013 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:48,013 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280217618]
[2024-03-09 05:47:48,013 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:48,013 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:48,029 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:48,208 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-09 05:47:48,208 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:48,208 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280217618]
[2024-03-09 05:47:48,208 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280217618] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:48,208 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:48,208 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 05:47:48,208 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927105106]
[2024-03-09 05:47:48,209 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:48,209 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 05:47:48,209 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:48,209 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 05:47:48,209 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 05:47:48,460 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-03-09 05:47:48,461 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-09 05:47:48,461 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:48,461 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-03-09 05:47:48,462 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:47:56,834 INFO  L124   PetriNetUnfolderBase]: 16236/68449 cut-off events.
[2024-03-09 05:47:56,834 INFO  L125   PetriNetUnfolderBase]: For 29732/31012 co-relation queries the response was YES.
[2024-03-09 05:47:57,189 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-09 05:47:57,396 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 132 selfloop transitions, 119 changer transitions 0/581 dead transitions.
[2024-03-09 05:47:57,396 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 3612 flow
[2024-03-09 05:47:57,397 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 05:47:57,397 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 05:47:57,398 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions.
[2024-03-09 05:47:57,399 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-03-09 05:47:57,399 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions.
[2024-03-09 05:47:57,399 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions.
[2024-03-09 05:47:57,399 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:47:57,399 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions.
[2024-03-09 05:47:57,401 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-09 05:47:57,402 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-09 05:47:57,402 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-09 05:47:57,402 INFO  L175             Difference]: Start difference. First operand has 272 places, 449 transitions, 2210 flow. Second operand 6 states and 1371 transitions.
[2024-03-09 05:47:57,402 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 3612 flow
[2024-03-09 05:47:57,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 581 transitions, 3558 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-09 05:47:57,526 INFO  L231             Difference]: Finished difference. Result has 282 places, 563 transitions, 3576 flow
[2024-03-09 05:47:57,527 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-09 05:47:57,527 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places.
[2024-03-09 05:47:57,527 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 563 transitions, 3576 flow
[2024-03-09 05:47:57,528 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-09 05:47:57,528 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:47:57,528 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-09 05:47:57,528 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-03-09 05:47:57,528 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-09 05:47:57,528 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:47:57,529 INFO  L85        PathProgramCache]: Analyzing trace with hash -120555844, now seen corresponding path program 1 times
[2024-03-09 05:47:57,529 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:47:57,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266094745]
[2024-03-09 05:47:57,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:47:57,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:47:57,547 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:47:57,933 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-09 05:47:57,933 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:47:57,933 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266094745]
[2024-03-09 05:47:57,934 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266094745] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:47:57,934 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:47:57,934 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:47:57,934 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502663383]
[2024-03-09 05:47:57,934 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:47:57,934 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:47:57,935 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:47:57,935 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:47:57,935 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:47:58,624 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249
[2024-03-09 05:47:58,625 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-09 05:47:58,625 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:47:58,626 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249
[2024-03-09 05:47:58,626 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:48:09,996 INFO  L124   PetriNetUnfolderBase]: 23340/78289 cut-off events.
[2024-03-09 05:48:09,997 INFO  L125   PetriNetUnfolderBase]: For 59242/64882 co-relation queries the response was YES.
[2024-03-09 05:48:10,454 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-09 05:48:10,700 INFO  L140   encePairwiseOnDemand]: 229/249 looper letters, 424 selfloop transitions, 224 changer transitions 0/874 dead transitions.
[2024-03-09 05:48:10,700 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 874 transitions, 7068 flow
[2024-03-09 05:48:10,702 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 05:48:10,703 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 05:48:10,703 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions.
[2024-03-09 05:48:10,704 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8682000730193501
[2024-03-09 05:48:10,704 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions.
[2024-03-09 05:48:10,704 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions.
[2024-03-09 05:48:10,705 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:48:10,705 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions.
[2024-03-09 05:48:10,707 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-09 05:48:10,708 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-09 05:48:10,708 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-09 05:48:10,708 INFO  L175             Difference]: Start difference. First operand has 282 places, 563 transitions, 3576 flow. Second operand 11 states and 2378 transitions.
[2024-03-09 05:48:10,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 874 transitions, 7068 flow
[2024-03-09 05:48:11,199 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 874 transitions, 7020 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-03-09 05:48:11,206 INFO  L231             Difference]: Finished difference. Result has 299 places, 689 transitions, 5536 flow
[2024-03-09 05:48:11,206 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-09 05:48:11,207 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 60 predicate places.
[2024-03-09 05:48:11,207 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 689 transitions, 5536 flow
[2024-03-09 05:48:11,207 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-09 05:48:11,207 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:48:11,207 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-09 05:48:11,208 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-03-09 05:48:11,208 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-09 05:48:11,208 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:48:11,208 INFO  L85        PathProgramCache]: Analyzing trace with hash -1053655554, now seen corresponding path program 1 times
[2024-03-09 05:48:11,208 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:48:11,208 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678353485]
[2024-03-09 05:48:11,208 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:48:11,209 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:48:11,224 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:48:11,498 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-09 05:48:11,498 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:48:11,498 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678353485]
[2024-03-09 05:48:11,498 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678353485] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:48:11,498 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:48:11,499 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-03-09 05:48:11,499 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627793392]
[2024-03-09 05:48:11,499 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:48:11,499 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-03-09 05:48:11,499 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:48:11,500 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-03-09 05:48:11,500 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-03-09 05:48:12,199 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 249
[2024-03-09 05:48:12,201 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-09 05:48:12,201 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:48:12,201 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 249
[2024-03-09 05:48:12,201 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:48:23,517 INFO  L124   PetriNetUnfolderBase]: 19999/74649 cut-off events.
[2024-03-09 05:48:23,517 INFO  L125   PetriNetUnfolderBase]: For 103051/106678 co-relation queries the response was YES.
[2024-03-09 05:48:23,991 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-09 05:48:24,231 INFO  L140   encePairwiseOnDemand]: 237/249 looper letters, 404 selfloop transitions, 18 changer transitions 0/702 dead transitions.
[2024-03-09 05:48:24,232 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 702 transitions, 6478 flow
[2024-03-09 05:48:24,233 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-03-09 05:48:24,233 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-03-09 05:48:24,234 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2072 transitions.
[2024-03-09 05:48:24,235 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8321285140562249
[2024-03-09 05:48:24,235 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2072 transitions.
[2024-03-09 05:48:24,235 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2072 transitions.
[2024-03-09 05:48:24,235 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:48:24,235 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2072 transitions.
[2024-03-09 05:48:24,237 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-09 05:48:24,239 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-09 05:48:24,239 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-09 05:48:24,239 INFO  L175             Difference]: Start difference. First operand has 299 places, 689 transitions, 5536 flow. Second operand 10 states and 2072 transitions.
[2024-03-09 05:48:24,239 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 702 transitions, 6478 flow
[2024-03-09 05:48:25,079 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 702 transitions, 6434 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-03-09 05:48:25,086 INFO  L231             Difference]: Finished difference. Result has 306 places, 690 transitions, 5564 flow
[2024-03-09 05:48:25,087 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-09 05:48:25,087 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 67 predicate places.
[2024-03-09 05:48:25,087 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 690 transitions, 5564 flow
[2024-03-09 05:48:25,088 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-09 05:48:25,088 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:48:25,088 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-09 05:48:25,088 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-03-09 05:48:25,088 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-09 05:48:25,088 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:48:25,089 INFO  L85        PathProgramCache]: Analyzing trace with hash 1230779042, now seen corresponding path program 1 times
[2024-03-09 05:48:25,089 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:48:25,089 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143920658]
[2024-03-09 05:48:25,089 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:48:25,089 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:48:25,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:48:25,124 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-09 05:48:25,124 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:48:25,124 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143920658]
[2024-03-09 05:48:25,124 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143920658] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:48:25,125 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 05:48:25,125 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-03-09 05:48:25,125 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861530384]
[2024-03-09 05:48:25,125 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:48:25,125 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-03-09 05:48:25,125 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:48:25,126 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-03-09 05:48:25,126 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-03-09 05:48:25,164 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-03-09 05:48:25,165 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-09 05:48:25,165 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:48:25,165 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-03-09 05:48:25,165 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:48:28,308 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-09 05:48:28,309 INFO  L294   olderBase$Statistics]: this new event has 167 ancestors and is cut-off event
[2024-03-09 05:48:28,309 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 05:48:28,309 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 05:48:28,309 INFO  L297   olderBase$Statistics]:   existing Event has 167 ancestors and is cut-off event
[2024-03-09 05:48:29,872 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-09 05:48:29,872 INFO  L294   olderBase$Statistics]: this new event has 174 ancestors and is cut-off event
[2024-03-09 05:48:29,873 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-09 05:48:29,873 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-09 05:48:29,873 INFO  L297   olderBase$Statistics]:   existing Event has 174 ancestors and is cut-off event
[2024-03-09 05:48:30,080 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-09 05:48:30,080 INFO  L294   olderBase$Statistics]: this new event has 175 ancestors and is cut-off event
[2024-03-09 05:48:30,080 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-09 05:48:30,080 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-09 05:48:30,080 INFO  L297   olderBase$Statistics]:   existing Event has 175 ancestors and is cut-off event
[2024-03-09 05:48:30,320 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-09 05:48:30,320 INFO  L294   olderBase$Statistics]: this new event has 176 ancestors and is cut-off event
[2024-03-09 05:48:30,320 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 05:48:30,320 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 05:48:30,320 INFO  L297   olderBase$Statistics]:   existing Event has 176 ancestors and is cut-off event
[2024-03-09 05:48:31,521 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-09 05:48:31,522 INFO  L294   olderBase$Statistics]: this new event has 180 ancestors and is cut-off event
[2024-03-09 05:48:31,522 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 05:48:31,522 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 05:48:31,522 INFO  L297   olderBase$Statistics]:   existing Event has 180 ancestors and is cut-off event
[2024-03-09 05:48:36,205 INFO  L124   PetriNetUnfolderBase]: 17816/75735 cut-off events.
[2024-03-09 05:48:36,205 INFO  L125   PetriNetUnfolderBase]: For 79446/85745 co-relation queries the response was YES.
[2024-03-09 05:48:36,772 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-09 05:48:36,997 INFO  L140   encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/711 dead transitions.
[2024-03-09 05:48:36,998 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 711 transitions, 5772 flow
[2024-03-09 05:48:36,999 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-03-09 05:48:36,999 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-03-09 05:48:36,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions.
[2024-03-09 05:48:37,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9464524765729585
[2024-03-09 05:48:37,000 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 707 transitions.
[2024-03-09 05:48:37,000 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions.
[2024-03-09 05:48:37,000 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:48:37,000 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions.
[2024-03-09 05:48:37,001 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-09 05:48:37,001 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-09 05:48:37,002 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-09 05:48:37,002 INFO  L175             Difference]: Start difference. First operand has 306 places, 690 transitions, 5564 flow. Second operand 3 states and 707 transitions.
[2024-03-09 05:48:37,002 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 711 transitions, 5772 flow
[2024-03-09 05:48:37,780 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 711 transitions, 5736 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-03-09 05:48:37,787 INFO  L231             Difference]: Finished difference. Result has 305 places, 705 transitions, 5710 flow
[2024-03-09 05:48:37,788 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-09 05:48:37,788 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places.
[2024-03-09 05:48:37,788 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 705 transitions, 5710 flow
[2024-03-09 05:48:37,788 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-09 05:48:37,789 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:48:37,789 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-09 05:48:37,789 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-03-09 05:48:37,789 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-09 05:48:37,789 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:48:37,789 INFO  L85        PathProgramCache]: Analyzing trace with hash -341571048, now seen corresponding path program 1 times
[2024-03-09 05:48:37,789 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:48:37,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58004711]
[2024-03-09 05:48:37,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:48:37,790 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:48:37,809 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:48:38,317 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-09 05:48:38,317 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:48:38,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58004711]
[2024-03-09 05:48:38,318 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58004711] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:48:38,318 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443969976]
[2024-03-09 05:48:38,318 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:48:38,318 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:48:38,318 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:48:38,320 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-09 05:48:38,321 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-09 05:48:38,506 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:48:38,507 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-03-09 05:48:38,513 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:48:38,550 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-09 05:48:38,626 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:48:38,626 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-09 05:48:39,002 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:48:39,002 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-09 05:48:39,057 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:48:39,058 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-09 05:48:39,123 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-09 05:48:39,135 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-09 05:48:39,143 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-09 05:48:39,158 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:48:39,159 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-09 05:48:39,175 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:48:39,175 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-09 05:48:39,206 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-09 05:48:39,219 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-09 05:48:39,219 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:48:39,219 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443969976] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:48:39,219 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:48:39,219 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21
[2024-03-09 05:48:39,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896880665]
[2024-03-09 05:48:39,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:48:39,220 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-03-09 05:48:39,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:48:39,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-03-09 05:48:39,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2024-03-09 05:48:40,373 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-09 05:48:40,375 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-09 05:48:40,375 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:48:40,375 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-09 05:48:40,375 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:49:01,213 INFO  L124   PetriNetUnfolderBase]: 36676/117459 cut-off events.
[2024-03-09 05:49:01,217 INFO  L125   PetriNetUnfolderBase]: For 205771/206989 co-relation queries the response was YES.
[2024-03-09 05:49:02,134 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-09 05:49:02,543 INFO  L140   encePairwiseOnDemand]: 225/249 looper letters, 1024 selfloop transitions, 487 changer transitions 0/1736 dead transitions.
[2024-03-09 05:49:02,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1736 transitions, 19539 flow
[2024-03-09 05:49:02,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-09 05:49:02,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-09 05:49:02,545 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3998 transitions.
[2024-03-09 05:49:02,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8028112449799196
[2024-03-09 05:49:02,546 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3998 transitions.
[2024-03-09 05:49:02,546 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3998 transitions.
[2024-03-09 05:49:02,547 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:49:02,547 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3998 transitions.
[2024-03-09 05:49:02,549 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-09 05:49:02,552 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-09 05:49:02,552 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-09 05:49:02,552 INFO  L175             Difference]: Start difference. First operand has 305 places, 705 transitions, 5710 flow. Second operand 20 states and 3998 transitions.
[2024-03-09 05:49:02,552 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1736 transitions, 19539 flow
[2024-03-09 05:49:04,713 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1736 transitions, 19501 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-03-09 05:49:04,729 INFO  L231             Difference]: Finished difference. Result has 332 places, 1116 transitions, 12628 flow
[2024-03-09 05:49:04,729 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-09 05:49:04,729 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 93 predicate places.
[2024-03-09 05:49:04,730 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 1116 transitions, 12628 flow
[2024-03-09 05:49:04,730 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-09 05:49:04,730 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:49:04,730 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-09 05:49:04,738 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-09 05:49:04,932 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-09 05:49:04,932 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-09 05:49:04,933 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:49:04,933 INFO  L85        PathProgramCache]: Analyzing trace with hash -1494089320, now seen corresponding path program 2 times
[2024-03-09 05:49:04,933 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:49:04,934 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702603498]
[2024-03-09 05:49:04,934 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:49:04,934 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:49:04,954 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:49:05,639 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-09 05:49:05,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:49:05,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702603498]
[2024-03-09 05:49:05,640 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702603498] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:49:05,640 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238688271]
[2024-03-09 05:49:05,640 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 05:49:05,640 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:49:05,640 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:49:05,641 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-09 05:49:05,642 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-09 05:49:05,825 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 05:49:05,825 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:49:05,827 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-09 05:49:05,833 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:49:05,859 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-09 05:49:05,947 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:49:05,947 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-09 05:49:06,355 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:49:06,355 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-09 05:49:06,410 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:06,411 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-09 05:49:06,435 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-09 05:49:06,481 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-09 05:49:06,543 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:06,543 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-09 05:49:06,616 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:06,616 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-09 05:49:06,943 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-09 05:49:07,049 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:07,050 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-09 05:49:07,083 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:07,085 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-03-09 05:49:07,113 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:07,114 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-09 05:49:07,139 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:07,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 56 treesize of output 45
[2024-03-09 05:49:07,192 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-09 05:49:07,205 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-09 05:49:07,205 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:49:07,205 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [238688271] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:49:07,205 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:49:07,206 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:49:07,206 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495619559]
[2024-03-09 05:49:07,206 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:49:07,206 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:49:07,207 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:49:07,207 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:49:07,207 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:49:08,258 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-09 05:49:08,259 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-09 05:49:08,260 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:49:08,260 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-09 05:49:08,260 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:49:34,850 INFO  L124   PetriNetUnfolderBase]: 37383/118274 cut-off events.
[2024-03-09 05:49:34,850 INFO  L125   PetriNetUnfolderBase]: For 350195/354913 co-relation queries the response was YES.
[2024-03-09 05:49:35,942 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-09 05:49:36,503 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 825 selfloop transitions, 806 changer transitions 0/1856 dead transitions.
[2024-03-09 05:49:36,504 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1856 transitions, 24287 flow
[2024-03-09 05:49:36,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 05:49:36,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 05:49:36,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5046 transitions.
[2024-03-09 05:49:36,507 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8106024096385542
[2024-03-09 05:49:36,508 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 5046 transitions.
[2024-03-09 05:49:36,508 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 5046 transitions.
[2024-03-09 05:49:36,508 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:49:36,508 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5046 transitions.
[2024-03-09 05:49:36,512 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-09 05:49:36,515 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-09 05:49:36,515 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-09 05:49:36,515 INFO  L175             Difference]: Start difference. First operand has 332 places, 1116 transitions, 12628 flow. Second operand 25 states and 5046 transitions.
[2024-03-09 05:49:36,515 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1856 transitions, 24287 flow
[2024-03-09 05:49:40,620 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1856 transitions, 24157 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-03-09 05:49:40,639 INFO  L231             Difference]: Finished difference. Result has 359 places, 1449 transitions, 20376 flow
[2024-03-09 05:49:40,639 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-09 05:49:40,640 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 120 predicate places.
[2024-03-09 05:49:40,640 INFO  L495      AbstractCegarLoop]: Abstraction has has 359 places, 1449 transitions, 20376 flow
[2024-03-09 05:49:40,640 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-09 05:49:40,640 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:49:40,641 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-09 05:49:40,648 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-09 05:49:40,841 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-09 05:49:40,842 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-09 05:49:40,842 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:49:40,843 INFO  L85        PathProgramCache]: Analyzing trace with hash -1416884328, now seen corresponding path program 3 times
[2024-03-09 05:49:40,843 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:49:40,843 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738544455]
[2024-03-09 05:49:40,844 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:49:40,844 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:49:40,865 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:49:41,550 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-09 05:49:41,550 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:49:41,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738544455]
[2024-03-09 05:49:41,550 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738544455] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:49:41,550 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953020985]
[2024-03-09 05:49:41,551 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 05:49:41,551 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:49:41,551 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:49:41,552 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-09 05:49:41,553 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-09 05:49:41,744 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 05:49:41,745 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:49:41,746 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-09 05:49:41,752 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:49:41,788 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-09 05:49:41,864 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:49:41,864 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-09 05:49:42,229 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:49:42,230 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-09 05:49:42,294 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:42,295 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-09 05:49:42,320 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-09 05:49:42,362 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-09 05:49:42,416 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:42,416 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-09 05:49:42,606 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-09 05:49:42,672 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:49:42,673 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-09 05:49:42,745 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:42,746 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-09 05:49:42,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:42,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 56 treesize of output 45
[2024-03-09 05:49:42,795 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:42,796 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-09 05:49:42,818 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:49:42,818 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-09 05:49:42,854 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-09 05:49:42,863 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-09 05:49:42,863 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:49:42,864 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [953020985] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:49:42,864 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:49:42,864 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-03-09 05:49:42,864 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500062641]
[2024-03-09 05:49:42,864 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:49:42,864 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-03-09 05:49:42,865 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:49:42,865 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-03-09 05:49:42,865 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=601, Unknown=0, NotChecked=0, Total=702
[2024-03-09 05:49:44,194 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-03-09 05:49:44,195 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-09 05:49:44,196 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:49:44,196 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-03-09 05:49:44,196 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:50:16,507 INFO  L124   PetriNetUnfolderBase]: 39792/124613 cut-off events.
[2024-03-09 05:50:16,508 INFO  L125   PetriNetUnfolderBase]: For 573591/579139 co-relation queries the response was YES.
[2024-03-09 05:50:17,803 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-09 05:50:18,392 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 879 selfloop transitions, 1090 changer transitions 0/2194 dead transitions.
[2024-03-09 05:50:18,392 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 384 places, 2194 transitions, 33316 flow
[2024-03-09 05:50:18,393 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. 
[2024-03-09 05:50:18,394 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2024-03-09 05:50:18,396 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 5253 transitions.
[2024-03-09 05:50:18,397 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8113994439295644
[2024-03-09 05:50:18,397 INFO  L72            ComplementDD]: Start complementDD. Operand 26 states and 5253 transitions.
[2024-03-09 05:50:18,397 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 26 states and 5253 transitions.
[2024-03-09 05:50:18,398 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:50:18,398 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 5253 transitions.
[2024-03-09 05:50:18,403 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-09 05:50:18,406 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-09 05:50:18,407 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-09 05:50:18,407 INFO  L175             Difference]: Start difference. First operand has 359 places, 1449 transitions, 20376 flow. Second operand 26 states and 5253 transitions.
[2024-03-09 05:50:18,407 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 384 places, 2194 transitions, 33316 flow
[2024-03-09 05:50:27,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 2194 transitions, 32510 flow, removed 397 selfloop flow, removed 6 redundant places.
[2024-03-09 05:50:27,782 INFO  L231             Difference]: Finished difference. Result has 388 places, 1754 transitions, 28678 flow
[2024-03-09 05:50:27,783 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-09 05:50:27,784 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 149 predicate places.
[2024-03-09 05:50:27,784 INFO  L495      AbstractCegarLoop]: Abstraction has has 388 places, 1754 transitions, 28678 flow
[2024-03-09 05:50:27,784 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-09 05:50:27,784 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:50:27,784 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-09 05:50:27,792 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-09 05:50:27,985 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-09 05:50:27,986 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-09 05:50:27,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:50:27,987 INFO  L85        PathProgramCache]: Analyzing trace with hash -2129244486, now seen corresponding path program 4 times
[2024-03-09 05:50:27,987 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:50:27,987 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197989628]
[2024-03-09 05:50:27,987 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:50:27,988 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:50:28,018 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:50:28,663 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:50:28,663 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:50:28,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197989628]
[2024-03-09 05:50:28,664 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197989628] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:50:28,664 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1765933373]
[2024-03-09 05:50:28,664 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 05:50:28,664 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:50:28,664 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:50:28,666 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-09 05:50:28,667 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-09 05:50:28,974 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 05:50:28,974 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 05:50:28,977 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 71 conjunts are in the unsatisfiable core
[2024-03-09 05:50:28,984 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:50:29,022 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-09 05:50:29,125 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:50:29,125 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-09 05:50:30,025 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:50:30,026 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-09 05:50:30,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:30,033 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-09 05:50:30,333 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:30,334 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-09 05:50:30,339 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:30,339 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-09 05:50:30,425 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-09 05:50:30,490 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-09 05:50:30,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 7 treesize of output 3
[2024-03-09 05:50:30,876 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-09 05:50:30,964 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-09 05:50:31,069 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-09 05:50:31,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:31,193 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:50:31,245 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:31,246 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-09 05:50:31,292 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:31,292 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-03-09 05:50:31,334 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:50:31,335 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-09 05:50:31,456 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-09 05:50:31,533 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-09 05:50:31,534 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-03-09 05:50:31,534 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1765933373] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 05:50:31,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-03-09 05:50:31,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [15] total 33
[2024-03-09 05:50:31,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793184516]
[2024-03-09 05:50:31,534 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 05:50:31,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-03-09 05:50:31,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:50:31,535 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-03-09 05:50:31,535 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=987, Unknown=0, NotChecked=0, Total=1122
[2024-03-09 05:50:34,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 249
[2024-03-09 05:50:34,848 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1754 transitions, 28678 flow. Second operand  has 20 states, 20 states have (on average 176.9) internal successors, (3538), 20 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:50:34,848 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:50:34,848 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 249
[2024-03-09 05:50:34,848 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 05:52:21,667 INFO  L124   PetriNetUnfolderBase]: 119396/352182 cut-off events.
[2024-03-09 05:52:21,667 INFO  L125   PetriNetUnfolderBase]: For 2245209/2250253 co-relation queries the response was YES.
[2024-03-09 05:52:26,185 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1267332 conditions, 352182 events. 119396/352182 cut-off events. For 2245209/2250253 co-relation queries the response was YES. Maximal size of possible extension queue 9244. Compared 5682926 event pairs, 27441 based on Foata normal form. 1123/317463 useless extension candidates. Maximal degree in co-relation 1248982. Up to 67060 conditions per place. 
[2024-03-09 05:52:27,967 INFO  L140   encePairwiseOnDemand]: 208/249 looper letters, 3551 selfloop transitions, 1661 changer transitions 11/5436 dead transitions.
[2024-03-09 05:52:27,967 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 427 places, 5436 transitions, 101254 flow
[2024-03-09 05:52:27,968 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. 
[2024-03-09 05:52:27,968 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 40 states.
[2024-03-09 05:52:27,970 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 7700 transitions.
[2024-03-09 05:52:27,972 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7730923694779116
[2024-03-09 05:52:27,972 INFO  L72            ComplementDD]: Start complementDD. Operand 40 states and 7700 transitions.
[2024-03-09 05:52:27,972 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 40 states and 7700 transitions.
[2024-03-09 05:52:27,973 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 05:52:27,973 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 7700 transitions.
[2024-03-09 05:52:27,978 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 41 states, 40 states have (on average 192.5) internal successors, (7700), 40 states have internal predecessors, (7700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:52:27,983 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 41 states, 41 states have (on average 249.0) internal successors, (10209), 41 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:52:27,984 INFO  L81            ComplementDD]: Finished complementDD. Result  has 41 states, 41 states have (on average 249.0) internal successors, (10209), 41 states have internal predecessors, (10209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:52:27,984 INFO  L175             Difference]: Start difference. First operand has 388 places, 1754 transitions, 28678 flow. Second operand 40 states and 7700 transitions.
[2024-03-09 05:52:27,984 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 427 places, 5436 transitions, 101254 flow
[2024-03-09 05:54:02,840 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 416 places, 5436 transitions, 99882 flow, removed 208 selfloop flow, removed 11 redundant places.
[2024-03-09 05:54:02,901 INFO  L231             Difference]: Finished difference. Result has 444 places, 3397 transitions, 69528 flow
[2024-03-09 05:54:02,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=28232, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1754, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=371, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=765, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=69528, PETRI_PLACES=444, PETRI_TRANSITIONS=3397}
[2024-03-09 05:54:02,903 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 205 predicate places.
[2024-03-09 05:54:02,903 INFO  L495      AbstractCegarLoop]: Abstraction has has 444 places, 3397 transitions, 69528 flow
[2024-03-09 05:54:02,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 20 states, 20 states have (on average 176.9) internal successors, (3538), 20 states have internal predecessors, (3538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:54:02,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-09 05:54:02,904 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-09 05:54:02,913 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0
[2024-03-09 05:54:03,105 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45
[2024-03-09 05:54:03,105 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-03-09 05:54:03,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 05:54:03,106 INFO  L85        PathProgramCache]: Analyzing trace with hash -754319684, now seen corresponding path program 1 times
[2024-03-09 05:54:03,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 05:54:03,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152751065]
[2024-03-09 05:54:03,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:54:03,107 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 05:54:03,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:54:03,623 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-09 05:54:03,624 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 05:54:03,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152751065]
[2024-03-09 05:54:03,624 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152751065] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 05:54:03,624 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905577412]
[2024-03-09 05:54:03,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 05:54:03,624 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 05:54:03,625 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-09 05:54:03,626 INFO  L229       MonitoredProcess]: Starting monitored process 16 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 05:54:03,628 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process
[2024-03-09 05:54:03,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 05:54:03,819 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-03-09 05:54:03,825 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 05:54:03,926 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-09 05:54:04,033 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-09 05:54:04,033 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-09 05:54:04,724 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-09 05:54:04,725 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-09 05:54:04,731 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:54:04,732 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-09 05:54:04,987 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:54:04,988 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-09 05:54:04,998 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 05:54:04,998 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-09 05:54:05,103 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-09 05:54:05,108 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-09 05:54:05,171 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-09 05:54:05,211 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-09 05:54:05,272 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-09 05:54:05,331 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-09 05:54:05,391 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-09 05:54:05,440 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 05:54:05,441 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 05:54:05,460 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false
[2024-03-09 05:54:05,481 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_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)))))) is different from false
[2024-03-09 05:54:05,500 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_2263 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)))) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false
[2024-03-09 05:54:05,518 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse4)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse4)) (.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse4))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3 0) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse1) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)) (forall ((v_ArrVal_2263 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2263) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse4)) 0)))))) is different from false
[2024-03-09 05:54:05,538 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:54:05,539 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-03-09 05:54:05,545 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:54:05,545 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-03-09 05:54:05,548 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 10 treesize of output 3
[2024-03-09 05:54:05,554 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:54:05,554 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:54:05,558 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:54:05,559 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-03-09 05:54:05,563 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-09 05:54:05,563 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-03-09 05:54:09,743 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2256 (Array Int Int)) (v_ArrVal_2254 (Array Int Int))) (not (= c_~datas~0.base (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_2254) c_~datas~0.base v_ArrVal_2256) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 05:54:10,088 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 73 treesize of output 57
[2024-03-09 05:54:10,095 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 48
[2024-03-09 05:54:10,098 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 48 treesize of output 46
[2024-03-09 05:54:10,101 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-09 05:54:10,204 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 05:54:10,205 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 35 treesize of output 40
[2024-03-09 05:54:10,271 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-09 05:54:10,271 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1905577412] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 05:54:10,272 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 05:54:10,272 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 22, 17] total 49
[2024-03-09 05:54:10,272 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362970358]
[2024-03-09 05:54:10,272 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 05:54:10,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-03-09 05:54:10,274 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 05:54:10,275 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-03-09 05:54:10,276 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1746, Unknown=25, NotChecked=450, Total=2450
[2024-03-09 05:54:10,420 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 249
[2024-03-09 05:54:10,423 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 3397 transitions, 69528 flow. Second operand  has 50 states, 50 states have (on average 144.02) internal successors, (7201), 50 states have internal predecessors, (7201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 05:54:10,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 05:54:10,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 249
[2024-03-09 05:54:10,423 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
