/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/popl20-more-min-array-hom.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:03:21,799 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:03:21,889 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 01:03:21,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:03:21,917 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:03:21,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:03:21,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:03:21,917 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:03:21,918 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:03:21,918 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:03:21,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:03:21,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:03:21,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:03:21,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:03:21,920 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:03:21,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:03:21,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:21,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:03:21,921 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:03:21,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:03:21,921 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:03:21,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:03:21,921 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:03:21,921 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 01:03:22,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:03:22,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:03:22,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:03:22,197 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:03:22,198 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:03:22,200 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-03-15 01:03:23,355 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3635448/a297cd835b5c4784b2b1583657758eac/FLAG91a9b7074 [2025-03-15 01:03:23,572 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:03:23,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array-hom.wvr.c [2025-03-15 01:03:23,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3635448/a297cd835b5c4784b2b1583657758eac/FLAG91a9b7074 [2025-03-15 01:03:23,940 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d3635448/a297cd835b5c4784b2b1583657758eac [2025-03-15 01:03:23,942 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:03:23,943 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:03:23,944 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:23,944 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:03:23,947 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:03:23,947 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:23" (1/1) ... [2025-03-15 01:03:23,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b2ffa38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:23, skipping insertion in model container [2025-03-15 01:03:23,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:03:23" (1/1) ... [2025-03-15 01:03:23,960 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:03:24,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:24,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:03:24,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:03:24,106 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:03:24,108 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24 WrapperNode [2025-03-15 01:03:24,108 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:03:24,109 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:24,109 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:03:24,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:03:24,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,141 INFO L138 Inliner]: procedures = 23, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 131 [2025-03-15 01:03:24,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:03:24,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:03:24,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:03:24,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:03:24,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,172 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,181 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:03:24,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:03:24,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:03:24,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:03:24,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (1/1) ... [2025-03-15 01:03:24,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:03:24,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:03:24,217 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 01:03:24,221 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 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:03:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:03:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:03:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:03:24,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:03:24,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:03:24,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:03:24,242 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 01:03:24,321 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:03:24,322 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:03:24,676 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:03:24,676 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:03:24,849 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:03:24,850 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-15 01:03:24,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:24 BoogieIcfgContainer [2025-03-15 01:03:24,850 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:03:24,852 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:03:24,852 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:03:24,856 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:03:24,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:03:23" (1/3) ... [2025-03-15 01:03:24,856 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c01186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:24, skipping insertion in model container [2025-03-15 01:03:24,856 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:03:24" (2/3) ... [2025-03-15 01:03:24,857 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58c01186 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:03:24, skipping insertion in model container [2025-03-15 01:03:24,857 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:03:24" (3/3) ... [2025-03-15 01:03:24,857 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array-hom.wvr.c [2025-03-15 01:03:24,868 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:03:24,870 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array-hom.wvr.c that has 4 procedures, 227 locations, 1 initial locations, 4 loop locations, and 35 error locations. [2025-03-15 01:03:24,870 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:03:24,935 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:03:24,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:03:24,979 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;@7f024ac3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:03:24,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-15 01:03:24,995 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:03:24,995 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-15 01:03:24,999 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:03:24,999 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:24,999 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] [2025-03-15 01:03:25,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:25,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -676786002, now seen corresponding path program 1 times [2025-03-15 01:03:25,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:25,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777407706] [2025-03-15 01:03:25,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:25,154 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 01:03:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777407706] [2025-03-15 01:03:25,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777407706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:25,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:25,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:25,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115337998] [2025-03-15 01:03:25,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:25,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:25,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:25,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:25,183 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 239 [2025-03-15 01:03:25,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 239 transitions, 499 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:25,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:25,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 239 [2025-03-15 01:03:25,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:25,444 INFO L124 PetriNetUnfolderBase]: 206/738 cut-off events. [2025-03-15 01:03:25,444 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-15 01:03:25,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 738 events. 206/738 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3781 event pairs, 114 based on Foata normal form. 76/665 useless extension candidates. Maximal degree in co-relation 898. Up to 288 conditions per place. [2025-03-15 01:03:25,460 INFO L140 encePairwiseOnDemand]: 210/239 looper letters, 24 selfloop transitions, 2 changer transitions 16/203 dead transitions. [2025-03-15 01:03:25,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 203 transitions, 476 flow [2025-03-15 01:03:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 608 transitions. [2025-03-15 01:03:25,488 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8479776847977685 [2025-03-15 01:03:25,491 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -27 predicate places. [2025-03-15 01:03:25,492 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 203 transitions, 476 flow [2025-03-15 01:03:25,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:25,493 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:25,493 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] [2025-03-15 01:03:25,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:03:25,493 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:25,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:25,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2118417138, now seen corresponding path program 1 times [2025-03-15 01:03:25,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:25,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661445863] [2025-03-15 01:03:25,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:25,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:25,537 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 01:03:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661445863] [2025-03-15 01:03:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661445863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663995879] [2025-03-15 01:03:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:25,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:25,539 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 239 [2025-03-15 01:03:25,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 203 transitions, 476 flow. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:25,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:25,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 239 [2025-03-15 01:03:25,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:25,732 INFO L124 PetriNetUnfolderBase]: 435/1255 cut-off events. [2025-03-15 01:03:25,732 INFO L125 PetriNetUnfolderBase]: For 653/718 co-relation queries the response was YES. [2025-03-15 01:03:25,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 1255 events. 435/1255 cut-off events. For 653/718 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8038 event pairs, 355 based on Foata normal form. 0/946 useless extension candidates. Maximal degree in co-relation 2082. Up to 510 conditions per place. [2025-03-15 01:03:25,742 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 24 selfloop transitions, 2 changer transitions 16/202 dead transitions. [2025-03-15 01:03:25,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 202 transitions, 526 flow [2025-03-15 01:03:25,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:25,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 582 transitions. [2025-03-15 01:03:25,744 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8117154811715481 [2025-03-15 01:03:25,745 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -26 predicate places. [2025-03-15 01:03:25,745 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 202 transitions, 526 flow [2025-03-15 01:03:25,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:25,745 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:25,745 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] [2025-03-15 01:03:25,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:03:25,745 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:25,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:25,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2136954397, now seen corresponding path program 1 times [2025-03-15 01:03:25,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:25,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539477616] [2025-03-15 01:03:25,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:25,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:25,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:25,788 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 01:03:25,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:25,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539477616] [2025-03-15 01:03:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539477616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:25,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:25,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58784254] [2025-03-15 01:03:25,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:25,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:25,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:25,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:25,790 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 239 [2025-03-15 01:03:25,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 202 transitions, 526 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 01:03:25,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:25,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 239 [2025-03-15 01:03:25,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:25,975 INFO L124 PetriNetUnfolderBase]: 348/1057 cut-off events. [2025-03-15 01:03:25,975 INFO L125 PetriNetUnfolderBase]: For 1117/1349 co-relation queries the response was YES. [2025-03-15 01:03:25,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 1057 events. 348/1057 cut-off events. For 1117/1349 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6317 event pairs, 279 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2032. Up to 393 conditions per place. [2025-03-15 01:03:25,987 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 18 selfloop transitions, 1 changer transitions 16/198 dead transitions. [2025-03-15 01:03:25,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 198 transitions, 548 flow [2025-03-15 01:03:25,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:25,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-15 01:03:25,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8228730822873083 [2025-03-15 01:03:25,991 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -28 predicate places. [2025-03-15 01:03:25,991 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 198 transitions, 548 flow [2025-03-15 01:03:25,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 01:03:25,992 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:25,992 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] [2025-03-15 01:03:25,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:03:25,992 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:25,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1217873890, now seen corresponding path program 1 times [2025-03-15 01:03:25,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:25,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451140592] [2025-03-15 01:03:25,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:25,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:26,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:26,080 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 01:03:26,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:26,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451140592] [2025-03-15 01:03:26,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451140592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:26,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:26,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:26,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261996246] [2025-03-15 01:03:26,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:26,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:26,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:26,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:26,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:26,083 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 239 [2025-03-15 01:03:26,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 198 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 01:03:26,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:26,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 239 [2025-03-15 01:03:26,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:26,215 INFO L124 PetriNetUnfolderBase]: 348/1056 cut-off events. [2025-03-15 01:03:26,215 INFO L125 PetriNetUnfolderBase]: For 1976/2223 co-relation queries the response was YES. [2025-03-15 01:03:26,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2547 conditions, 1056 events. 348/1056 cut-off events. For 1976/2223 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6332 event pairs, 279 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2247. Up to 393 conditions per place. [2025-03-15 01:03:26,223 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 12 selfloop transitions, 2 changer transitions 16/197 dead transitions. [2025-03-15 01:03:26,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 197 transitions, 574 flow [2025-03-15 01:03:26,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:26,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 606 transitions. [2025-03-15 01:03:26,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8451882845188284 [2025-03-15 01:03:26,228 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -27 predicate places. [2025-03-15 01:03:26,228 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 197 transitions, 574 flow [2025-03-15 01:03:26,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 0 states have call successors, (0), 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 01:03:26,228 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:26,228 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] [2025-03-15 01:03:26,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:03:26,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:26,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:26,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1560958751, now seen corresponding path program 1 times [2025-03-15 01:03:26,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:26,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470256734] [2025-03-15 01:03:26,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:26,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:26,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:26,640 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 01:03:26,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:26,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470256734] [2025-03-15 01:03:26,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470256734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:26,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:26,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:03:26,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716466655] [2025-03-15 01:03:26,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:26,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:03:26,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:26,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:03:26,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:03:26,642 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 239 [2025-03-15 01:03:26,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 197 transitions, 574 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 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 01:03:26,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:26,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 239 [2025-03-15 01:03:26,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:26,844 INFO L124 PetriNetUnfolderBase]: 348/1055 cut-off events. [2025-03-15 01:03:26,844 INFO L125 PetriNetUnfolderBase]: For 2964/3221 co-relation queries the response was YES. [2025-03-15 01:03:26,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 1055 events. 348/1055 cut-off events. For 2964/3221 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6322 event pairs, 279 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2462. Up to 393 conditions per place. [2025-03-15 01:03:26,867 INFO L140 encePairwiseOnDemand]: 233/239 looper letters, 22 selfloop transitions, 5 changer transitions 16/196 dead transitions. [2025-03-15 01:03:26,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 196 transitions, 626 flow [2025-03-15 01:03:26,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:03:26,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:03:26,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1138 transitions. [2025-03-15 01:03:26,872 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.793584379358438 [2025-03-15 01:03:26,873 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -23 predicate places. [2025-03-15 01:03:26,873 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 196 transitions, 626 flow [2025-03-15 01:03:26,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 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 01:03:26,873 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:26,873 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] [2025-03-15 01:03:26,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:03:26,874 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:26,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:26,874 INFO L85 PathProgramCache]: Analyzing trace with hash 460109449, now seen corresponding path program 1 times [2025-03-15 01:03:26,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:26,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914398947] [2025-03-15 01:03:26,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:26,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:26,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:26,917 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 01:03:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914398947] [2025-03-15 01:03:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914398947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:26,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:26,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279531487] [2025-03-15 01:03:26,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:26,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:26,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:26,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:26,920 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 239 [2025-03-15 01:03:26,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 196 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 01:03:26,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:26,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 239 [2025-03-15 01:03:26,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:27,023 INFO L124 PetriNetUnfolderBase]: 243/834 cut-off events. [2025-03-15 01:03:27,024 INFO L125 PetriNetUnfolderBase]: For 2875/3227 co-relation queries the response was YES. [2025-03-15 01:03:27,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 834 events. 243/834 cut-off events. For 2875/3227 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4595 event pairs, 186 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 2017. Up to 282 conditions per place. [2025-03-15 01:03:27,028 INFO L140 encePairwiseOnDemand]: 234/239 looper letters, 18 selfloop transitions, 1 changer transitions 16/192 dead transitions. [2025-03-15 01:03:27,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 192 transitions, 648 flow [2025-03-15 01:03:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:27,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 590 transitions. [2025-03-15 01:03:27,030 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8228730822873083 [2025-03-15 01:03:27,031 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -25 predicate places. [2025-03-15 01:03:27,031 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 192 transitions, 648 flow [2025-03-15 01:03:27,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 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 01:03:27,031 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:27,031 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 01:03:27,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:03:27,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -411725765, now seen corresponding path program 1 times [2025-03-15 01:03:27,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212358097] [2025-03-15 01:03:27,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:27,089 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 01:03:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212358097] [2025-03-15 01:03:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212358097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:27,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:27,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:27,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845125410] [2025-03-15 01:03:27,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:27,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:27,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:27,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:27,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:27,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 239 [2025-03-15 01:03:27,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 192 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:27,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:27,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 239 [2025-03-15 01:03:27,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:27,197 INFO L124 PetriNetUnfolderBase]: 243/833 cut-off events. [2025-03-15 01:03:27,197 INFO L125 PetriNetUnfolderBase]: For 4014/4374 co-relation queries the response was YES. [2025-03-15 01:03:27,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2527 conditions, 833 events. 243/833 cut-off events. For 4014/4374 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4602 event pairs, 186 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 2168. Up to 282 conditions per place. [2025-03-15 01:03:27,204 INFO L140 encePairwiseOnDemand]: 237/239 looper letters, 10 selfloop transitions, 1 changer transitions 16/191 dead transitions. [2025-03-15 01:03:27,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 191 transitions, 668 flow [2025-03-15 01:03:27,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:27,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-03-15 01:03:27,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8577405857740585 [2025-03-15 01:03:27,207 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2025-03-15 01:03:27,207 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 668 flow [2025-03-15 01:03:27,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:03:27,207 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:27,207 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] [2025-03-15 01:03:27,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:03:27,207 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:27,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:27,208 INFO L85 PathProgramCache]: Analyzing trace with hash 30492422, now seen corresponding path program 1 times [2025-03-15 01:03:27,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:27,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24163919] [2025-03-15 01:03:27,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:27,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:27,260 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 01:03:27,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:27,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24163919] [2025-03-15 01:03:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24163919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396708541] [2025-03-15 01:03:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:27,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:27,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:27,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:27,262 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 239 [2025-03-15 01:03:27,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 01:03:27,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:27,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 239 [2025-03-15 01:03:27,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:27,378 INFO L124 PetriNetUnfolderBase]: 243/831 cut-off events. [2025-03-15 01:03:27,378 INFO L125 PetriNetUnfolderBase]: For 5248/5616 co-relation queries the response was YES. [2025-03-15 01:03:27,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 831 events. 243/831 cut-off events. For 5248/5616 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4574 event pairs, 186 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 2319. Up to 282 conditions per place. [2025-03-15 01:03:27,386 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 10 selfloop transitions, 1 changer transitions 18/189 dead transitions. [2025-03-15 01:03:27,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 189 transitions, 690 flow [2025-03-15 01:03:27,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:27,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:27,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2025-03-15 01:03:27,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8493723849372385 [2025-03-15 01:03:27,389 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2025-03-15 01:03:27,390 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 189 transitions, 690 flow [2025-03-15 01:03:27,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 01:03:27,390 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:03:27,390 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 01:03:27,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:03:27,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:03:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:03:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1677198811, now seen corresponding path program 1 times [2025-03-15 01:03:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:03:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358550287] [2025-03-15 01:03:27,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:03:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:03:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:03:27,442 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 01:03:27,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:03:27,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358550287] [2025-03-15 01:03:27,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358550287] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:03:27,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:03:27,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:03:27,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017680418] [2025-03-15 01:03:27,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:03:27,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:03:27,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:03:27,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:03:27,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:03:27,444 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 239 [2025-03-15 01:03:27,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 189 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 01:03:27,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:03:27,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 239 [2025-03-15 01:03:27,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:03:27,548 INFO L124 PetriNetUnfolderBase]: 243/829 cut-off events. [2025-03-15 01:03:27,548 INFO L125 PetriNetUnfolderBase]: For 6577/6953 co-relation queries the response was YES. [2025-03-15 01:03:27,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 829 events. 243/829 cut-off events. For 6577/6953 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4574 event pairs, 186 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 2470. Up to 282 conditions per place. [2025-03-15 01:03:27,552 INFO L140 encePairwiseOnDemand]: 236/239 looper letters, 0 selfloop transitions, 0 changer transitions 187/187 dead transitions. [2025-03-15 01:03:27,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 187 transitions, 712 flow [2025-03-15 01:03:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:03:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:03:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2025-03-15 01:03:27,554 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8493723849372385 [2025-03-15 01:03:27,555 INFO L298 CegarLoopForPetriNet]: 236 programPoint places, -24 predicate places. [2025-03-15 01:03:27,555 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 187 transitions, 712 flow [2025-03-15 01:03:27,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.66666666666666) internal successors, (602), 3 states have internal predecessors, (602), 0 states have call successors, (0), 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 01:03:27,564 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-min-array-hom.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:03:27,588 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-03-15 01:03:27,589 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-03-15 01:03:27,591 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-03-15 01:03:27,592 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-03-15 01:03:27,593 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-03-15 01:03:27,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:03:27,593 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:03:27,599 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:03:27,600 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:03:27,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:03:27 BasicIcfg [2025-03-15 01:03:27,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:03:27,605 INFO L158 Benchmark]: Toolchain (without parser) took 3661.63ms. Allocated memory was 71.3MB in the beginning and 281.0MB in the end (delta: 209.7MB). Free memory was 44.4MB in the beginning and 186.1MB in the end (delta: -141.7MB). Peak memory consumption was 205.6MB. Max. memory is 8.0GB. [2025-03-15 01:03:27,605 INFO L158 Benchmark]: CDTParser took 1.25ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:27,605 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.34ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 01:03:27,605 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.75ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 30.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:03:27,605 INFO L158 Benchmark]: Boogie Preprocessor took 43.99ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 28.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:03:27,605 INFO L158 Benchmark]: RCFGBuilder took 663.51ms. Allocated memory is still 71.3MB. Free memory was 28.0MB in the beginning and 24.5MB in the end (delta: 3.6MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. [2025-03-15 01:03:27,606 INFO L158 Benchmark]: TraceAbstraction took 2752.74ms. Allocated memory was 71.3MB in the beginning and 281.0MB in the end (delta: 209.7MB). Free memory was 23.7MB in the beginning and 186.1MB in the end (delta: -162.4MB). Peak memory consumption was 185.3MB. Max. memory is 8.0GB. [2025-03-15 01:03:27,608 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.25ms. Allocated memory is still 71.3MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 42.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.34ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 31.6MB in the end (delta: 12.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.75ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 30.0MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.99ms. Allocated memory is still 71.3MB. Free memory was 30.0MB in the beginning and 28.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 663.51ms. Allocated memory is still 71.3MB. Free memory was 28.0MB in the beginning and 24.5MB in the end (delta: 3.6MB). Peak memory consumption was 22.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2752.74ms. Allocated memory was 71.3MB in the beginning and 281.0MB in the end (delta: 209.7MB). Free memory was 23.7MB in the beginning and 186.1MB in the end (delta: -162.4MB). Peak memory consumption was 185.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: 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, 293 locations, 60 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: 2.6s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 67 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 218 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 67 mSDtfsCounter, 218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=712occurred in iteration=9, InterpolantAutomatonStates: 30, 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.7s InterpolantComputationTime, 675 NumberOfCodeBlocks, 675 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 666 ConstructedInterpolants, 0 QuantifiedInterpolants, 797 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 35 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:03:27,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...