/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 02:35:27,718 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 02:35:27,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2023-11-30 02:35:27,806 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 02:35:27,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 02:35:27,807 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 02:35:27,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 02:35:27,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 02:35:27,808 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 02:35:27,810 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 02:35:27,810 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 02:35:27,811 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 02:35:27,811 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 02:35:27,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 02:35:27,813 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 02:35:27,813 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 02:35:27,813 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 02:35:27,813 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 02:35:27,814 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 02:35:27,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:35:27,814 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 02:35:27,814 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 02:35:27,814 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 02:35:27,814 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 02:35:27,815 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 02:35:27,815 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 02:35:27,815 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 02:35:27,815 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2023-11-30 02:35:27,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 02:35:27,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 02:35:27,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 02:35:27,978 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 02:35:27,978 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 02:35:27,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-11-30 02:35:29,040 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 02:35:29,194 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 02:35:29,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_21-traces-cluster-based_true.i [2023-11-30 02:35:29,203 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5598153ac/56026e6958ce46db8b062389119a9773/FLAG44080ae7e [2023-11-30 02:35:29,211 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5598153ac/56026e6958ce46db8b062389119a9773 [2023-11-30 02:35:29,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 02:35:29,214 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 02:35:29,214 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 02:35:29,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 02:35:29,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 02:35:29,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a43768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29, skipping insertion in model container [2023-11-30 02:35:29,221 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,260 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 02:35:29,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:35:29,540 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 02:35:29,578 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 02:35:29,608 INFO L206 MainTranslator]: Completed translation [2023-11-30 02:35:29,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29 WrapperNode [2023-11-30 02:35:29,609 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 02:35:29,610 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 02:35:29,610 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 02:35:29,610 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 02:35:29,614 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,635 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,658 INFO L138 Inliner]: procedures = 166, calls = 54, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 173 [2023-11-30 02:35:29,658 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 02:35:29,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 02:35:29,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 02:35:29,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 02:35:29,665 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,681 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 02:35:29,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 02:35:29,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 02:35:29,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 02:35:29,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (1/1) ... [2023-11-30 02:35:29,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 02:35:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 02:35:29,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-30 02:35:29,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-30 02:35:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2023-11-30 02:35:29,749 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2023-11-30 02:35:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 02:35:29,749 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure t3_fun [2023-11-30 02:35:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure t3_fun [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-30 02:35:29,750 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 02:35:29,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 02:35:29,751 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-30 02:35:29,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 02:35:29,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 02:35:29,752 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 02:35:29,855 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 02:35:29,856 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 02:35:30,090 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 02:35:30,115 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 02:35:30,115 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-30 02:35:30,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:35:30 BoogieIcfgContainer [2023-11-30 02:35:30,124 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 02:35:30,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 02:35:30,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 02:35:30,128 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 02:35:30,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 02:35:29" (1/3) ... [2023-11-30 02:35:30,129 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a947cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:35:30, skipping insertion in model container [2023-11-30 02:35:30,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 02:35:29" (2/3) ... [2023-11-30 02:35:30,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a947cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 02:35:30, skipping insertion in model container [2023-11-30 02:35:30,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 02:35:30" (3/3) ... [2023-11-30 02:35:30,131 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_21-traces-cluster-based_true.i [2023-11-30 02:35:30,142 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 02:35:30,142 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-30 02:35:30,142 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 02:35:30,206 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-30 02:35:30,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 228 places, 227 transitions, 466 flow [2023-11-30 02:35:30,304 INFO L124 PetriNetUnfolderBase]: 9/224 cut-off events. [2023-11-30 02:35:30,305 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:35:30,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234 conditions, 224 events. 9/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 536 event pairs, 0 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 189. Up to 2 conditions per place. [2023-11-30 02:35:30,313 INFO L82 GeneralOperation]: Start removeDead. Operand has 228 places, 227 transitions, 466 flow [2023-11-30 02:35:30,319 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 224 transitions, 457 flow [2023-11-30 02:35:30,328 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 02:35:30,333 INFO L362 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;@202cda91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 02:35:30,333 INFO L363 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2023-11-30 02:35:30,354 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 02:35:30,354 INFO L124 PetriNetUnfolderBase]: 0/76 cut-off events. [2023-11-30 02:35:30,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 02:35:30,355 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:35:30,355 INFO L232 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] [2023-11-30 02:35:30,356 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:35:30,359 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:35:30,359 INFO L85 PathProgramCache]: Analyzing trace with hash 623238587, now seen corresponding path program 1 times [2023-11-30 02:35:30,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:35:30,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409986275] [2023-11-30 02:35:30,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:35:30,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:35:30,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:35:30,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:35:30,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:35:30,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409986275] [2023-11-30 02:35:30,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409986275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:35:30,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:35:30,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:35:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982419878] [2023-11-30 02:35:30,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:35:30,605 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:35:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:35:30,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:35:30,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:35:30,624 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 227 [2023-11-30 02:35:30,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:30,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:35:30,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 227 [2023-11-30 02:35:30,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:35:35,278 INFO L124 PetriNetUnfolderBase]: 13544/40167 cut-off events. [2023-11-30 02:35:35,279 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-11-30 02:35:35,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59324 conditions, 40167 events. 13544/40167 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 1306. Compared 518624 event pairs, 10756 based on Foata normal form. 3492/37046 useless extension candidates. Maximal degree in co-relation 59277. Up to 16129 conditions per place. [2023-11-30 02:35:35,578 INFO L140 encePairwiseOnDemand]: 212/227 looper letters, 50 selfloop transitions, 6 changer transitions 0/227 dead transitions. [2023-11-30 02:35:35,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 227 transitions, 581 flow [2023-11-30 02:35:35,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:35:35,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:35:35,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2023-11-30 02:35:35,592 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.908957415565345 [2023-11-30 02:35:35,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 619 transitions. [2023-11-30 02:35:35,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 619 transitions. [2023-11-30 02:35:35,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:35:35,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 619 transitions. [2023-11-30 02:35:35,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:35,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:35,607 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:35,611 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, -10 predicate places. [2023-11-30 02:35:35,611 INFO L500 AbstractCegarLoop]: Abstraction has has 215 places, 227 transitions, 581 flow [2023-11-30 02:35:35,611 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:35,612 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:35:35,612 INFO L232 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] [2023-11-30 02:35:35,612 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 02:35:35,612 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:35:35,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:35:35,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1644037218, now seen corresponding path program 1 times [2023-11-30 02:35:35,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:35:35,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792733554] [2023-11-30 02:35:35,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:35:35,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:35:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:35:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:35:35,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:35:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792733554] [2023-11-30 02:35:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792733554] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:35:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:35:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:35:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502335810] [2023-11-30 02:35:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:35:35,729 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:35:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:35:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:35:35,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:35:35,731 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 227 [2023-11-30 02:35:35,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 227 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:35,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:35:35,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 227 [2023-11-30 02:35:35,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:35:39,969 INFO L124 PetriNetUnfolderBase]: 16301/51973 cut-off events. [2023-11-30 02:35:39,969 INFO L125 PetriNetUnfolderBase]: For 5886/22924 co-relation queries the response was YES. [2023-11-30 02:35:40,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97853 conditions, 51973 events. 16301/51973 cut-off events. For 5886/22924 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 725004 event pairs, 4534 based on Foata normal form. 152/46494 useless extension candidates. Maximal degree in co-relation 97804. Up to 19340 conditions per place. [2023-11-30 02:35:40,458 INFO L140 encePairwiseOnDemand]: 217/227 looper letters, 82 selfloop transitions, 13 changer transitions 0/269 dead transitions. [2023-11-30 02:35:40,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 269 transitions, 945 flow [2023-11-30 02:35:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:35:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:35:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 611 transitions. [2023-11-30 02:35:40,459 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8972099853157122 [2023-11-30 02:35:40,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 611 transitions. [2023-11-30 02:35:40,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 611 transitions. [2023-11-30 02:35:40,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:35:40,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 611 transitions. [2023-11-30 02:35:40,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:40,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:40,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:40,463 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, -8 predicate places. [2023-11-30 02:35:40,464 INFO L500 AbstractCegarLoop]: Abstraction has has 217 places, 269 transitions, 945 flow [2023-11-30 02:35:40,464 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.0) internal successors, (558), 3 states have internal predecessors, (558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:40,464 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:35:40,464 INFO L232 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] [2023-11-30 02:35:40,464 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-30 02:35:40,465 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:35:40,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:35:40,466 INFO L85 PathProgramCache]: Analyzing trace with hash -825961456, now seen corresponding path program 1 times [2023-11-30 02:35:40,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:35:40,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501914005] [2023-11-30 02:35:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:35:40,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:35:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:35:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:35:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:35:40,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501914005] [2023-11-30 02:35:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501914005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:35:40,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:35:40,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:35:40,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41134168] [2023-11-30 02:35:40,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:35:40,567 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:35:40,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:35:40,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:35:40,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:35:40,570 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 227 [2023-11-30 02:35:40,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 269 transitions, 945 flow. Second operand has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:35:40,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:35:40,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 227 [2023-11-30 02:35:40,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:35:46,769 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][219], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 47#L692-4true, 6#L706-1true, 239#true, 92#L731-1true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:35:46,769 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-30 02:35:46,769 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:35:46,769 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:35:46,770 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:35:47,222 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][219], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#L731-2true, 47#L692-4true, 6#L706-1true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:35:47,222 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-30 02:35:47,222 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:35:47,222 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:35:47,222 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:35:48,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][216], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 122#L705-2true, 71#L693-3true, 239#true, 237#(= |#race~g~0| 0), 202#L732-2true]) [2023-11-30 02:35:48,360 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,360 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,360 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,360 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][216], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 71#L693-3true, 239#true, 237#(= |#race~g~0| 0), 209#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-30 02:35:48,361 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:35:48,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][113], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 6#L706-1true, 62#L693true, 239#true, 202#L732-2true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:35:48,897 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,897 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,897 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,897 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][113], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 6#L706-1true, 62#L693true, 239#true, 237#(= |#race~g~0| 0), 209#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-30 02:35:48,897 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,898 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,898 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,898 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][122], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 122#L705-2true, 62#L693true, 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:35:48,903 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,903 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,903 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:35:48,904 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:00,664 INFO L124 PetriNetUnfolderBase]: 89948/200525 cut-off events. [2023-11-30 02:36:00,664 INFO L125 PetriNetUnfolderBase]: For 159699/218832 co-relation queries the response was YES. [2023-11-30 02:36:01,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463063 conditions, 200525 events. 89948/200525 cut-off events. For 159699/218832 co-relation queries the response was YES. Maximal size of possible extension queue 7251. Compared 2775438 event pairs, 41126 based on Foata normal form. 697/169551 useless extension candidates. Maximal degree in co-relation 463012. Up to 99885 conditions per place. [2023-11-30 02:36:02,561 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 104 selfloop transitions, 6 changer transitions 0/303 dead transitions. [2023-11-30 02:36:02,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 303 transitions, 1334 flow [2023-11-30 02:36:02,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:36:02,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:36:02,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-11-30 02:36:02,590 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8766519823788547 [2023-11-30 02:36:02,590 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-11-30 02:36:02,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-11-30 02:36:02,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:36:02,590 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-11-30 02:36:02,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:02,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:02,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:02,609 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, -6 predicate places. [2023-11-30 02:36:02,609 INFO L500 AbstractCegarLoop]: Abstraction has has 219 places, 303 transitions, 1334 flow [2023-11-30 02:36:02,609 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.0) internal successors, (543), 3 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:02,609 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:36:02,609 INFO L232 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] [2023-11-30 02:36:02,610 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-30 02:36:02,610 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:36:02,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:36:02,610 INFO L85 PathProgramCache]: Analyzing trace with hash -2000322915, now seen corresponding path program 1 times [2023-11-30 02:36:02,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:36:02,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553484224] [2023-11-30 02:36:02,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:36:02,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:36:02,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:36:02,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:36:02,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:36:02,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553484224] [2023-11-30 02:36:02,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553484224] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:36:02,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:36:02,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:36:02,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450098556] [2023-11-30 02:36:02,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:36:02,654 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:36:02,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:36:02,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:36:02,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:36:02,655 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 227 [2023-11-30 02:36:02,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 303 transitions, 1334 flow. Second operand has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:02,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:36:02,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 227 [2023-11-30 02:36:02,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:36:09,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][235], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t3_funThread1of1ForFork2InUse, 231#true, 47#L692-4true, 6#L706-1true, 245#(= |#race~h~0| 0), 239#true, 92#L731-1true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:09,762 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-30 02:36:09,762 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:09,762 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:09,763 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:10,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][235], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#L731-2true, 47#L692-4true, 6#L706-1true, 245#(= |#race~h~0| 0), 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:10,757 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-30 02:36:10,757 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:10,757 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:10,757 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:12,102 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][280], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 122#L705-2true, 245#(= |#race~h~0| 0), 71#L693-3true, 239#true, 237#(= |#race~g~0| 0), 202#L732-2true]) [2023-11-30 02:36:12,102 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 02:36:12,102 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:12,102 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:12,103 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:12,953 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][124], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 122#L705-2true, 62#L693true, 245#(= |#race~h~0| 0), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:12,953 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 02:36:12,953 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:12,953 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:12,953 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:13,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][203], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 6#L706-1true, 62#L693true, 245#(= |#race~h~0| 0), 239#true, 202#L732-2true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:13,618 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2023-11-30 02:36:13,618 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:13,618 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:13,618 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:19,906 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][232], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 243#true, 71#L693-3true, 43#L716-1true, 239#true, 54#L735-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:19,906 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,906 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,906 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,906 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,919 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][232], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 78#L705-1true, 243#true, 66#L716-2true, 71#L693-3true, 239#true, 54#L735-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:19,919 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,919 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,919 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,919 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:19,921 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L717-->L717-1: Formula: (= |v_#race~h~0_4| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_4|} AuxVars[] AssignedVars[#race~h~0][162], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 78#L705-1true, 62#L693true, 245#(= |#race~h~0| 0), 239#true, 54#L735-3true, 237#(= |#race~g~0| 0), 212#L717-1true]) [2023-11-30 02:36:19,921 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-30 02:36:19,921 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:19,921 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:19,921 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,126 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][232], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 66#L716-2true, 71#L693-3true, 239#true, 54#L735-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:21,126 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,128 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,128 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,128 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][378], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 243#true, 62#L693true, 43#L716-1true, 239#true, 121#L736-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:21,128 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,128 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,129 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,129 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][378], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 78#L705-1true, 243#true, 62#L693true, 66#L716-2true, 239#true, 121#L736-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:21,140 INFO L294 olderBase$Statistics]: this new event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,140 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,141 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:21,141 INFO L297 olderBase$Statistics]: existing Event has 119 ancestors and is cut-off event [2023-11-30 02:36:22,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L717-->L717-1: Formula: (= |v_#race~h~0_4| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_4|} AuxVars[] AssignedVars[#race~h~0][162], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 62#L693true, 245#(= |#race~h~0| 0), 239#true, 54#L735-3true, 237#(= |#race~g~0| 0), 212#L717-1true]) [2023-11-30 02:36:22,050 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,050 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,050 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,050 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][378], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 66#L716-2true, 62#L693true, 239#true, 121#L736-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:22,051 INFO L294 olderBase$Statistics]: this new event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,051 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,051 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:22,051 INFO L297 olderBase$Statistics]: existing Event has 120 ancestors and is cut-off event [2023-11-30 02:36:32,645 INFO L124 PetriNetUnfolderBase]: 111153/286342 cut-off events. [2023-11-30 02:36:32,645 INFO L125 PetriNetUnfolderBase]: For 316823/409947 co-relation queries the response was YES. [2023-11-30 02:36:34,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 762200 conditions, 286342 events. 111153/286342 cut-off events. For 316823/409947 co-relation queries the response was YES. Maximal size of possible extension queue 10013. Compared 4475098 event pairs, 28095 based on Foata normal form. 994/256120 useless extension candidates. Maximal degree in co-relation 762147. Up to 123206 conditions per place. [2023-11-30 02:36:35,489 INFO L140 encePairwiseOnDemand]: 216/227 looper letters, 174 selfloop transitions, 14 changer transitions 0/384 dead transitions. [2023-11-30 02:36:35,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 384 transitions, 2308 flow [2023-11-30 02:36:35,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:36:35,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:36:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2023-11-30 02:36:35,492 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8928046989720999 [2023-11-30 02:36:35,492 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 608 transitions. [2023-11-30 02:36:35,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 608 transitions. [2023-11-30 02:36:35,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:36:35,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 608 transitions. [2023-11-30 02:36:35,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 202.66666666666666) internal successors, (608), 3 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:35,494 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:35,495 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:35,495 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, -4 predicate places. [2023-11-30 02:36:35,495 INFO L500 AbstractCegarLoop]: Abstraction has has 221 places, 384 transitions, 2308 flow [2023-11-30 02:36:35,496 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.0) internal successors, (549), 3 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:35,496 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:36:35,496 INFO L232 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] [2023-11-30 02:36:35,496 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 02:36:35,496 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:36:35,496 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:36:35,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1570516445, now seen corresponding path program 1 times [2023-11-30 02:36:35,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:36:35,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193682410] [2023-11-30 02:36:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:36:35,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:36:35,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:36:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:36:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:36:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193682410] [2023-11-30 02:36:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193682410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:36:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:36:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-30 02:36:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043755705] [2023-11-30 02:36:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:36:35,611 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:36:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:36:35,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:36:35,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:36:35,612 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 227 [2023-11-30 02:36:35,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 384 transitions, 2308 flow. Second operand has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:36:35,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:36:35,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 227 [2023-11-30 02:36:35,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:36:43,012 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][237], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, t3_funThread1of1ForFork2InUse, 231#true, 47#L692-4true, 6#L706-1true, 245#(= |#race~h~0| 0), 239#true, 92#L731-1true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:43,020 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is not cut-off event [2023-11-30 02:36:43,020 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:43,020 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:43,020 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is not cut-off event [2023-11-30 02:36:43,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][237], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 231#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 3#L731-2true, 6#L706-1true, 47#L692-4true, 245#(= |#race~h~0| 0), 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:43,578 INFO L294 olderBase$Statistics]: this new event has 106 ancestors and is not cut-off event [2023-11-30 02:36:43,578 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:43,578 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:43,578 INFO L297 olderBase$Statistics]: existing Event has 106 ancestors and is not cut-off event [2023-11-30 02:36:45,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([657] L693-->L693-3: Formula: (and (= (store |v_#pthreadsMutex_134| |v_~#A~0.base_47| (store (select |v_#pthreadsMutex_134| |v_~#A~0.base_47|) |v_~#A~0.offset_47| 0)) |v_#pthreadsMutex_133|) (= |v_t_funThread1of1ForFork0_#t~nondet6_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_134|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_133|, ~#A~0.offset=|v_~#A~0.offset_47|, ~#A~0.base=|v_~#A~0.base_47|, t_funThread1of1ForFork0_#t~nondet6=|v_t_funThread1of1ForFork0_#t~nondet6_1|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_#t~nondet6][284], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 231#true, 122#L705-2true, 245#(= |#race~h~0| 0), 71#L693-3true, 239#true, 202#L732-2true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:45,501 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-30 02:36:45,501 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:45,501 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:45,501 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-30 02:36:46,226 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][124], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, 231#true, t3_funThread1of1ForFork2InUse, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 122#L705-2true, 62#L693true, 245#(= |#race~h~0| 0), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:46,227 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-30 02:36:46,227 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:46,227 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:46,227 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-30 02:36:47,435 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([569] L706-->L706-1: Formula: (= |v_#race~h~0_1| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_1|} AuxVars[] AssignedVars[#race~h~0][203], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 231#true, 59#t3_funErr0ASSERT_VIOLATIONDATA_RACEtrue, 6#L706-1true, 62#L693true, 245#(= |#race~h~0| 0), 239#true, 202#L732-2true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:47,436 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is not cut-off event [2023-11-30 02:36:47,436 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:47,436 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:47,436 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is not cut-off event [2023-11-30 02:36:51,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][385], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 102#L695-3true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 245#(= |#race~h~0| 0), 43#L716-1true, 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:51,490 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-30 02:36:51,491 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:51,491 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:51,491 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:52,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][363], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 102#L695-3true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 43#L716-1true, 239#true, 82#L733-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:52,755 INFO L294 olderBase$Statistics]: this new event has 116 ancestors and is cut-off event [2023-11-30 02:36:52,755 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:52,756 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:52,756 INFO L297 olderBase$Statistics]: existing Event has 116 ancestors and is cut-off event [2023-11-30 02:36:52,759 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][385], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 169#L695-4true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 43#L716-1true, 245#(= |#race~h~0| 0), 239#true, 82#L733-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:52,759 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,760 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,760 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,760 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][124], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 21#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 43#L716-1true, 245#(= |#race~h~0| 0), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:52,766 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,766 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,766 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:52,766 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][363], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 169#L695-4true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 43#L716-1true, 239#true, 82#L733-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:53,640 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][363], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 102#L695-3true, 66#L716-2true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:53,640 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,640 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][385], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 102#L695-3true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 66#L716-2true, 245#(= |#race~h~0| 0), 239#true, 82#L733-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:53,644 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,644 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,644 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,644 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,647 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L696-->L696-3: Formula: (and (= |v_t_funThread1of1ForFork0_#t~nondet9_1| 0) (= |v_#pthreadsMutex_117| (store |v_#pthreadsMutex_118| |v_~#A~0.base_43| (store (select |v_#pthreadsMutex_118| |v_~#A~0.base_43|) |v_~#A~0.offset_43| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_118|, ~#A~0.offset=|v_~#A~0.offset_43|, ~#A~0.base=|v_~#A~0.base_43|} OutVars{t_funThread1of1ForFork0_#t~nondet9=|v_t_funThread1of1ForFork0_#t~nondet9_1|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#A~0.offset=|v_~#A~0.offset_43|, ~#A~0.base=|v_~#A~0.base_43|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet9, #pthreadsMutex][338], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, 181#L696-3true, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 243#true, 43#L716-1true, 239#true, 237#(= |#race~g~0| 0), 209#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue]) [2023-11-30 02:36:53,647 INFO L294 olderBase$Statistics]: this new event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,647 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,647 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:53,647 INFO L297 olderBase$Statistics]: existing Event has 117 ancestors and is cut-off event [2023-11-30 02:36:54,794 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][363], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 169#L695-4true, 66#L716-2true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:54,794 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,794 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,794 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,794 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][385], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 169#L695-4true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 66#L716-2true, 245#(= |#race~h~0| 0), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:54,798 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,798 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,798 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,798 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([667] L696-->L696-3: Formula: (and (= |v_t_funThread1of1ForFork0_#t~nondet9_1| 0) (= |v_#pthreadsMutex_117| (store |v_#pthreadsMutex_118| |v_~#A~0.base_43| (store (select |v_#pthreadsMutex_118| |v_~#A~0.base_43|) |v_~#A~0.offset_43| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_118|, ~#A~0.offset=|v_~#A~0.offset_43|, ~#A~0.base=|v_~#A~0.base_43|} OutVars{t_funThread1of1ForFork0_#t~nondet9=|v_t_funThread1of1ForFork0_#t~nondet9_1|, #pthreadsMutex=|v_#pthreadsMutex_117|, ~#A~0.offset=|v_~#A~0.offset_43|, ~#A~0.base=|v_~#A~0.base_43|} AuxVars[] AssignedVars[t_funThread1of1ForFork0_#t~nondet9, #pthreadsMutex][338], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 181#L696-3true, 231#true, 122#L705-2true, 243#true, 66#L716-2true, 239#true, 209#ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACEtrue, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:54,803 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,803 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,803 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,803 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,806 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([415] L733-->L733-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_94| |v_~#B~0.base_23|))) (and (= |v_#pthreadsMutex_93| (store |v_#pthreadsMutex_94| |v_~#B~0.base_23| (store .cse0 |v_~#B~0.offset_23| 1))) (= |v_ULTIMATE.start_main_#t~nondet30#1_7| 0) (= (select .cse0 |v_~#B~0.offset_23|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_94|, ~#B~0.base=|v_~#B~0.base_23|, ~#B~0.offset=|v_~#B~0.offset_23|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_93|, ~#B~0.base=|v_~#B~0.base_23|, ULTIMATE.start_main_#t~nondet30#1=|v_ULTIMATE.start_main_#t~nondet30#1_7|, ~#B~0.offset=|v_~#B~0.offset_23|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet30#1][124], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 21#t_funErr2ASSERT_VIOLATIONDATA_RACEtrue, 66#L716-2true, 245#(= |#race~h~0| 0), 82#L733-3true, 239#true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:36:54,807 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,807 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,807 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:36:54,807 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2023-11-30 02:37:05,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][433], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 122#L705-2true, 243#true, 169#L695-4true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 43#L716-1true, 239#true, 237#(= |#race~g~0| 0), 121#L736-3true]) [2023-11-30 02:37:05,864 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,864 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,881 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][433], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 231#true, t3_funThread1of1ForFork2InUse, 78#L705-1true, 243#true, 169#L695-4true, 66#L716-2true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 239#true, 121#L736-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:37:05,881 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,881 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,881 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:05,881 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-30 02:37:06,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L736-->L736-3: Formula: (and (= |v_#pthreadsMutex_109| (store |v_#pthreadsMutex_110| |v_~#A~0.base_39| (store (select |v_#pthreadsMutex_110| |v_~#A~0.base_39|) |v_~#A~0.offset_39| 0))) (= |v_ULTIMATE.start_main_#t~nondet32#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_110|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_109|, ULTIMATE.start_main_#t~nondet32#1=|v_ULTIMATE.start_main_#t~nondet32#1_7|, ~#A~0.offset=|v_~#A~0.offset_39|, ~#A~0.base=|v_~#A~0.base_39|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_main_#t~nondet32#1][433], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 243#true, 169#L695-4true, 66#L716-2true, 249#(= |t_funThread1of1ForFork0_#t~nondet8| |#race~h~0|), 239#true, 121#L736-3true, 237#(= |#race~g~0| 0)]) [2023-11-30 02:37:06,742 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is cut-off event [2023-11-30 02:37:06,742 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 02:37:06,742 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 02:37:06,742 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2023-11-30 02:37:06,758 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L717-->L717-1: Formula: (= |v_#race~h~0_4| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_4|} AuxVars[] AssignedVars[#race~h~0][410], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 231#true, 78#L705-1true, 169#L695-4true, 245#(= |#race~h~0| 0), 239#true, 54#L735-3true, 237#(= |#race~g~0| 0), 212#L717-1true]) [2023-11-30 02:37:06,759 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is not cut-off event [2023-11-30 02:37:06,759 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 02:37:06,759 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 02:37:06,759 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is not cut-off event [2023-11-30 02:37:07,236 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([608] L717-->L717-1: Formula: (= |v_#race~h~0_4| 0) InVars {} OutVars{#race~h~0=|v_#race~h~0_4|} AuxVars[] AssignedVars[#race~h~0][410], [t_funThread1of1ForFork0InUse, t2_funThread1of1ForFork1InUse, 247#true, t3_funThread1of1ForFork2InUse, 231#true, 122#L705-2true, 169#L695-4true, 245#(= |#race~h~0| 0), 239#true, 54#L735-3true, 237#(= |#race~g~0| 0), 212#L717-1true]) [2023-11-30 02:37:07,237 INFO L294 olderBase$Statistics]: this new event has 128 ancestors and is not cut-off event [2023-11-30 02:37:07,237 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2023-11-30 02:37:07,237 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2023-11-30 02:37:07,237 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is not cut-off event [2023-11-30 02:37:12,604 INFO L124 PetriNetUnfolderBase]: 127866/327676 cut-off events. [2023-11-30 02:37:12,604 INFO L125 PetriNetUnfolderBase]: For 561365/755374 co-relation queries the response was YES. [2023-11-30 02:37:14,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013765 conditions, 327676 events. 127866/327676 cut-off events. For 561365/755374 co-relation queries the response was YES. Maximal size of possible extension queue 11228. Compared 5181623 event pairs, 31926 based on Foata normal form. 1151/296325 useless extension candidates. Maximal degree in co-relation 1013710. Up to 138235 conditions per place. [2023-11-30 02:37:16,419 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 241 selfloop transitions, 10 changer transitions 0/445 dead transitions. [2023-11-30 02:37:16,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 445 transitions, 3367 flow [2023-11-30 02:37:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:37:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:37:16,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 597 transitions. [2023-11-30 02:37:16,421 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8766519823788547 [2023-11-30 02:37:16,421 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 597 transitions. [2023-11-30 02:37:16,421 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 597 transitions. [2023-11-30 02:37:16,422 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:37:16,422 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 597 transitions. [2023-11-30 02:37:16,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 199.0) internal successors, (597), 3 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:16,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:16,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:16,447 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, -2 predicate places. [2023-11-30 02:37:16,447 INFO L500 AbstractCegarLoop]: Abstraction has has 223 places, 445 transitions, 3367 flow [2023-11-30 02:37:16,448 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:16,448 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:37:16,448 INFO L232 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] [2023-11-30 02:37:16,448 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-30 02:37:16,449 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:37:16,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:37:16,449 INFO L85 PathProgramCache]: Analyzing trace with hash -84295367, now seen corresponding path program 1 times [2023-11-30 02:37:16,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:37:16,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304164920] [2023-11-30 02:37:16,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:37:16,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:37:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:37:16,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:37:16,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:37:16,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304164920] [2023-11-30 02:37:16,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304164920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:37:16,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:37:16,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 02:37:16,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220623071] [2023-11-30 02:37:16,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:37:16,606 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:37:16,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:37:16,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:37:16,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:37:16,607 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 227 [2023-11-30 02:37:16,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 445 transitions, 3367 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:16,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:37:16,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 227 [2023-11-30 02:37:16,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:37:20,609 INFO L124 PetriNetUnfolderBase]: 7832/30627 cut-off events. [2023-11-30 02:37:20,609 INFO L125 PetriNetUnfolderBase]: For 79734/83879 co-relation queries the response was YES. [2023-11-30 02:37:20,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92541 conditions, 30627 events. 7832/30627 cut-off events. For 79734/83879 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 415195 event pairs, 1698 based on Foata normal form. 2794/31696 useless extension candidates. Maximal degree in co-relation 92478. Up to 10701 conditions per place. [2023-11-30 02:37:20,846 INFO L140 encePairwiseOnDemand]: 214/227 looper letters, 126 selfloop transitions, 129 changer transitions 13/516 dead transitions. [2023-11-30 02:37:20,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 516 transitions, 4746 flow [2023-11-30 02:37:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:37:20,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:37:20,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2023-11-30 02:37:20,848 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9001468428781204 [2023-11-30 02:37:20,848 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 613 transitions. [2023-11-30 02:37:20,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 613 transitions. [2023-11-30 02:37:20,848 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:37:20,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 613 transitions. [2023-11-30 02:37:20,849 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:20,851 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:20,851 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:20,855 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, 0 predicate places. [2023-11-30 02:37:20,855 INFO L500 AbstractCegarLoop]: Abstraction has has 225 places, 516 transitions, 4746 flow [2023-11-30 02:37:20,856 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:20,856 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:37:20,856 INFO L232 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] [2023-11-30 02:37:20,856 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 02:37:20,856 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:37:20,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:37:20,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1431982502, now seen corresponding path program 1 times [2023-11-30 02:37:20,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:37:20,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179829233] [2023-11-30 02:37:20,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:37:20,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:37:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:37:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:37:21,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:37:21,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179829233] [2023-11-30 02:37:21,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179829233] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:37:21,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:37:21,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 02:37:21,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486541447] [2023-11-30 02:37:21,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:37:21,038 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 02:37:21,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:37:21,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 02:37:21,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 02:37:21,039 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 227 [2023-11-30 02:37:21,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 516 transitions, 4746 flow. Second operand has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:21,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:37:21,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 227 [2023-11-30 02:37:21,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:37:26,065 INFO L124 PetriNetUnfolderBase]: 9877/36327 cut-off events. [2023-11-30 02:37:26,066 INFO L125 PetriNetUnfolderBase]: For 113932/118357 co-relation queries the response was YES. [2023-11-30 02:37:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123704 conditions, 36327 events. 9877/36327 cut-off events. For 113932/118357 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 494087 event pairs, 2078 based on Foata normal form. 643/35005 useless extension candidates. Maximal degree in co-relation 123633. Up to 13530 conditions per place. [2023-11-30 02:37:26,325 INFO L140 encePairwiseOnDemand]: 216/227 looper letters, 223 selfloop transitions, 135 changer transitions 46/648 dead transitions. [2023-11-30 02:37:26,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 648 transitions, 7424 flow [2023-11-30 02:37:26,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 02:37:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 02:37:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 613 transitions. [2023-11-30 02:37:26,326 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.9001468428781204 [2023-11-30 02:37:26,327 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 613 transitions. [2023-11-30 02:37:26,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 613 transitions. [2023-11-30 02:37:26,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:37:26,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 613 transitions. [2023-11-30 02:37:26,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.33333333333334) internal successors, (613), 3 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:26,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:26,329 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:26,329 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, 2 predicate places. [2023-11-30 02:37:26,329 INFO L500 AbstractCegarLoop]: Abstraction has has 227 places, 648 transitions, 7424 flow [2023-11-30 02:37:26,330 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 195.33333333333334) internal successors, (586), 3 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:26,330 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:37:26,330 INFO L232 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] [2023-11-30 02:37:26,330 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 02:37:26,330 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:37:26,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:37:26,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1650557242, now seen corresponding path program 2 times [2023-11-30 02:37:26,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:37:26,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936414793] [2023-11-30 02:37:26,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:37:26,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:37:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:37:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:37:26,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:37:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936414793] [2023-11-30 02:37:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936414793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:37:26,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:37:26,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 02:37:26,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800930464] [2023-11-30 02:37:26,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:37:26,510 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 02:37:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:37:26,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 02:37:26,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-30 02:37:26,511 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 227 [2023-11-30 02:37:26,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 648 transitions, 7424 flow. Second operand has 5 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:26,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:37:26,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 227 [2023-11-30 02:37:26,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:37:28,624 INFO L124 PetriNetUnfolderBase]: 3613/17567 cut-off events. [2023-11-30 02:37:28,625 INFO L125 PetriNetUnfolderBase]: For 67041/68135 co-relation queries the response was YES. [2023-11-30 02:37:29,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55181 conditions, 17567 events. 3613/17567 cut-off events. For 67041/68135 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 221137 event pairs, 886 based on Foata normal form. 797/17369 useless extension candidates. Maximal degree in co-relation 55096. Up to 5557 conditions per place. [2023-11-30 02:37:29,079 INFO L140 encePairwiseOnDemand]: 219/227 looper letters, 195 selfloop transitions, 41 changer transitions 19/475 dead transitions. [2023-11-30 02:37:29,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 475 transitions, 5379 flow [2023-11-30 02:37:29,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 02:37:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 02:37:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 960 transitions. [2023-11-30 02:37:29,081 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8458149779735683 [2023-11-30 02:37:29,081 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 960 transitions. [2023-11-30 02:37:29,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 960 transitions. [2023-11-30 02:37:29,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:37:29,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 960 transitions. [2023-11-30 02:37:29,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.0) internal successors, (960), 5 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,098 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,098 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, 4 predicate places. [2023-11-30 02:37:29,099 INFO L500 AbstractCegarLoop]: Abstraction has has 229 places, 475 transitions, 5379 flow [2023-11-30 02:37:29,099 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.4) internal successors, (942), 5 states have internal predecessors, (942), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,099 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 02:37:29,099 INFO L232 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] [2023-11-30 02:37:29,099 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-30 02:37:29,099 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t3_funErr0ASSERT_VIOLATIONDATA_RACE, t3_funErr1ASSERT_VIOLATIONDATA_RACE (and 15 more)] === [2023-11-30 02:37:29,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 02:37:29,099 INFO L85 PathProgramCache]: Analyzing trace with hash -352179646, now seen corresponding path program 3 times [2023-11-30 02:37:29,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 02:37:29,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676499497] [2023-11-30 02:37:29,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 02:37:29,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 02:37:29,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 02:37:29,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 02:37:29,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 02:37:29,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676499497] [2023-11-30 02:37:29,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676499497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 02:37:29,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 02:37:29,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-30 02:37:29,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183785109] [2023-11-30 02:37:29,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 02:37:29,385 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 02:37:29,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 02:37:29,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 02:37:29,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-30 02:37:29,386 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 227 [2023-11-30 02:37:29,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 475 transitions, 5379 flow. Second operand has 6 states, 6 states have (on average 187.66666666666666) internal successors, (1126), 6 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 02:37:29,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 227 [2023-11-30 02:37:29,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 02:37:29,815 INFO L124 PetriNetUnfolderBase]: 393/3227 cut-off events. [2023-11-30 02:37:29,815 INFO L125 PetriNetUnfolderBase]: For 16290/16706 co-relation queries the response was YES. [2023-11-30 02:37:29,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11172 conditions, 3227 events. 393/3227 cut-off events. For 16290/16706 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 30779 event pairs, 110 based on Foata normal form. 144/3273 useless extension candidates. Maximal degree in co-relation 11073. Up to 967 conditions per place. [2023-11-30 02:37:29,832 INFO L140 encePairwiseOnDemand]: 215/227 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2023-11-30 02:37:29,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 287 transitions, 2746 flow [2023-11-30 02:37:29,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 02:37:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 02:37:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 961 transitions. [2023-11-30 02:37:29,849 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8466960352422908 [2023-11-30 02:37:29,849 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 961 transitions. [2023-11-30 02:37:29,849 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 961 transitions. [2023-11-30 02:37:29,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 02:37:29,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 961 transitions. [2023-11-30 02:37:29,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 192.2) internal successors, (961), 5 states have internal predecessors, (961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,853 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,853 INFO L307 CegarLoopForPetriNet]: 225 programPoint places, 1 predicate places. [2023-11-30 02:37:29,853 INFO L500 AbstractCegarLoop]: Abstraction has has 226 places, 287 transitions, 2746 flow [2023-11-30 02:37:29,853 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.66666666666666) internal successors, (1126), 6 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 02:37:29,858 INFO L143 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/36-apron_21-traces-cluster-based_true.i_BEv2_AllErrorsAtOnce [2023-11-30 02:37:29,918 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2023-11-30 02:37:29,919 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t3_funErr1ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2023-11-30 02:37:29,921 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 19 remaining) [2023-11-30 02:37:29,922 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2023-11-30 02:37:29,922 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2023-11-30 02:37:29,922 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t3_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2023-11-30 02:37:29,922 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t3_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2023-11-30 02:37:29,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2023-11-30 02:37:29,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2023-11-30 02:37:29,923 INFO L810 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2023-11-30 02:37:29,923 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-30 02:37:29,923 INFO L457 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-11-30 02:37:29,939 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 02:37:29,939 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 02:37:29,945 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 02:37:29 BasicIcfg [2023-11-30 02:37:29,945 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 02:37:29,945 INFO L158 Benchmark]: Toolchain (without parser) took 120731.62ms. Allocated memory was 335.5MB in the beginning and 15.9GB in the end (delta: 15.6GB). Free memory was 282.4MB in the beginning and 14.5GB in the end (delta: -14.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-30 02:37:29,945 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 335.5MB. Free memory is still 285.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 02:37:29,946 INFO L158 Benchmark]: CACSL2BoogieTranslator took 394.48ms. Allocated memory is still 335.5MB. Free memory was 282.4MB in the beginning and 261.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-11-30 02:37:29,946 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 335.5MB. Free memory was 261.7MB in the beginning and 259.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:37:29,947 INFO L158 Benchmark]: Boogie Preprocessor took 35.60ms. Allocated memory is still 335.5MB. Free memory was 259.3MB in the beginning and 257.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 02:37:29,947 INFO L158 Benchmark]: RCFGBuilder took 429.61ms. Allocated memory was 335.5MB in the beginning and 507.5MB in the end (delta: 172.0MB). Free memory was 257.5MB in the beginning and 463.3MB in the end (delta: -205.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.0GB. [2023-11-30 02:37:29,947 INFO L158 Benchmark]: TraceAbstraction took 119818.77ms. Allocated memory was 507.5MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 462.2MB in the beginning and 14.5GB in the end (delta: -14.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. [2023-11-30 02:37:29,948 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 335.5MB. Free memory is still 285.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 394.48ms. Allocated memory is still 335.5MB. Free memory was 282.4MB in the beginning and 261.7MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 335.5MB. Free memory was 261.7MB in the beginning and 259.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 35.60ms. Allocated memory is still 335.5MB. Free memory was 259.3MB in the beginning and 257.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 429.61ms. Allocated memory was 335.5MB in the beginning and 507.5MB in the end (delta: 172.0MB). Free memory was 257.5MB in the beginning and 463.3MB in the end (delta: -205.7MB). Peak memory consumption was 22.2MB. Max. memory is 16.0GB. * TraceAbstraction took 119818.77ms. Allocated memory was 507.5MB in the beginning and 15.9GB in the end (delta: 15.4GB). Free memory was 462.2MB in the beginning and 14.5GB in the end (delta: -14.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 705]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 706]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 731]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 732]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 692]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 337 locations, 19 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 119.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 118.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 185 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 185 mSDsluCounter, 99 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 572 IncrementalHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 98 mSDtfsCounter, 572 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7424occurred in iteration=7, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 641 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 632 ConstructedInterpolants, 0 QuantifiedInterpolants, 1552 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2023-11-30 02:37:29,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...