/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks false -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-a343466-m [2025-01-30 01:45:00,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-30 01:45:00,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-30 01:45:00,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-30 01:45:00,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-30 01:45:00,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-30 01:45:00,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-30 01:45:00,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-30 01:45:00,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-30 01:45:00,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-30 01:45:00,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-30 01:45:00,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-30 01:45:00,424 INFO L153 SettingsManager]: * Use SBE=true [2025-01-30 01:45:00,424 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-30 01:45:00,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-30 01:45:00,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 01:45:00,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-30 01:45:00,426 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-01-30 01:45:00,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-30 01:45:00,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-30 01:45:00,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-30 01:45:00,628 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-01-30 01:45:00,630 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-01-30 01:45:00,631 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl [2025-01-30 01:45:00,631 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/multiply-verify.wvr.bpl' [2025-01-30 01:45:00,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-30 01:45:00,660 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-01-30 01:45:00,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-30 01:45:00,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-30 01:45:00,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-30 01:45:00,667 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,675 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-01-30 01:45:00,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-30 01:45:00,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-30 01:45:00,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-30 01:45:00,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-30 01:45:00,682 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,683 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,683 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,685 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,688 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,688 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-30 01:45:00,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-30 01:45:00,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-30 01:45:00,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-30 01:45:00,690 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/1) ... [2025-01-30 01:45:00,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-30 01:45:00,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 01:45:00,719 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-30 01:45:00,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-30 01:45:00,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-01-30 01:45:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-30 01:45:00,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-30 01:45:00,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-01-30 01:45:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-30 01:45:00,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-30 01:45:00,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-01-30 01:45:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-30 01:45:00,741 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-30 01:45:00,741 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-01-30 01:45:00,741 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-30 01:45:00,741 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-30 01:45:00,742 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-30 01:45:00,776 INFO L234 CfgBuilder]: Building ICFG [2025-01-30 01:45:00,777 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-30 01:45:00,853 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-30 01:45:00,854 INFO L283 CfgBuilder]: Performing block encoding [2025-01-30 01:45:00,871 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-30 01:45:00,871 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-30 01:45:00,872 INFO L201 PluginConnector]: Adding new model multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:45:00 BoogieIcfgContainer [2025-01-30 01:45:00,872 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-30 01:45:00,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-30 01:45:00,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-30 01:45:00,878 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-30 01:45:00,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.01 01:45:00" (1/2) ... [2025-01-30 01:45:00,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56faffa9 and model type multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 01:45:00, skipping insertion in model container [2025-01-30 01:45:00,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 01:45:00" (2/2) ... [2025-01-30 01:45:00,879 INFO L128 eAbstractionObserver]: Analyzing ICFG multiply-verify.wvr.bpl [2025-01-30 01:45:00,890 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-30 01:45:00,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG multiply-verify.wvr.bpl that has 4 procedures, 32 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-30 01:45:00,892 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-30 01:45:00,940 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-30 01:45:00,978 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 01:45:00,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-30 01:45:00,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 01:45:00,981 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-30 01:45:00,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-30 01:45:01,023 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-30 01:45:01,037 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-30 01:45:01,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=PARTIAL_ORDER_FA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4840b0f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-30 01:45:01,042 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-01-30 01:45:01,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:01,184 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:01,184 INFO L139 ounterexampleChecker]: Examining path program with hash 2063236976, occurence #1 [2025-01-30 01:45:01,184 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:01,184 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:01,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:01,188 INFO L85 PathProgramCache]: Analyzing trace with hash 682429458, now seen corresponding path program 1 times [2025-01-30 01:45:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:01,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334756321] [2025-01-30 01:45:01,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:45:01,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:01,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-30 01:45:01,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-30 01:45:01,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:45:01,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:01,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334756321] [2025-01-30 01:45:01,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334756321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:01,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:01,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-30 01:45:01,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060234401] [2025-01-30 01:45:01,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:01,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-30 01:45:01,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:01,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-30 01:45:01,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-30 01:45:01,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:01,444 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:01,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 2 states have internal predecessors, (22), 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-01-30 01:45:01,445 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:01,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:01,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-30 01:45:01,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:01,545 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:01,545 INFO L139 ounterexampleChecker]: Examining path program with hash -398802458, occurence #1 [2025-01-30 01:45:01,545 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:01,545 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:01,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1089577184, now seen corresponding path program 2 times [2025-01-30 01:45:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117893421] [2025-01-30 01:45:01,546 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 01:45:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:01,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-01-30 01:45:01,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-30 01:45:01,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-30 01:45:01,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:01,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:01,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:01,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117893421] [2025-01-30 01:45:01,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117893421] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:01,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:01,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-30 01:45:01,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528028066] [2025-01-30 01:45:01,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:01,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-30 01:45:01,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:01,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-30 01:45:01,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-30 01:45:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:01,829 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:01,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 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-01-30 01:45:01,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:01,829 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:01,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:01,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-30 01:45:01,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:01,945 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:01,945 INFO L139 ounterexampleChecker]: Examining path program with hash -1571624684, occurence #1 [2025-01-30 01:45:01,945 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:01,945 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:01,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1981590125, now seen corresponding path program 1 times [2025-01-30 01:45:01,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:01,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641021197] [2025-01-30 01:45:01,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:45:01,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:01,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-30 01:45:01,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-30 01:45:01,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:45:01,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:01,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:01,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:01,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641021197] [2025-01-30 01:45:01,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641021197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:01,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:01,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 01:45:01,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048677283] [2025-01-30 01:45:01,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:01,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 01:45:01,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:01,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 01:45:01,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-30 01:45:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:01,998 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-30 01:45:01,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:01,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:01,998 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-30 01:45:02,139 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:02,139 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:02,139 INFO L139 ounterexampleChecker]: Examining path program with hash 32324219, occurence #1 [2025-01-30 01:45:02,139 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:02,139 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:02,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1624546295, now seen corresponding path program 1 times [2025-01-30 01:45:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:02,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716590107] [2025-01-30 01:45:02,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:45:02,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:02,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-30 01:45:02,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-30 01:45:02,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:45:02,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:02,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:02,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716590107] [2025-01-30 01:45:02,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716590107] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:02,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:02,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-30 01:45:02,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215096532] [2025-01-30 01:45:02,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:02,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-30 01:45:02,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:02,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-30 01:45:02,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-30 01:45:02,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,197 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:02,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 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-01-30 01:45:02,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-30 01:45:02,283 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:02,283 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:02,283 INFO L139 ounterexampleChecker]: Examining path program with hash -2003993322, occurence #1 [2025-01-30 01:45:02,283 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:02,283 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:02,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1933604872, now seen corresponding path program 1 times [2025-01-30 01:45:02,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:02,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420966775] [2025-01-30 01:45:02,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-30 01:45:02,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:02,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-30 01:45:02,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-30 01:45:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-30 01:45:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420966775] [2025-01-30 01:45:02,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420966775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:02,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:02,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-30 01:45:02,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458296923] [2025-01-30 01:45:02,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:02,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-30 01:45:02,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:02,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-30 01:45:02,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-30 01:45:02,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,456 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:02,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 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-01-30 01:45:02,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,456 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-30 01:45:02,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:02,573 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:02,573 INFO L139 ounterexampleChecker]: Examining path program with hash 1118151748, occurence #1 [2025-01-30 01:45:02,573 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:02,573 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:02,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:02,573 INFO L85 PathProgramCache]: Analyzing trace with hash 465810347, now seen corresponding path program 2 times [2025-01-30 01:45:02,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:02,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097601046] [2025-01-30 01:45:02,573 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-30 01:45:02,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:02,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-01-30 01:45:02,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-30 01:45:02,586 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-30 01:45:02,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:02,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:02,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097601046] [2025-01-30 01:45:02,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097601046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-30 01:45:02,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-30 01:45:02,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-30 01:45:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215620011] [2025-01-30 01:45:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-30 01:45:02,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-30 01:45:02,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:02,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-30 01:45:02,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-30 01:45:02,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,635 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:02,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:02,635 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:02,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:45:02,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-30 01:45:02,770 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-01-30 01:45:02,770 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-30 01:45:02,770 INFO L139 ounterexampleChecker]: Examining path program with hash -1512224626, occurence #1 [2025-01-30 01:45:02,770 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-30 01:45:02,770 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-30 01:45:02,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-30 01:45:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -223020529, now seen corresponding path program 3 times [2025-01-30 01:45:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-30 01:45:02,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304602282] [2025-01-30 01:45:02,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 01:45:02,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-30 01:45:02,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-30 01:45:02,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-30 01:45:02,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-30 01:45:02,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-30 01:45:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304602282] [2025-01-30 01:45:02,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304602282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-30 01:45:02,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186513582] [2025-01-30 01:45:02,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-30 01:45:02,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 01:45:02,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-30 01:45:02,826 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-30 01:45:02,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-30 01:45:02,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 2 equivalence classes. [2025-01-30 01:45:02,855 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-01-30 01:45:02,855 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-30 01:45:02,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-30 01:45:02,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-30 01:45:02,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-30 01:45:02,942 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,942 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-30 01:45:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-30 01:45:02,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186513582] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-30 01:45:02,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-30 01:45:02,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 10 [2025-01-30 01:45:02,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721440410] [2025-01-30 01:45:02,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-30 01:45:02,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-30 01:45:02,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-30 01:45:02,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-30 01:45:02,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-30 01:45:02,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:02,995 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-30 01:45:02,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 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-01-30 01:45:02,995 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-01-30 01:45:02,996 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-30 01:45:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-30 01:45:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-30 01:45:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:03,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-30 01:45:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-30 01:45:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-30 01:45:03,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (3 of 4 remaining) [2025-01-30 01:45:03,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-01-30 01:45:03,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-01-30 01:45:03,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-01-30 01:45:03,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-30 01:45:03,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-30 01:45:03,518 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-01-30 01:45:03,520 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-30 01:45:03,520 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-30 01:45:03,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-30 01:45:03,528 INFO L201 PluginConnector]: Adding new model multiply-verify.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 01:45:03 BasicIcfg [2025-01-30 01:45:03,528 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-30 01:45:03,529 INFO L158 Benchmark]: Toolchain (without parser) took 2869.00ms. Allocated memory was 226.5MB in the beginning and 167.8MB in the end (delta: -58.7MB). Free memory was 142.5MB in the beginning and 54.3MB in the end (delta: 88.2MB). Peak memory consumption was 24.9MB. Max. memory is 16.0GB. [2025-01-30 01:45:03,529 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:45:03,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 15.97ms. Allocated memory is still 226.5MB. Free memory was 142.5MB in the beginning and 141.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:45:03,530 INFO L158 Benchmark]: Boogie Preprocessor took 11.86ms. Allocated memory is still 226.5MB. Free memory was 141.3MB in the beginning and 140.7MB in the end (delta: 599.2kB). There was no memory consumed. Max. memory is 16.0GB. [2025-01-30 01:45:03,530 INFO L158 Benchmark]: RCFGBuilder took 182.13ms. Allocated memory is still 226.5MB. Free memory was 140.7MB in the beginning and 130.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-01-30 01:45:03,530 INFO L158 Benchmark]: TraceAbstraction took 2654.12ms. Allocated memory was 226.5MB in the beginning and 167.8MB in the end (delta: -58.7MB). Free memory was 130.3MB in the beginning and 54.3MB in the end (delta: 76.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.0GB. [2025-01-30 01:45:03,531 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 144.0MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 15.97ms. Allocated memory is still 226.5MB. Free memory was 142.5MB in the beginning and 141.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 11.86ms. Allocated memory is still 226.5MB. Free memory was 141.3MB in the beginning and 140.7MB in the end (delta: 599.2kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 182.13ms. Allocated memory is still 226.5MB. Free memory was 140.7MB in the beginning and 130.9MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 2654.12ms. Allocated memory was 226.5MB in the beginning and 167.8MB in the end (delta: -58.7MB). Free memory was 130.3MB in the beginning and 54.3MB in the end (delta: 76.0MB). Peak memory consumption was 16.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2661, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 246, dependent conditional: 240, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2453, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 38, dependent conditional: 32, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2453, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 38, dependent conditional: 32, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 271, dependent conditional: 265, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 47, independent unconditional: 2368, dependent: 271, dependent conditional: 38, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 47, independent unconditional: 2368, dependent: 271, dependent conditional: 38, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 618, independent: 608, independent conditional: 15, independent unconditional: 593, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 618, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 299, independent: 162, independent conditional: 129, independent unconditional: 33, dependent: 138, dependent conditional: 34, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2686, independent: 1807, independent conditional: 32, independent unconditional: 1775, dependent: 261, dependent conditional: 34, dependent unconditional: 227, unknown: 618, unknown conditional: 19, unknown unconditional: 599] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 608, Positive conditional cache size: 15, Positive unconditional cache size: 593, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1938, Maximal queried relation: 6, Independence queries for same thread: 208, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 168, Number of trivial persistent sets: 133, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 663, independent: 657, independent conditional: 0, independent unconditional: 657, dependent: 6, dependent conditional: 0, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2661, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 246, dependent conditional: 240, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2453, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 38, dependent conditional: 32, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2453, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 38, dependent conditional: 32, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 1758, independent unconditional: 657, dependent: 271, dependent conditional: 265, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 47, independent unconditional: 2368, dependent: 271, dependent conditional: 38, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2686, independent: 2415, independent conditional: 47, independent unconditional: 2368, dependent: 271, dependent conditional: 38, dependent unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 618, independent: 608, independent conditional: 15, independent unconditional: 593, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 618, independent: 591, independent conditional: 0, independent unconditional: 591, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 27, independent: 17, independent conditional: 15, independent unconditional: 2, dependent: 10, dependent conditional: 4, dependent unconditional: 6, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 299, independent: 162, independent conditional: 129, independent unconditional: 33, dependent: 138, dependent conditional: 34, dependent unconditional: 104, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2686, independent: 1807, independent conditional: 32, independent unconditional: 1775, dependent: 261, dependent conditional: 34, dependent unconditional: 227, unknown: 618, unknown conditional: 19, unknown unconditional: 599] , Statistics on independence cache: Total cache size (in pairs): 618, Positive cache size: 608, Positive conditional cache size: 15, Positive unconditional cache size: 593, Negative cache size: 10, Negative conditional cache size: 4, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1938, Maximal queried relation: 6, Independence queries for same thread: 208 - PositiveResult [Line: 68]: assertion always holds For all program executions holds that assertion always holds at this location - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 55 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, 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.9s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 237 ConstructedInterpolants, 0 QuantifiedInterpolants, 727 SizeOfPredicates, 4 NumberOfNonLiveVariables, 69 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 2/11 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-30 01:45:03,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...