/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-sum-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:02:35,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:02:35,612 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:35,663 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:02:35,665 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:02:35,665 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:02:35,665 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:02:35,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:02:35,665 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:02:35,666 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:02:35,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:02:35,666 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:02:35,667 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:02:35,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:35,668 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:02:35,668 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:02:35,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:02:35,669 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:02:35,669 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:35,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:02:35,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:02:35,945 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:02:35,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:02:35,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:02:35,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-15 01:02:37,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0643b3d8e/505b7521039841f9b4bfaf73eb070d3c/FLAGc601b960b [2025-03-15 01:02:37,408 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:02:37,408 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-array-sum-alt2.wvr.c [2025-03-15 01:02:37,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0643b3d8e/505b7521039841f9b4bfaf73eb070d3c/FLAGc601b960b [2025-03-15 01:02:37,776 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0643b3d8e/505b7521039841f9b4bfaf73eb070d3c [2025-03-15 01:02:37,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:02:37,780 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:02:37,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:37,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:02:37,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:02:37,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:37" (1/1) ... [2025-03-15 01:02:37,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4836eb43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:37, skipping insertion in model container [2025-03-15 01:02:37,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:02:37" (1/1) ... [2025-03-15 01:02:37,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:02:37,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:37,989 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:02:38,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:02:38,037 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:02:38,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:38 WrapperNode [2025-03-15 01:02:38,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:02:38,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:38,039 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:02:38,039 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:02:38,043 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:38" (1/1) ... [2025-03-15 01:02:38,052 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:38" (1/1) ... [2025-03-15 01:02:38,088 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 260 [2025-03-15 01:02:38,092 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:02:38,092 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:02:38,093 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:02:38,093 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:02:38,103 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:38" (1/1) ... [2025-03-15 01:02:38,103 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:38" (1/1) ... [2025-03-15 01:02:38,108 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:38" (1/1) ... [2025-03-15 01:02:38,109 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:38" (1/1) ... [2025-03-15 01:02:38,122 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:38" (1/1) ... [2025-03-15 01:02:38,128 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:38" (1/1) ... [2025-03-15 01:02:38,131 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:38" (1/1) ... [2025-03-15 01:02:38,137 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:38" (1/1) ... [2025-03-15 01:02:38,138 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:38" (1/1) ... [2025-03-15 01:02:38,144 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:02:38,145 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:02:38,145 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:02:38,145 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:02:38,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:38" (1/1) ... [2025-03-15 01:02:38,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:02:38,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:02:38,179 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:38,189 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:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:02:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 01:02:38,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 01:02:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 01:02:38,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 01:02:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 01:02:38,212 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 01:02:38,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:02:38,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:02:38,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:02:38,214 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:38,286 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:02:38,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:02:38,703 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:02:38,703 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:02:38,907 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:02:38,907 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-03-15 01:02:38,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:38 BoogieIcfgContainer [2025-03-15 01:02:38,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:02:38,909 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:02:38,910 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:02:38,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:02:38,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:02:37" (1/3) ... [2025-03-15 01:02:38,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:38, skipping insertion in model container [2025-03-15 01:02:38,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:02:38" (2/3) ... [2025-03-15 01:02:38,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b3080f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:02:38, skipping insertion in model container [2025-03-15 01:02:38,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:02:38" (3/3) ... [2025-03-15 01:02:38,926 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-array-sum-alt2.wvr.c [2025-03-15 01:02:38,936 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:02:38,938 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-array-sum-alt2.wvr.c that has 4 procedures, 207 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-15 01:02:38,939 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:02:38,995 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 01:02:39,031 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:02:39,042 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;@347dc05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:02:39,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-03-15 01:02:39,063 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:02:39,064 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-03-15 01:02:39,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:02:39,065 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:39,066 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] [2025-03-15 01:02:39,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:39,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:39,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1885085207, now seen corresponding path program 1 times [2025-03-15 01:02:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:39,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955243623] [2025-03-15 01:02:39,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:39,190 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:39,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:39,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955243623] [2025-03-15 01:02:39,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955243623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:39,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:39,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:39,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481131776] [2025-03-15 01:02:39,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:39,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:39,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:39,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:39,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:39,225 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 218 [2025-03-15 01:02:39,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 218 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:39,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:39,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 218 [2025-03-15 01:02:39,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:39,494 INFO L124 PetriNetUnfolderBase]: 150/633 cut-off events. [2025-03-15 01:02:39,494 INFO L125 PetriNetUnfolderBase]: For 106/106 co-relation queries the response was YES. [2025-03-15 01:02:39,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 633 events. 150/633 cut-off events. For 106/106 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3327 event pairs, 114 based on Foata normal form. 52/581 useless extension candidates. Maximal degree in co-relation 515. Up to 232 conditions per place. [2025-03-15 01:02:39,510 INFO L140 encePairwiseOnDemand]: 195/218 looper letters, 24 selfloop transitions, 2 changer transitions 12/188 dead transitions. [2025-03-15 01:02:39,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 188 transitions, 446 flow [2025-03-15 01:02:39,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:39,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-03-15 01:02:39,523 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8516819571865444 [2025-03-15 01:02:39,525 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -21 predicate places. [2025-03-15 01:02:39,525 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 188 transitions, 446 flow [2025-03-15 01:02:39,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:39,526 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:39,526 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] [2025-03-15 01:02:39,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:02:39,526 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:39,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:39,527 INFO L85 PathProgramCache]: Analyzing trace with hash -929976189, now seen corresponding path program 1 times [2025-03-15 01:02:39,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:39,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731694243] [2025-03-15 01:02:39,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:39,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:39,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:39,576 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:39,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:39,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731694243] [2025-03-15 01:02:39,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731694243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:39,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:39,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:39,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827281770] [2025-03-15 01:02:39,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:39,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:39,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:39,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:39,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:39,580 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 218 [2025-03-15 01:02:39,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 188 transitions, 446 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:39,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:39,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 218 [2025-03-15 01:02:39,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:39,786 INFO L124 PetriNetUnfolderBase]: 434/1240 cut-off events. [2025-03-15 01:02:39,786 INFO L125 PetriNetUnfolderBase]: For 653/718 co-relation queries the response was YES. [2025-03-15 01:02:39,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2338 conditions, 1240 events. 434/1240 cut-off events. For 653/718 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8059 event pairs, 355 based on Foata normal form. 0/935 useless extension candidates. Maximal degree in co-relation 2082. Up to 510 conditions per place. [2025-03-15 01:02:39,797 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 24 selfloop transitions, 2 changer transitions 12/187 dead transitions. [2025-03-15 01:02:39,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 187 transitions, 496 flow [2025-03-15 01:02:39,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-03-15 01:02:39,801 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8211009174311926 [2025-03-15 01:02:39,802 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -20 predicate places. [2025-03-15 01:02:39,802 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 187 transitions, 496 flow [2025-03-15 01:02:39,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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:39,803 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:39,803 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:39,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:02:39,803 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:39,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:39,804 INFO L85 PathProgramCache]: Analyzing trace with hash -792410770, now seen corresponding path program 1 times [2025-03-15 01:02:39,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:39,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49503654] [2025-03-15 01:02:39,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:39,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:39,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:39,853 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:39,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:39,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49503654] [2025-03-15 01:02:39,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49503654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:39,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:39,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:39,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642470723] [2025-03-15 01:02:39,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:39,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:39,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:39,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:39,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:39,856 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 218 [2025-03-15 01:02:39,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 187 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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:39,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:39,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 218 [2025-03-15 01:02:39,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:40,048 INFO L124 PetriNetUnfolderBase]: 347/1042 cut-off events. [2025-03-15 01:02:40,048 INFO L125 PetriNetUnfolderBase]: For 1117/1349 co-relation queries the response was YES. [2025-03-15 01:02:40,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2297 conditions, 1042 events. 347/1042 cut-off events. For 1117/1349 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6324 event pairs, 279 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 2032. Up to 393 conditions per place. [2025-03-15 01:02:40,060 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 18 selfloop transitions, 1 changer transitions 12/183 dead transitions. [2025-03-15 01:02:40,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 183 transitions, 518 flow [2025-03-15 01:02:40,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:40,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:40,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2025-03-15 01:02:40,062 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-15 01:02:40,063 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -22 predicate places. [2025-03-15 01:02:40,063 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 183 transitions, 518 flow [2025-03-15 01:02:40,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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:40,063 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:40,063 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] [2025-03-15 01:02:40,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:02:40,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:40,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -2070949544, now seen corresponding path program 1 times [2025-03-15 01:02:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490644854] [2025-03-15 01:02:40,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:40,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:40,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:40,117 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:40,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:40,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490644854] [2025-03-15 01:02:40,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490644854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:40,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:40,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:40,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977325320] [2025-03-15 01:02:40,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:40,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:40,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:40,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:40,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:40,120 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 218 [2025-03-15 01:02:40,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 183 transitions, 518 flow. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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:40,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:40,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 218 [2025-03-15 01:02:40,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:40,285 INFO L124 PetriNetUnfolderBase]: 347/1041 cut-off events. [2025-03-15 01:02:40,285 INFO L125 PetriNetUnfolderBase]: For 1976/2223 co-relation queries the response was YES. [2025-03-15 01:02:40,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2532 conditions, 1041 events. 347/1041 cut-off events. For 1976/2223 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/837 useless extension candidates. Maximal degree in co-relation 2247. Up to 393 conditions per place. [2025-03-15 01:02:40,294 INFO L140 encePairwiseOnDemand]: 215/218 looper letters, 12 selfloop transitions, 2 changer transitions 12/182 dead transitions. [2025-03-15 01:02:40,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 182 transitions, 544 flow [2025-03-15 01:02:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:40,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:40,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 561 transitions. [2025-03-15 01:02:40,297 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8577981651376146 [2025-03-15 01:02:40,297 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -21 predicate places. [2025-03-15 01:02:40,297 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 182 transitions, 544 flow [2025-03-15 01:02:40,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 3 states have internal predecessors, (550), 0 states have call successors, (0), 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:40,298 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:40,298 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] [2025-03-15 01:02:40,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:02:40,298 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:40,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:40,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1716063797, now seen corresponding path program 1 times [2025-03-15 01:02:40,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:40,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626159284] [2025-03-15 01:02:40,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:40,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:40,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:40,864 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:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626159284] [2025-03-15 01:02:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626159284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:02:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223099509] [2025-03-15 01:02:40,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:02:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:40,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:02:40,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:02:40,867 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 218 [2025-03-15 01:02:40,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 182 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 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:40,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:40,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 218 [2025-03-15 01:02:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:41,058 INFO L124 PetriNetUnfolderBase]: 347/1040 cut-off events. [2025-03-15 01:02:41,059 INFO L125 PetriNetUnfolderBase]: For 2964/3221 co-relation queries the response was YES. [2025-03-15 01:02:41,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2780 conditions, 1040 events. 347/1040 cut-off events. For 2964/3221 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6309 event pairs, 279 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 2462. Up to 393 conditions per place. [2025-03-15 01:02:41,065 INFO L140 encePairwiseOnDemand]: 212/218 looper letters, 22 selfloop transitions, 5 changer transitions 12/181 dead transitions. [2025-03-15 01:02:41,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 181 transitions, 596 flow [2025-03-15 01:02:41,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:02:41,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:02:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1048 transitions. [2025-03-15 01:02:41,070 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8012232415902141 [2025-03-15 01:02:41,070 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -17 predicate places. [2025-03-15 01:02:41,070 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 181 transitions, 596 flow [2025-03-15 01:02:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.83333333333334) internal successors, (1031), 6 states have internal predecessors, (1031), 0 states have call successors, (0), 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:41,071 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:41,071 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:41,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:02:41,071 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:41,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:41,072 INFO L85 PathProgramCache]: Analyzing trace with hash 745015287, now seen corresponding path program 1 times [2025-03-15 01:02:41,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:41,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160908164] [2025-03-15 01:02:41,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:41,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:41,121 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:41,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:41,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160908164] [2025-03-15 01:02:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160908164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:41,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711206268] [2025-03-15 01:02:41,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:41,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:41,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:41,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:41,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:41,123 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 218 [2025-03-15 01:02:41,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 181 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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:41,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:41,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 218 [2025-03-15 01:02:41,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:41,266 INFO L124 PetriNetUnfolderBase]: 242/819 cut-off events. [2025-03-15 01:02:41,267 INFO L125 PetriNetUnfolderBase]: For 2875/3227 co-relation queries the response was YES. [2025-03-15 01:02:41,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 819 events. 242/819 cut-off events. For 2875/3227 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4553 event pairs, 186 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 2017. Up to 282 conditions per place. [2025-03-15 01:02:41,274 INFO L140 encePairwiseOnDemand]: 213/218 looper letters, 18 selfloop transitions, 1 changer transitions 12/177 dead transitions. [2025-03-15 01:02:41,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 177 transitions, 618 flow [2025-03-15 01:02:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:41,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2025-03-15 01:02:41,276 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-15 01:02:41,278 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -19 predicate places. [2025-03-15 01:02:41,278 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 177 transitions, 618 flow [2025-03-15 01:02:41,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 0 states have call successors, (0), 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:41,278 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:41,278 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] [2025-03-15 01:02:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:02:41,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:41,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:41,280 INFO L85 PathProgramCache]: Analyzing trace with hash -375349719, now seen corresponding path program 1 times [2025-03-15 01:02:41,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:41,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496342220] [2025-03-15 01:02:41,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:41,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:41,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:02:41,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:41,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496342220] [2025-03-15 01:02:41,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496342220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:41,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:41,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:41,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348559539] [2025-03-15 01:02:41,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:41,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:41,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:41,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:41,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:41,350 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2025-03-15 01:02:41,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 177 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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:41,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:41,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2025-03-15 01:02:41,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:41,466 INFO L124 PetriNetUnfolderBase]: 242/818 cut-off events. [2025-03-15 01:02:41,466 INFO L125 PetriNetUnfolderBase]: For 4014/4374 co-relation queries the response was YES. [2025-03-15 01:02:41,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2512 conditions, 818 events. 242/818 cut-off events. For 4014/4374 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4582 event pairs, 186 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 2168. Up to 282 conditions per place. [2025-03-15 01:02:41,476 INFO L140 encePairwiseOnDemand]: 216/218 looper letters, 10 selfloop transitions, 1 changer transitions 12/176 dead transitions. [2025-03-15 01:02:41,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 176 transitions, 638 flow [2025-03-15 01:02:41,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:41,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2025-03-15 01:02:41,478 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8715596330275229 [2025-03-15 01:02:41,479 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -18 predicate places. [2025-03-15 01:02:41,479 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 176 transitions, 638 flow [2025-03-15 01:02:41,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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:41,480 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:02:41,480 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] [2025-03-15 01:02:41,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:02:41,480 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-03-15 01:02:41,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:02:41,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2121638394, now seen corresponding path program 1 times [2025-03-15 01:02:41,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:02:41,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731672038] [2025-03-15 01:02:41,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:02:41,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:02:41,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:02:41,544 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:41,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:02:41,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731672038] [2025-03-15 01:02:41,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731672038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:02:41,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:02:41,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:02:41,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168206912] [2025-03-15 01:02:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:02:41,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:02:41,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:02:41,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:02:41,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:02:41,547 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 218 [2025-03-15 01:02:41,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 176 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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:41,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:02:41,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 218 [2025-03-15 01:02:41,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:02:41,669 INFO L124 PetriNetUnfolderBase]: 242/817 cut-off events. [2025-03-15 01:02:41,669 INFO L125 PetriNetUnfolderBase]: For 5248/5616 co-relation queries the response was YES. [2025-03-15 01:02:41,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2679 conditions, 817 events. 242/817 cut-off events. For 5248/5616 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4550 event pairs, 186 based on Foata normal form. 0/705 useless extension candidates. Maximal degree in co-relation 2319. Up to 282 conditions per place. [2025-03-15 01:02:41,673 INFO L140 encePairwiseOnDemand]: 216/218 looper letters, 0 selfloop transitions, 0 changer transitions 175/175 dead transitions. [2025-03-15 01:02:41,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 175 transitions, 658 flow [2025-03-15 01:02:41,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:02:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:02:41,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 570 transitions. [2025-03-15 01:02:41,675 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8715596330275229 [2025-03-15 01:02:41,676 INFO L298 CegarLoopForPetriNet]: 216 programPoint places, -17 predicate places. [2025-03-15 01:02:41,676 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 175 transitions, 658 flow [2025-03-15 01:02:41,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.66666666666666) internal successors, (566), 3 states have internal predecessors, (566), 0 states have call successors, (0), 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:41,684 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/popl20-more-array-sum-alt2.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 01:02:41,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 45 remaining) [2025-03-15 01:02:41,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-03-15 01:02:41,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-03-15 01:02:41,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-03-15 01:02:41,707 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-03-15 01:02:41,708 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-03-15 01:02:41,709 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-03-15 01:02:41,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:02:41,710 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:02:41,714 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:02:41,714 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:02:41,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:02:41 BasicIcfg [2025-03-15 01:02:41,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:02:41,719 INFO L158 Benchmark]: Toolchain (without parser) took 3939.83ms. Allocated memory was 71.3MB in the beginning and 260.0MB in the end (delta: 188.7MB). Free memory was 44.5MB in the beginning and 178.1MB in the end (delta: -133.6MB). Peak memory consumption was 186.4MB. Max. memory is 8.0GB. [2025-03-15 01:02:41,719 INFO L158 Benchmark]: CDTParser took 1.56ms. Allocated memory is still 71.3MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:02:41,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:02:41,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.41ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 29.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:02:41,720 INFO L158 Benchmark]: Boogie Preprocessor took 52.06ms. Allocated memory is still 71.3MB. Free memory was 29.4MB in the beginning and 27.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:02:41,720 INFO L158 Benchmark]: RCFGBuilder took 762.42ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 20.7MB in the end (delta: 6.9MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. [2025-03-15 01:02:41,720 INFO L158 Benchmark]: TraceAbstraction took 2809.28ms. Allocated memory was 71.3MB in the beginning and 260.0MB in the end (delta: 188.7MB). Free memory was 19.5MB in the beginning and 178.1MB in the end (delta: -158.5MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. [2025-03-15 01:02:41,721 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.56ms. Allocated memory is still 71.3MB. Free memory is still 35.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.05ms. Allocated memory is still 71.3MB. Free memory was 44.3MB in the beginning and 31.9MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.41ms. Allocated memory is still 71.3MB. Free memory was 31.7MB in the beginning and 29.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.06ms. Allocated memory is still 71.3MB. Free memory was 29.4MB in the beginning and 27.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 762.42ms. Allocated memory is still 71.3MB. Free memory was 27.6MB in the beginning and 20.7MB in the end (delta: 6.9MB). Peak memory consumption was 18.6MB. Max. memory is 8.0GB. * TraceAbstraction took 2809.28ms. Allocated memory was 71.3MB in the beginning and 260.0MB in the end (delta: 188.7MB). Free memory was 19.5MB in the beginning and 178.1MB in the end (delta: -158.5MB). Peak memory consumption was 161.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 106]: 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: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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, 267 locations, 45 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 33 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 33 mSDsluCounter, 64 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 219 IncrementalHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 64 mSDtfsCounter, 219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=8, InterpolantAutomatonStates: 27, 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.8s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 528 ConstructedInterpolants, 0 QuantifiedInterpolants, 657 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 26 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:02:41,734 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...