/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true --cacsl2boogietranslator.check.unreachability.of.reach_error.function false -i ../../../trunk/examples/svcomp/weaver/chl-time-subst.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 00:58:42,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 00:58:42,515 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 [2025-03-15 00:58:42,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 00:58:42,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 00:58:42,585 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 00:58:42,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 00:58:42,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 00:58:42,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 00:58:42,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 00:58:42,593 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:42,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 00:58:42,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All 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 [2025-03-15 00:58:42,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 00:58:42,925 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 00:58:42,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 00:58:42,928 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 00:58:42,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 00:58:42,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-03-15 00:58:44,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1d726eb/5b8ebfa2ea7842d292d6b2f575c361d0/FLAG4f5333649 [2025-03-15 00:58:44,365 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 00:58:44,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-time-subst.wvr.c [2025-03-15 00:58:44,375 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1d726eb/5b8ebfa2ea7842d292d6b2f575c361d0/FLAG4f5333649 [2025-03-15 00:58:44,395 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a1d726eb/5b8ebfa2ea7842d292d6b2f575c361d0 [2025-03-15 00:58:44,396 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 00:58:44,398 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 00:58:44,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:44,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 00:58:44,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 00:58:44,411 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,412 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a8262ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44, skipping insertion in model container [2025-03-15 00:58:44,412 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,433 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 00:58:44,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:44,616 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 00:58:44,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 00:58:44,644 INFO L204 MainTranslator]: Completed translation [2025-03-15 00:58:44,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44 WrapperNode [2025-03-15 00:58:44,645 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 00:58:44,645 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:44,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 00:58:44,646 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 00:58:44,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,658 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,674 INFO L138 Inliner]: procedures = 22, calls = 25, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 323 [2025-03-15 00:58:44,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 00:58:44,675 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 00:58:44,675 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 00:58:44,675 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 00:58:44,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,682 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,684 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,689 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,690 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,696 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,702 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 00:58:44,703 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 00:58:44,703 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 00:58:44,703 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 00:58:44,704 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (1/1) ... [2025-03-15 00:58:44,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 00:58:44,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 00:58:44,729 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) [2025-03-15 00:58:44,735 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 [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 00:58:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 00:58:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 00:58:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 00:58:44,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 00:58:44,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 00:58:44,752 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 00:58:44,835 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 00:58:44,836 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 00:58:45,315 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 00:58:45,315 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 00:58:45,677 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 00:58:45,677 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 00:58:45,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:45 BoogieIcfgContainer [2025-03-15 00:58:45,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 00:58:45,682 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 00:58:45,682 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 00:58:45,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 00:58:45,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 12:58:44" (1/3) ... [2025-03-15 00:58:45,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfaa772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:45, skipping insertion in model container [2025-03-15 00:58:45,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 12:58:44" (2/3) ... [2025-03-15 00:58:45,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfaa772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 12:58:45, skipping insertion in model container [2025-03-15 00:58:45,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 12:58:45" (3/3) ... [2025-03-15 00:58:45,690 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-time-subst.wvr.c [2025-03-15 00:58:45,706 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 00:58:45,707 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-time-subst.wvr.c that has 4 procedures, 200 locations, 1 initial locations, 0 loop locations, and 38 error locations. [2025-03-15 00:58:45,708 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 00:58:45,797 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 00:58:45,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 00:58:45,845 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@a55f63f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 00:58:45,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2025-03-15 00:58:45,869 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 00:58:45,869 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-15 00:58:45,870 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 00:58:45,871 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:45,871 INFO L221 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] [2025-03-15 00:58:45,871 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:45,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:45,876 INFO L85 PathProgramCache]: Analyzing trace with hash -2016469577, now seen corresponding path program 1 times [2025-03-15 00:58:45,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:45,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570544532] [2025-03-15 00:58:45,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:45,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570544532] [2025-03-15 00:58:46,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570544532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134014987] [2025-03-15 00:58:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,041 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 202 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,163 INFO L124 PetriNetUnfolderBase]: 17/213 cut-off events. [2025-03-15 00:58:46,164 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-15 00:58:46,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 213 events. 17/213 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 15 based on Foata normal form. 2/195 useless extension candidates. Maximal degree in co-relation 150. Up to 40 conditions per place. [2025-03-15 00:58:46,171 INFO L140 encePairwiseOnDemand]: 173/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/166 dead transitions. [2025-03-15 00:58:46,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 166 transitions, 378 flow [2025-03-15 00:58:46,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2025-03-15 00:58:46,181 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8597359735973598 [2025-03-15 00:58:46,183 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -33 predicate places. [2025-03-15 00:58:46,183 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 166 transitions, 378 flow [2025-03-15 00:58:46,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,183 INFO L221 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] [2025-03-15 00:58:46,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 00:58:46,184 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1417570411, now seen corresponding path program 1 times [2025-03-15 00:58:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430264529] [2025-03-15 00:58:46,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430264529] [2025-03-15 00:58:46,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430264529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175981147] [2025-03-15 00:58:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,234 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 166 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,303 INFO L124 PetriNetUnfolderBase]: 17/212 cut-off events. [2025-03-15 00:58:46,303 INFO L125 PetriNetUnfolderBase]: For 56/70 co-relation queries the response was YES. [2025-03-15 00:58:46,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 212 events. 17/212 cut-off events. For 56/70 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 162. Up to 40 conditions per place. [2025-03-15 00:58:46,307 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/165 dead transitions. [2025-03-15 00:58:46,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 165 transitions, 404 flow [2025-03-15 00:58:46,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:46,309 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-15 00:58:46,309 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -32 predicate places. [2025-03-15 00:58:46,309 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 165 transitions, 404 flow [2025-03-15 00:58:46,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,310 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,310 INFO L221 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] [2025-03-15 00:58:46,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 00:58:46,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1870206582, now seen corresponding path program 1 times [2025-03-15 00:58:46,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103277484] [2025-03-15 00:58:46,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103277484] [2025-03-15 00:58:46,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103277484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470647720] [2025-03-15 00:58:46,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 165 transitions, 404 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,421 INFO L124 PetriNetUnfolderBase]: 17/211 cut-off events. [2025-03-15 00:58:46,421 INFO L125 PetriNetUnfolderBase]: For 101/129 co-relation queries the response was YES. [2025-03-15 00:58:46,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 362 conditions, 211 events. 17/211 cut-off events. For 101/129 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 244 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 174. Up to 40 conditions per place. [2025-03-15 00:58:46,424 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/164 dead transitions. [2025-03-15 00:58:46,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 164 transitions, 430 flow [2025-03-15 00:58:46,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:46,427 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-15 00:58:46,427 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -31 predicate places. [2025-03-15 00:58:46,428 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 164 transitions, 430 flow [2025-03-15 00:58:46,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,428 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,428 INFO L221 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] [2025-03-15 00:58:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 00:58:46,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1104630724, now seen corresponding path program 1 times [2025-03-15 00:58:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099511216] [2025-03-15 00:58:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099511216] [2025-03-15 00:58:46,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099511216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110289332] [2025-03-15 00:58:46,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,488 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 164 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,553 INFO L124 PetriNetUnfolderBase]: 17/210 cut-off events. [2025-03-15 00:58:46,553 INFO L125 PetriNetUnfolderBase]: For 161/203 co-relation queries the response was YES. [2025-03-15 00:58:46,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403 conditions, 210 events. 17/210 cut-off events. For 161/203 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 186. Up to 40 conditions per place. [2025-03-15 00:58:46,555 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/163 dead transitions. [2025-03-15 00:58:46,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 163 transitions, 456 flow [2025-03-15 00:58:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:46,557 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-15 00:58:46,559 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -30 predicate places. [2025-03-15 00:58:46,559 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 163 transitions, 456 flow [2025-03-15 00:58:46,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,559 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,559 INFO L221 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] [2025-03-15 00:58:46,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 00:58:46,560 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,561 INFO L85 PathProgramCache]: Analyzing trace with hash -20726739, now seen corresponding path program 1 times [2025-03-15 00:58:46,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289884543] [2025-03-15 00:58:46,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289884543] [2025-03-15 00:58:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289884543] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782966437] [2025-03-15 00:58:46,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,624 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 163 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,682 INFO L124 PetriNetUnfolderBase]: 17/209 cut-off events. [2025-03-15 00:58:46,682 INFO L125 PetriNetUnfolderBase]: For 236/292 co-relation queries the response was YES. [2025-03-15 00:58:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 209 events. 17/209 cut-off events. For 236/292 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 214. Up to 40 conditions per place. [2025-03-15 00:58:46,684 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/162 dead transitions. [2025-03-15 00:58:46,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 162 transitions, 482 flow [2025-03-15 00:58:46,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:46,688 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-15 00:58:46,690 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -29 predicate places. [2025-03-15 00:58:46,690 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 162 transitions, 482 flow [2025-03-15 00:58:46,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,690 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,691 INFO L221 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] [2025-03-15 00:58:46,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 00:58:46,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1439681407, now seen corresponding path program 1 times [2025-03-15 00:58:46,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107468285] [2025-03-15 00:58:46,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107468285] [2025-03-15 00:58:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107468285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885397389] [2025-03-15 00:58:46,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,753 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 202 [2025-03-15 00:58:46,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 162 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 202 [2025-03-15 00:58:46,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,809 INFO L124 PetriNetUnfolderBase]: 17/208 cut-off events. [2025-03-15 00:58:46,809 INFO L125 PetriNetUnfolderBase]: For 326/396 co-relation queries the response was YES. [2025-03-15 00:58:46,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 208 events. 17/208 cut-off events. For 326/396 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 242. Up to 40 conditions per place. [2025-03-15 00:58:46,811 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 12 selfloop transitions, 2 changer transitions 15/161 dead transitions. [2025-03-15 00:58:46,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 161 transitions, 508 flow [2025-03-15 00:58:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 495 transitions. [2025-03-15 00:58:46,813 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168316831683168 [2025-03-15 00:58:46,814 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -28 predicate places. [2025-03-15 00:58:46,814 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 161 transitions, 508 flow [2025-03-15 00:58:46,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,814 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,814 INFO L221 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] [2025-03-15 00:58:46,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 00:58:46,815 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1068391769, now seen corresponding path program 1 times [2025-03-15 00:58:46,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161528156] [2025-03-15 00:58:46,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:46,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:46,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:46,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161528156] [2025-03-15 00:58:46,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161528156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:46,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:46,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:46,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752032269] [2025-03-15 00:58:46,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:46,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:46,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:46,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:46,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:46,871 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 202 [2025-03-15 00:58:46,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 161 transitions, 508 flow. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:46,871 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 202 [2025-03-15 00:58:46,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:46,952 INFO L124 PetriNetUnfolderBase]: 17/207 cut-off events. [2025-03-15 00:58:46,952 INFO L125 PetriNetUnfolderBase]: For 431/515 co-relation queries the response was YES. [2025-03-15 00:58:46,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 529 conditions, 207 events. 17/207 cut-off events. For 431/515 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 247 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 270. Up to 43 conditions per place. [2025-03-15 00:58:46,953 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 15 selfloop transitions, 2 changer transitions 15/160 dead transitions. [2025-03-15 00:58:46,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 160 transitions, 540 flow [2025-03-15 00:58:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:46,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 489 transitions. [2025-03-15 00:58:46,956 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.806930693069307 [2025-03-15 00:58:46,957 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -27 predicate places. [2025-03-15 00:58:46,957 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 160 transitions, 540 flow [2025-03-15 00:58:46,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:46,957 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:46,957 INFO L221 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] [2025-03-15 00:58:46,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 00:58:46,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:46,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:46,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2067475754, now seen corresponding path program 1 times [2025-03-15 00:58:46,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:46,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56952546] [2025-03-15 00:58:46,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:46,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:47,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:47,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56952546] [2025-03-15 00:58:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56952546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364264273] [2025-03-15 00:58:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:47,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:47,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:47,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:47,009 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 202 [2025-03-15 00:58:47,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 160 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:47,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 202 [2025-03-15 00:58:47,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:47,066 INFO L124 PetriNetUnfolderBase]: 17/206 cut-off events. [2025-03-15 00:58:47,067 INFO L125 PetriNetUnfolderBase]: For 551/649 co-relation queries the response was YES. [2025-03-15 00:58:47,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 576 conditions, 206 events. 17/206 cut-off events. For 551/649 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 241 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 298. Up to 46 conditions per place. [2025-03-15 00:58:47,068 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 18 selfloop transitions, 2 changer transitions 15/159 dead transitions. [2025-03-15 00:58:47,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 159 transitions, 578 flow [2025-03-15 00:58:47,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:47,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:47,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-15 00:58:47,069 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7970297029702971 [2025-03-15 00:58:47,070 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -26 predicate places. [2025-03-15 00:58:47,070 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 159 transitions, 578 flow [2025-03-15 00:58:47,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,071 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:47,071 INFO L221 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] [2025-03-15 00:58:47,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 00:58:47,071 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:47,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:47,072 INFO L85 PathProgramCache]: Analyzing trace with hash 191296565, now seen corresponding path program 1 times [2025-03-15 00:58:47,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:47,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594504038] [2025-03-15 00:58:47,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:47,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594504038] [2025-03-15 00:58:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594504038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:47,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:47,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:47,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619280295] [2025-03-15 00:58:47,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:47,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:47,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:47,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:47,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:47,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 202 [2025-03-15 00:58:47,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 159 transitions, 578 flow. Second operand has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:47,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 202 [2025-03-15 00:58:47,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:47,210 INFO L124 PetriNetUnfolderBase]: 17/205 cut-off events. [2025-03-15 00:58:47,210 INFO L125 PetriNetUnfolderBase]: For 686/798 co-relation queries the response was YES. [2025-03-15 00:58:47,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 623 conditions, 205 events. 17/205 cut-off events. For 686/798 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 326. Up to 46 conditions per place. [2025-03-15 00:58:47,212 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 17 selfloop transitions, 2 changer transitions 15/158 dead transitions. [2025-03-15 00:58:47,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 158 transitions, 616 flow [2025-03-15 00:58:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 483 transitions. [2025-03-15 00:58:47,215 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7970297029702971 [2025-03-15 00:58:47,216 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -25 predicate places. [2025-03-15 00:58:47,216 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 158 transitions, 616 flow [2025-03-15 00:58:47,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.33333333333334) internal successors, (466), 3 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,216 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:47,216 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:47,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 00:58:47,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:47,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:47,219 INFO L85 PathProgramCache]: Analyzing trace with hash 222069961, now seen corresponding path program 1 times [2025-03-15 00:58:47,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:47,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338351879] [2025-03-15 00:58:47,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:47,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:47,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:47,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:47,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:47,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338351879] [2025-03-15 00:58:47,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338351879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:47,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:47,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:47,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525948858] [2025-03-15 00:58:47,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:47,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:47,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:47,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:47,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:47,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 202 [2025-03-15 00:58:47,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 158 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:47,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 202 [2025-03-15 00:58:47,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:47,389 INFO L124 PetriNetUnfolderBase]: 17/204 cut-off events. [2025-03-15 00:58:47,390 INFO L125 PetriNetUnfolderBase]: For 827/953 co-relation queries the response was YES. [2025-03-15 00:58:47,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 662 conditions, 204 events. 17/204 cut-off events. For 827/953 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 247 event pairs, 15 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 354. Up to 46 conditions per place. [2025-03-15 00:58:47,391 INFO L140 encePairwiseOnDemand]: 200/202 looper letters, 12 selfloop transitions, 1 changer transitions 15/157 dead transitions. [2025-03-15 00:58:47,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 157 transitions, 638 flow [2025-03-15 00:58:47,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:47,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 497 transitions. [2025-03-15 00:58:47,393 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8201320132013201 [2025-03-15 00:58:47,393 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -24 predicate places. [2025-03-15 00:58:47,393 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 157 transitions, 638 flow [2025-03-15 00:58:47,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,394 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:47,394 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:47,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 00:58:47,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:47,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:47,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1613723105, now seen corresponding path program 1 times [2025-03-15 00:58:47,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:47,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469964209] [2025-03-15 00:58:47,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:47,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:47,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:47,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469964209] [2025-03-15 00:58:47,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469964209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:47,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:47,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920120228] [2025-03-15 00:58:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:47,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:47,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:47,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:47,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:47,479 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2025-03-15 00:58:47,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 157 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:47,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2025-03-15 00:58:47,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:47,538 INFO L124 PetriNetUnfolderBase]: 16/212 cut-off events. [2025-03-15 00:58:47,538 INFO L125 PetriNetUnfolderBase]: For 984/1124 co-relation queries the response was YES. [2025-03-15 00:58:47,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 212 events. 16/212 cut-off events. For 984/1124 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 263 event pairs, 15 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 382. Up to 46 conditions per place. [2025-03-15 00:58:47,539 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 14 selfloop transitions, 1 changer transitions 15/155 dead transitions. [2025-03-15 00:58:47,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 155 transitions, 660 flow [2025-03-15 00:58:47,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:47,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:47,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-03-15 00:58:47,541 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8102310231023102 [2025-03-15 00:58:47,541 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -24 predicate places. [2025-03-15 00:58:47,542 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 155 transitions, 660 flow [2025-03-15 00:58:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,542 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 00:58:47,542 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:47,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 00:58:47,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 61 more)] === [2025-03-15 00:58:47,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 00:58:47,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2019646880, now seen corresponding path program 1 times [2025-03-15 00:58:47,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 00:58:47,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022781490] [2025-03-15 00:58:47,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 00:58:47,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 00:58:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 00:58:47,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 00:58:47,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 00:58:47,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022781490] [2025-03-15 00:58:47,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022781490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 00:58:47,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 00:58:47,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 00:58:47,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770599043] [2025-03-15 00:58:47,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 00:58:47,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 00:58:47,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 00:58:47,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 00:58:47,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 00:58:47,626 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 202 [2025-03-15 00:58:47,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 155 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 00:58:47,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 202 [2025-03-15 00:58:47,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 00:58:47,674 INFO L124 PetriNetUnfolderBase]: 16/210 cut-off events. [2025-03-15 00:58:47,674 INFO L125 PetriNetUnfolderBase]: For 1155/1309 co-relation queries the response was YES. [2025-03-15 00:58:47,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 210 events. 16/210 cut-off events. For 1155/1309 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 238 event pairs, 15 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 410. Up to 44 conditions per place. [2025-03-15 00:58:47,675 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 0 selfloop transitions, 0 changer transitions 153/153 dead transitions. [2025-03-15 00:58:47,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 153 transitions, 682 flow [2025-03-15 00:58:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 00:58:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 00:58:47,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2025-03-15 00:58:47,677 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8102310231023102 [2025-03-15 00:58:47,678 INFO L298 CegarLoopForPetriNet]: 209 programPoint places, -24 predicate places. [2025-03-15 00:58:47,678 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 153 transitions, 682 flow [2025-03-15 00:58:47,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 00:58:47,686 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-time-subst.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 00:58:47,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (64 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (63 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (62 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (61 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (60 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (59 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (58 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (57 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (56 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (54 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (53 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (52 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (51 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (50 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (49 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (47 of 65 remaining) [2025-03-15 00:58:47,706 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (46 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (45 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (44 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (43 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (42 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (41 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (40 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (39 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (37 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (36 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (33 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (32 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (31 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (29 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (28 of 65 remaining) [2025-03-15 00:58:47,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (27 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (23 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (22 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (20 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (18 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (17 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (16 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (13 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (11 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (8 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 65 remaining) [2025-03-15 00:58:47,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (3 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (1 of 65 remaining) [2025-03-15 00:58:47,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 65 remaining) [2025-03-15 00:58:47,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 00:58:47,709 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 00:58:47,713 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 00:58:47,713 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 00:58:47,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 12:58:47 BasicIcfg [2025-03-15 00:58:47,717 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 00:58:47,718 INFO L158 Benchmark]: Toolchain (without parser) took 3320.13ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 42.8MB in the beginning and 71.8MB in the end (delta: -29.0MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.36ms. Allocated memory is still 71.3MB. Free memory was 42.6MB in the beginning and 30.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.48ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: Boogie Preprocessor took 26.73ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 26.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: RCFGBuilder took 976.34ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.5MB in the beginning and 25.3MB in the end (delta: 1.2MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. [2025-03-15 00:58:47,718 INFO L158 Benchmark]: TraceAbstraction took 2035.13ms. Allocated memory was 88.1MB in the beginning and 146.8MB in the end (delta: 58.7MB). Free memory was 24.2MB in the beginning and 71.8MB in the end (delta: -47.6MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2025-03-15 00:58:47,719 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.22ms. Allocated memory is still 71.3MB. Free memory is still 35.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 242.36ms. Allocated memory is still 71.3MB. Free memory was 42.6MB in the beginning and 30.5MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.48ms. Allocated memory is still 71.3MB. Free memory was 30.5MB in the beginning and 28.1MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.73ms. Allocated memory is still 71.3MB. Free memory was 28.1MB in the beginning and 26.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 976.34ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 26.5MB in the beginning and 25.3MB in the end (delta: 1.2MB). Peak memory consumption was 18.4MB. Max. memory is 8.0GB. * TraceAbstraction took 2035.13ms. Allocated memory was 88.1MB in the beginning and 146.8MB in the end (delta: 58.7MB). Free memory was 24.2MB in the beginning and 71.8MB in the end (delta: -47.6MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: 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, 242 locations, 65 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: 1.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 278 IncrementalHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 62 mSDtfsCounter, 278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=12, InterpolantAutomatonStates: 36, 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, 0.5s InterpolantComputationTime, 913 NumberOfCodeBlocks, 913 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 901 ConstructedInterpolants, 0 QuantifiedInterpolants, 925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 38 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 00:58:47,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...