/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-array-sum2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:02:43,042 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:02:43,103 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:02:43,150 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:02:43,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:02:43,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:02:43,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:02:43,154 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:02:43,155 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:02:43,155 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:02:43,155 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:02:43,155 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:02:43,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:43,156 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:02:43,156 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:02:43,157 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:02:43,157 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:02:43,157 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:02:43,157 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:02:43,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:02:43,438 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:02:43,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:02:43,440 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:02:43,440 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:02:43,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-03-15 01:02:44,664 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80dfa463/736cdcd23c424cd59a88fecf1f0e8838/FLAG41455ce1a [2025-03-15 01:02:44,869 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:02:44,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum2.wvr.c [2025-03-15 01:02:44,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80dfa463/736cdcd23c424cd59a88fecf1f0e8838/FLAG41455ce1a [2025-03-15 01:02:44,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80dfa463/736cdcd23c424cd59a88fecf1f0e8838 [2025-03-15 01:02:44,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:02:44,897 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:02:44,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:44,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:02:44,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:02:44,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:44" (1/1) ... [2025-03-15 01:02:44,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@231944da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:44, skipping insertion in model container [2025-03-15 01:02:44,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:44" (1/1) ... [2025-03-15 01:02:44,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:02:45,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:45,092 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:02:45,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:45,142 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:02:45,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45 WrapperNode [2025-03-15 01:02:45,143 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:45,144 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:45,144 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:02:45,144 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:02:45,148 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:02:45" (1/1) ... [2025-03-15 01:02:45,160 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:02:45" (1/1) ... [2025-03-15 01:02:45,195 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 17, calls inlined = 29, statements flattened = 373 [2025-03-15 01:02:45,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:45,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:02:45,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:02:45,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:02:45,205 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:02:45,232 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:02:45,232 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:02:45,236 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:02:45,238 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (1/1) ... [2025-03-15 01:02:45,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:45,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:02:45,279 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:02:45,286 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:02:45,308 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:02:45,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:02:45,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:02:45,309 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:02:45,309 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:02:45,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:02:45,312 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:02:45,417 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:02:45,419 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:02:45,945 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:02:45,945 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:02:46,286 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:02:46,286 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-15 01:02:46,286 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:46 BoogieIcfgContainer [2025-03-15 01:02:46,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:02:46,289 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:02:46,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:02:46,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:02:46,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:02:44" (1/3) ... [2025-03-15 01:02:46,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537621e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:46, skipping insertion in model container [2025-03-15 01:02:46,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:45" (2/3) ... [2025-03-15 01:02:46,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@537621e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:46, skipping insertion in model container [2025-03-15 01:02:46,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:46" (3/3) ... [2025-03-15 01:02:46,295 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum2.wvr.c [2025-03-15 01:02:46,306 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:02:46,308 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum2.wvr.c that has 4 procedures, 267 locations, 1 initial locations, 5 loop locations, and 35 error locations. [2025-03-15 01:02:46,308 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:02:46,369 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:02:46,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:02:46,414 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;@79bb4399, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:02:46,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2025-03-15 01:02:46,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:02:46,443 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-03-15 01:02:46,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:02:46,446 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:46,446 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:02:46,447 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:02:46,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:46,451 INFO L85 PathProgramCache]: Analyzing trace with hash 272515466, now seen corresponding path program 1 times [2025-03-15 01:02:46,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:46,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41491745] [2025-03-15 01:02:46,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:46,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:46,562 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:02:46,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:46,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41491745] [2025-03-15 01:02:46,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41491745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:46,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:46,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:46,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51563290] [2025-03-15 01:02:46,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:46,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:46,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:46,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:46,595 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 281 [2025-03-15 01:02:46,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:46,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:46,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 281 [2025-03-15 01:02:46,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:46,885 INFO L124 PetriNetUnfolderBase]: 206/778 cut-off events. [2025-03-15 01:02:46,885 INFO L125 PetriNetUnfolderBase]: For 181/181 co-relation queries the response was YES. [2025-03-15 01:02:46,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1154 conditions, 778 events. 206/778 cut-off events. For 181/181 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3802 event pairs, 114 based on Foata normal form. 78/706 useless extension candidates. Maximal degree in co-relation 898. Up to 288 conditions per place. [2025-03-15 01:02:46,916 INFO L140 encePairwiseOnDemand]: 250/281 looper letters, 24 selfloop transitions, 2 changer transitions 14/243 dead transitions. [2025-03-15 01:02:46,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 243 transitions, 556 flow [2025-03-15 01:02:46,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:46,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 730 transitions. [2025-03-15 01:02:46,929 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8659549228944247 [2025-03-15 01:02:46,932 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -27 predicate places. [2025-03-15 01:02:46,932 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 243 transitions, 556 flow [2025-03-15 01:02:46,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:02:46,933 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:46,933 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:02:46,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:02:46,933 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:02:46,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:46,934 INFO L85 PathProgramCache]: Analyzing trace with hash -642724384, now seen corresponding path program 1 times [2025-03-15 01:02:46,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:46,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178722189] [2025-03-15 01:02:46,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:46,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:46,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:46,987 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:02:46,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:46,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178722189] [2025-03-15 01:02:46,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178722189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:46,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:46,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:46,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398168837] [2025-03-15 01:02:46,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:46,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:46,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:46,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:46,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:46,991 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 222 out of 281 [2025-03-15 01:02:46,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 243 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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:02:46,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:46,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 281 [2025-03-15 01:02:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:47,258 INFO L124 PetriNetUnfolderBase]: 435/1295 cut-off events. [2025-03-15 01:02:47,259 INFO L125 PetriNetUnfolderBase]: For 653/718 co-relation queries the response was YES. [2025-03-15 01:02:47,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1295 events. 435/1295 cut-off events. For 653/718 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8077 event pairs, 355 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 2082. Up to 513 conditions per place. [2025-03-15 01:02:47,280 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 27 selfloop transitions, 2 changer transitions 14/242 dead transitions. [2025-03-15 01:02:47,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 242 transitions, 612 flow [2025-03-15 01:02:47,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:47,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 696 transitions. [2025-03-15 01:02:47,282 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8256227758007118 [2025-03-15 01:02:47,282 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -26 predicate places. [2025-03-15 01:02:47,282 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 242 transitions, 612 flow [2025-03-15 01:02:47,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 223.33333333333334) internal successors, (670), 3 states have internal predecessors, (670), 0 states have call successors, (0), 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:02:47,283 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:47,283 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:02:47,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:02:47,283 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:02:47,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:47,284 INFO L85 PathProgramCache]: Analyzing trace with hash -654196550, now seen corresponding path program 1 times [2025-03-15 01:02:47,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:47,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751760840] [2025-03-15 01:02:47,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:47,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:47,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:47,332 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:02:47,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:47,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751760840] [2025-03-15 01:02:47,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751760840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:47,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:47,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:47,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687782533] [2025-03-15 01:02:47,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:47,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:47,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:47,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:47,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:47,335 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 281 [2025-03-15 01:02:47,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 242 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:02:47,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:47,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 281 [2025-03-15 01:02:47,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:47,507 INFO L124 PetriNetUnfolderBase]: 348/1096 cut-off events. [2025-03-15 01:02:47,507 INFO L125 PetriNetUnfolderBase]: For 1118/1350 co-relation queries the response was YES. [2025-03-15 01:02:47,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2355 conditions, 1096 events. 348/1096 cut-off events. For 1118/1350 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6374 event pairs, 279 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2032. Up to 393 conditions per place. [2025-03-15 01:02:47,518 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 20 selfloop transitions, 1 changer transitions 14/237 dead transitions. [2025-03-15 01:02:47,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 237 transitions, 634 flow [2025-03-15 01:02:47,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:47,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:47,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 704 transitions. [2025-03-15 01:02:47,520 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8351126927639383 [2025-03-15 01:02:47,520 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -29 predicate places. [2025-03-15 01:02:47,520 INFO L471 AbstractCegarLoop]: Abstraction has has 247 places, 237 transitions, 634 flow [2025-03-15 01:02:47,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 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:02:47,521 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:47,521 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:02:47,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:02:47,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:02:47,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:47,525 INFO L85 PathProgramCache]: Analyzing trace with hash -698832560, now seen corresponding path program 1 times [2025-03-15 01:02:47,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:47,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142140260] [2025-03-15 01:02:47,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:47,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:47,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:48,013 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:02:48,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:48,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142140260] [2025-03-15 01:02:48,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142140260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:48,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:48,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:02:48,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173151582] [2025-03-15 01:02:48,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:48,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:02:48,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:48,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:02:48,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:02:48,016 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 281 [2025-03-15 01:02:48,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 237 transitions, 634 flow. Second operand has 6 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 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:02:48,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:48,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 281 [2025-03-15 01:02:48,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:48,246 INFO L124 PetriNetUnfolderBase]: 348/1094 cut-off events. [2025-03-15 01:02:48,246 INFO L125 PetriNetUnfolderBase]: For 1975/2222 co-relation queries the response was YES. [2025-03-15 01:02:48,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1094 events. 348/1094 cut-off events. For 1975/2222 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6359 event pairs, 279 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2247. Up to 393 conditions per place. [2025-03-15 01:02:48,255 INFO L140 encePairwiseOnDemand]: 269/281 looper letters, 35 selfloop transitions, 10 changer transitions 14/235 dead transitions. [2025-03-15 01:02:48,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 235 transitions, 720 flow [2025-03-15 01:02:48,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:02:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:02:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1283 transitions. [2025-03-15 01:02:48,269 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7609727164887308 [2025-03-15 01:02:48,270 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -26 predicate places. [2025-03-15 01:02:48,270 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 235 transitions, 720 flow [2025-03-15 01:02:48,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 207.83333333333334) internal successors, (1247), 6 states have internal predecessors, (1247), 0 states have call successors, (0), 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:02:48,271 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:48,271 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:02:48,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:02:48,272 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:02:48,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 13236547, now seen corresponding path program 1 times [2025-03-15 01:02:48,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:48,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091280129] [2025-03-15 01:02:48,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:48,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:48,306 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:02:48,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:48,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091280129] [2025-03-15 01:02:48,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091280129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:48,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:48,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:48,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902517208] [2025-03-15 01:02:48,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:48,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:48,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:48,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:48,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:48,308 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-03-15 01:02:48,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 235 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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:02:48,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:48,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-03-15 01:02:48,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:48,472 INFO L124 PetriNetUnfolderBase]: 348/1093 cut-off events. [2025-03-15 01:02:48,472 INFO L125 PetriNetUnfolderBase]: For 2965/3222 co-relation queries the response was YES. [2025-03-15 01:02:48,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2855 conditions, 1093 events. 348/1093 cut-off events. For 2965/3222 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6331 event pairs, 279 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2462. Up to 393 conditions per place. [2025-03-15 01:02:48,480 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 12 selfloop transitions, 2 changer transitions 14/234 dead transitions. [2025-03-15 01:02:48,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 234 transitions, 746 flow [2025-03-15 01:02:48,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:48,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:48,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-03-15 01:02:48,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-03-15 01:02:48,483 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -25 predicate places. [2025-03-15 01:02:48,483 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 234 transitions, 746 flow [2025-03-15 01:02:48,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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:02:48,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:48,483 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] [2025-03-15 01:02:48,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:02:48,484 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:02:48,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:48,484 INFO L85 PathProgramCache]: Analyzing trace with hash 389965875, now seen corresponding path program 1 times [2025-03-15 01:02:48,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:48,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446891291] [2025-03-15 01:02:48,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:48,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:48,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:48,535 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:02:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:48,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446891291] [2025-03-15 01:02:48,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446891291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:48,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:48,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:48,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456988171] [2025-03-15 01:02:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:48,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:48,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:48,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:48,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:48,538 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-03-15 01:02:48,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 234 transitions, 746 flow. Second operand has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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:02:48,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:48,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-03-15 01:02:48,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:48,693 INFO L124 PetriNetUnfolderBase]: 348/1092 cut-off events. [2025-03-15 01:02:48,693 INFO L125 PetriNetUnfolderBase]: For 4087/4354 co-relation queries the response was YES. [2025-03-15 01:02:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3090 conditions, 1092 events. 348/1092 cut-off events. For 4087/4354 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6355 event pairs, 279 based on Foata normal form. 0/886 useless extension candidates. Maximal degree in co-relation 2677. Up to 393 conditions per place. [2025-03-15 01:02:48,702 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 12 selfloop transitions, 2 changer transitions 14/233 dead transitions. [2025-03-15 01:02:48,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 233 transitions, 772 flow [2025-03-15 01:02:48,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:48,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-03-15 01:02:48,704 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-03-15 01:02:48,704 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -24 predicate places. [2025-03-15 01:02:48,704 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 233 transitions, 772 flow [2025-03-15 01:02:48,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.33333333333334) internal successors, (715), 3 states have internal predecessors, (715), 0 states have call successors, (0), 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:02:48,705 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:48,705 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] [2025-03-15 01:02:48,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:02:48,705 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:02:48,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:48,706 INFO L85 PathProgramCache]: Analyzing trace with hash 111394218, now seen corresponding path program 1 times [2025-03-15 01:02:48,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:48,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891401470] [2025-03-15 01:02:48,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:48,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:48,768 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:02:48,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:48,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891401470] [2025-03-15 01:02:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891401470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:48,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:48,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:48,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622002335] [2025-03-15 01:02:48,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:48,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:48,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:48,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:48,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:48,770 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 281 [2025-03-15 01:02:48,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 233 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:02:48,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:48,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 281 [2025-03-15 01:02:48,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:48,879 INFO L124 PetriNetUnfolderBase]: 243/871 cut-off events. [2025-03-15 01:02:48,879 INFO L125 PetriNetUnfolderBase]: For 3860/4220 co-relation queries the response was YES. [2025-03-15 01:02:48,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2590 conditions, 871 events. 243/871 cut-off events. For 3860/4220 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4554 event pairs, 186 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 2168. Up to 284 conditions per place. [2025-03-15 01:02:48,887 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 18 selfloop transitions, 1 changer transitions 14/229 dead transitions. [2025-03-15 01:02:48,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 229 transitions, 794 flow [2025-03-15 01:02:48,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-03-15 01:02:48,890 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8422301304863582 [2025-03-15 01:02:48,891 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -26 predicate places. [2025-03-15 01:02:48,891 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 229 transitions, 794 flow [2025-03-15 01:02:48,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 230.33333333333334) internal successors, (691), 3 states have internal predecessors, (691), 0 states have call successors, (0), 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:02:48,892 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:48,892 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:48,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:02:48,892 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:02:48,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:48,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1256821731, now seen corresponding path program 1 times [2025-03-15 01:02:48,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:48,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089731855] [2025-03-15 01:02:48,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:48,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:48,948 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:02:48,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:48,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089731855] [2025-03-15 01:02:48,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089731855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:48,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:48,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:48,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578818660] [2025-03-15 01:02:48,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:48,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:48,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:48,952 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 281 [2025-03-15 01:02:48,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 229 transitions, 794 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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:02:48,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:48,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 281 [2025-03-15 01:02:48,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:49,074 INFO L124 PetriNetUnfolderBase]: 243/870 cut-off events. [2025-03-15 01:02:49,074 INFO L125 PetriNetUnfolderBase]: For 5120/5488 co-relation queries the response was YES. [2025-03-15 01:02:49,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2757 conditions, 870 events. 243/870 cut-off events. For 5120/5488 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4628 event pairs, 186 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 2319. Up to 284 conditions per place. [2025-03-15 01:02:49,080 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 10 selfloop transitions, 1 changer transitions 14/228 dead transitions. [2025-03-15 01:02:49,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 228 transitions, 814 flow [2025-03-15 01:02:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:49,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:49,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2025-03-15 01:02:49,082 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8718861209964412 [2025-03-15 01:02:49,082 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -25 predicate places. [2025-03-15 01:02:49,082 INFO L471 AbstractCegarLoop]: Abstraction has has 251 places, 228 transitions, 814 flow [2025-03-15 01:02:49,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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:02:49,083 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:49,083 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:49,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:02:49,083 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 56 more)] === [2025-03-15 01:02:49,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1098231569, now seen corresponding path program 1 times [2025-03-15 01:02:49,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:49,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133955940] [2025-03-15 01:02:49,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:49,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:49,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:49,136 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:02:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133955940] [2025-03-15 01:02:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133955940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:49,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:49,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:49,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027592301] [2025-03-15 01:02:49,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:49,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:49,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:49,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:49,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:49,138 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 281 [2025-03-15 01:02:49,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 251 places, 228 transitions, 814 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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:02:49,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:49,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 281 [2025-03-15 01:02:49,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:49,244 INFO L124 PetriNetUnfolderBase]: 243/869 cut-off events. [2025-03-15 01:02:49,245 INFO L125 PetriNetUnfolderBase]: For 6475/6851 co-relation queries the response was YES. [2025-03-15 01:02:49,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2924 conditions, 869 events. 243/869 cut-off events. For 6475/6851 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4619 event pairs, 186 based on Foata normal form. 0/754 useless extension candidates. Maximal degree in co-relation 2470. Up to 284 conditions per place. [2025-03-15 01:02:49,250 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 0 selfloop transitions, 0 changer transitions 227/227 dead transitions. [2025-03-15 01:02:49,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 227 transitions, 834 flow [2025-03-15 01:02:49,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:49,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 735 transitions. [2025-03-15 01:02:49,252 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8718861209964412 [2025-03-15 01:02:49,252 INFO L298 CegarLoopForPetriNet]: 276 programPoint places, -24 predicate places. [2025-03-15 01:02:49,252 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 227 transitions, 834 flow [2025-03-15 01:02:49,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 0 states have call successors, (0), 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:02:49,260 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-array-sum2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (57 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (56 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (55 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (54 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (53 of 60 remaining) [2025-03-15 01:02:49,283 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (52 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (51 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (50 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (49 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (48 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (47 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (46 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (45 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (44 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (43 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (42 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (41 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (40 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (39 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (38 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 60 remaining) [2025-03-15 01:02:49,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (36 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (35 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (34 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (33 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (32 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (29 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (27 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (26 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (21 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (20 of 60 remaining) [2025-03-15 01:02:49,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (19 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (18 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (17 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (15 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 60 remaining) [2025-03-15 01:02:49,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 60 remaining) [2025-03-15 01:02:49,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 60 remaining) [2025-03-15 01:02:49,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:02:49,287 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:49,291 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:02:49,291 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:02:49,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:02:49 BasicIcfg [2025-03-15 01:02:49,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:02:49,295 INFO L158 Benchmark]: Toolchain (without parser) took 4397.89ms. Allocated memory was 71.3MB in the beginning and 213.9MB in the end (delta: 142.6MB). Free memory was 44.1MB in the beginning and 39.6MB in the end (delta: 4.5MB). Peak memory consumption was 146.4MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,295 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:02:49,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 244.95ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.46ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 28.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,295 INFO L158 Benchmark]: Boogie Preprocessor took 36.22ms. Allocated memory is still 71.3MB. Free memory was 28.0MB in the beginning and 25.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,295 INFO L158 Benchmark]: RCFGBuilder took 1054.37ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 43.7MB in the end (delta: -18.5MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,296 INFO L158 Benchmark]: TraceAbstraction took 3005.25ms. Allocated memory was 88.1MB in the beginning and 213.9MB in the end (delta: 125.8MB). Free memory was 42.5MB in the beginning and 39.6MB in the end (delta: 2.9MB). Peak memory consumption was 126.3MB. Max. memory is 8.0GB. [2025-03-15 01:02:49,297 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 36.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 244.95ms. Allocated memory is still 71.3MB. Free memory was 43.9MB in the beginning and 31.0MB in the end (delta: 12.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.46ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 28.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.22ms. Allocated memory is still 71.3MB. Free memory was 28.0MB in the beginning and 25.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1054.37ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 25.2MB in the beginning and 43.7MB in the end (delta: -18.5MB). Peak memory consumption was 28.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3005.25ms. Allocated memory was 88.1MB in the beginning and 213.9MB in the end (delta: 125.8MB). Free memory was 42.5MB in the beginning and 39.6MB in the end (delta: 2.9MB). Peak memory consumption was 126.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: 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: 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: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: 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: 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: 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: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: 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: 86]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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, 333 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.9s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 39 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 86 mSDtfsCounter, 277 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.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=834occurred 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, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 736 ConstructedInterpolants, 0 QuantifiedInterpolants, 867 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:02:49,318 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...