/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 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/dot-product-array.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 10:27:57,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 10:27:57,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 10:27:57,508 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 10:27:57,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 10:27:57,529 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 10:27:57,529 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 10:27:57,529 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 10:27:57,530 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 10:27:57,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 10:27:57,530 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 10:27:57,530 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 10:27:57,531 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 10:27:57,531 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 10:27:57,531 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 10:27:57,531 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 10:27:57,531 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 10:27:57,532 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 10:27:57,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 10:27:57,532 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 10:27:57,533 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 10:27:57,533 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 10:27:57,533 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 -> SUFFICIENT Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> false [2025-04-25 10:27:57,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 10:27:57,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 10:27:57,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 10:27:57,763 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-25 10:27:57,766 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-25 10:27:57,767 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product-array.wvr.bpl [2025-04-25 10:27:57,768 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/dot-product-array.wvr.bpl' [2025-04-25 10:27:57,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 10:27:57,791 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-25 10:27:57,792 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 10:27:57,792 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 10:27:57,792 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 10:27:57,799 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,820 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,828 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-25 10:27:57,829 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 10:27:57,830 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 10:27:57,830 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 10:27:57,830 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 10:27:57,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,838 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,842 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,846 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 10:27:57,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 10:27:57,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 10:27:57,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 10:27:57,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/1) ... [2025-04-25 10:27:57,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 10:27:57,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 10:27:57,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 10:27:57,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 10:27:57,906 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-25 10:27:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-25 10:27:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-25 10:27:57,907 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-25 10:27:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-25 10:27:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-25 10:27:57,907 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-25 10:27:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 10:27:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 10:27:57,907 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-25 10:27:57,907 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-25 10:27:57,907 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-25 10:27:57,908 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 10:27:57,942 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 10:27:57,944 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 10:27:58,016 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 10:27:58,016 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 10:27:58,031 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 10:27:58,032 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 10:27:58,032 INFO L201 PluginConnector]: Adding new model dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 10:27:58 BoogieIcfgContainer [2025-04-25 10:27:58,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 10:27:58,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 10:27:58,034 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 10:27:58,037 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 10:27:58,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.04 10:27:57" (1/2) ... [2025-04-25 10:27:58,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4813e61b and model type dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 10:27:58, skipping insertion in model container [2025-04-25 10:27:58,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "dot-product-array.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 10:27:58" (2/2) ... [2025-04-25 10:27:58,039 INFO L128 eAbstractionObserver]: Analyzing ICFG dot-product-array.wvr.bpl [2025-04-25 10:27:58,048 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 10:27:58,049 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dot-product-array.wvr.bpl that has 4 procedures, 27 locations, 26 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-25 10:27:58,049 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 10:27:58,084 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-25 10:27:58,117 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 10:27:58,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 10:27:58,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 10:27:58,120 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 10:27:58,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 10:27:58,174 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 10:27:58,186 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 10:27:58,191 INFO L340 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;@76b059aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 10:27:58,191 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-25 10:27:58,260 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:58,260 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:58,261 INFO L139 ounterexampleChecker]: Examining path program with hash 2005930966, occurence #1 [2025-04-25 10:27:58,261 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:58,261 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:58,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:58,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1923398740, now seen corresponding path program 1 times [2025-04-25 10:27:58,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:58,272 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409227629] [2025-04-25 10:27:58,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 10:27:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:58,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-25 10:27:58,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-25 10:27:58,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 10:27:58,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:58,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:58,431 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409227629] [2025-04-25 10:27:58,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409227629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 10:27:58,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 10:27:58,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 10:27:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864895995] [2025-04-25 10:27:58,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 10:27:58,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 10:27:58,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:58,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 10:27:58,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 10:27:58,453 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,454 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:58,470 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-04-25 10:27:58,471 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:58,503 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 10:27:58,503 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:58,503 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:58,503 INFO L139 ounterexampleChecker]: Examining path program with hash -976497820, occurence #1 [2025-04-25 10:27:58,503 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:58,503 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:58,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:58,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1839273582, now seen corresponding path program 1 times [2025-04-25 10:27:58,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:58,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350478977] [2025-04-25 10:27:58,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 10:27:58,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:58,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-25 10:27:58,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 10:27:58,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 10:27:58,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:58,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 10:27:58,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:58,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350478977] [2025-04-25 10:27:58,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350478977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 10:27:58,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 10:27:58,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 10:27:58,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358323397] [2025-04-25 10:27:58,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 10:27:58,621 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-25 10:27:58,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:58,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-25 10:27:58,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-25 10:27:58,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,622 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:58,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-04-25 10:27:58,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:58,622 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,705 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:58,706 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:58,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 10:27:58,706 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:58,706 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:58,707 INFO L139 ounterexampleChecker]: Examining path program with hash 2044170120, occurence #1 [2025-04-25 10:27:58,707 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:58,707 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:58,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:58,707 INFO L85 PathProgramCache]: Analyzing trace with hash -480228658, now seen corresponding path program 1 times [2025-04-25 10:27:58,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:58,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279522289] [2025-04-25 10:27:58,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 10:27:58,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:58,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-25 10:27:58,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-25 10:27:58,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 10:27:58,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:58,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:58,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:58,767 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279522289] [2025-04-25 10:27:58,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279522289] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 10:27:58,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 10:27:58,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-25 10:27:58,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306807518] [2025-04-25 10:27:58,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 10:27:58,768 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 10:27:58,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:58,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 10:27:58,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 10:27:58,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,768 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:58,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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-04-25 10:27:58,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:58,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:58,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:58,816 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:58,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:58,817 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:58,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 10:27:58,817 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:58,817 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:58,817 INFO L139 ounterexampleChecker]: Examining path program with hash 662202670, occurence #1 [2025-04-25 10:27:58,817 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:58,817 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:58,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:58,818 INFO L85 PathProgramCache]: Analyzing trace with hash 352571788, now seen corresponding path program 1 times [2025-04-25 10:27:58,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:58,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183270504] [2025-04-25 10:27:58,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 10:27:58,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:58,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-25 10:27:58,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-25 10:27:58,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 10:27:58,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:59,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:59,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:59,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183270504] [2025-04-25 10:27:59,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183270504] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 10:27:59,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 10:27:59,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 10:27:59,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527805726] [2025-04-25 10:27:59,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 10:27:59,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 10:27:59,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:59,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 10:27:59,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-25 10:27:59,162 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,162 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:59,162 INFO L486 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-04-25 10:27:59,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,162 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:27:59,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-25 10:27:59,293 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:59,293 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:59,293 INFO L139 ounterexampleChecker]: Examining path program with hash 1974741180, occurence #1 [2025-04-25 10:27:59,293 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:59,293 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:59,293 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:59,293 INFO L85 PathProgramCache]: Analyzing trace with hash 424513738, now seen corresponding path program 2 times [2025-04-25 10:27:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:59,293 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985892807] [2025-04-25 10:27:59,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 10:27:59,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:59,298 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-25 10:27:59,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 10:27:59,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 10:27:59,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:59,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:59,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:59,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985892807] [2025-04-25 10:27:59,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985892807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 10:27:59,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 10:27:59,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-25 10:27:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872121625] [2025-04-25 10:27:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 10:27:59,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 10:27:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:59,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 10:27:59,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-25 10:27:59,378 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,378 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:59,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 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-04-25 10:27:59,378 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,378 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,378 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,378 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:27:59,378 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,494 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:27:59,495 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 10:27:59,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-25 10:27:59,495 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:27:59,495 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:27:59,495 INFO L139 ounterexampleChecker]: Examining path program with hash -1567298499, occurence #1 [2025-04-25 10:27:59,495 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:27:59,495 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:27:59,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:27:59,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1174542922, now seen corresponding path program 3 times [2025-04-25 10:27:59,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:27:59,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092466603] [2025-04-25 10:27:59,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 10:27:59,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:27:59,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-25 10:27:59,501 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 10:27:59,502 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 10:27:59,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:59,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:59,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:27:59,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092466603] [2025-04-25 10:27:59,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092466603] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 10:27:59,594 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009955936] [2025-04-25 10:27:59,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 10:27:59,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 10:27:59,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 10:27:59,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 10:27:59,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 10:27:59,619 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 24 statements into 2 equivalence classes. [2025-04-25 10:27:59,629 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 10:27:59,629 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-25 10:27:59,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:27:59,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 10:27:59,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 10:27:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:59,707 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 10:27:59,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:27:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009955936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 10:27:59,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 10:27:59,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-04-25 10:27:59,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577696053] [2025-04-25 10:27:59,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 10:27:59,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-25 10:27:59,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:27:59,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-25 10:27:59,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-25 10:27:59,780 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,780 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:27:59,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 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-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 10:27:59,781 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 10:27:59,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 10:27:59,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-25 10:28:00,169 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-25 10:28:00,169 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:28:00,169 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:28:00,169 INFO L139 ounterexampleChecker]: Examining path program with hash -2005995350, occurence #1 [2025-04-25 10:28:00,169 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-25 10:28:00,169 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:28:00,170 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:28:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1450160648, now seen corresponding path program 4 times [2025-04-25 10:28:00,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:28:00,170 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297524266] [2025-04-25 10:28:00,170 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 10:28:00,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:28:00,173 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-25 10:28:00,178 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 10:28:00,179 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 10:28:00,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:28:00,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:28:00,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:28:00,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297524266] [2025-04-25 10:28:00,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297524266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 10:28:00,538 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940578603] [2025-04-25 10:28:00,538 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-25 10:28:00,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 10:28:00,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 10:28:00,540 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 10:28:00,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 10:28:00,562 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-25 10:28:00,570 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-25 10:28:00,570 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-25 10:28:00,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:28:00,571 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-25 10:28:00,572 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 10:28:00,786 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:00,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 31 [2025-04-25 10:28:00,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:28:00,798 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 10:28:00,897 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:00,897 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 74 [2025-04-25 10:28:00,932 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:00,932 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 112 [2025-04-25 10:28:00,959 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:00,959 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 103 treesize of output 103 [2025-04-25 10:28:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:28:02,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940578603] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 10:28:02,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 10:28:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 23 [2025-04-25 10:28:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207755623] [2025-04-25 10:28:02,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 10:28:02,109 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-25 10:28:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 10:28:02,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-25 10:28:02,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2025-04-25 10:28:02,110 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:28:02,110 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 10:28:02,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.5416666666666665) internal successors, (61), 23 states have internal predecessors, (61), 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-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. [2025-04-25 10:28:02,110 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-25 10:28:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-04-25 10:28:02,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 10:28:02,896 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 10:28:02,896 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-25 10:28:02,896 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-25 10:28:02,896 INFO L139 ounterexampleChecker]: Examining path program with hash -2005995350, occurence #2 [2025-04-25 10:28:02,896 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-25 10:28:02,897 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 1 [2025-04-25 10:28:02,897 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 10:28:02,897 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-25 10:28:02,897 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 10:28:02,897 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 31 [2025-04-25 10:28:02,897 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-25 10:28:02,897 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 32 [2025-04-25 10:28:02,898 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-25 10:28:02,898 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-25 10:28:02,898 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-25 10:28:02,898 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 10:28:02,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1636787968, now seen corresponding path program 5 times [2025-04-25 10:28:02,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 10:28:02,898 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909012380] [2025-04-25 10:28:02,898 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 10:28:02,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 10:28:02,902 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-25 10:28:02,921 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 10:28:02,921 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-25 10:28:02,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:28:03,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-25 10:28:03,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 10:28:03,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909012380] [2025-04-25 10:28:03,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909012380] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 10:28:03,302 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734583920] [2025-04-25 10:28:03,302 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-25 10:28:03,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 10:28:03,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 10:28:03,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 10:28:03,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 10:28:03,322 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 34 statements into 4 equivalence classes. [2025-04-25 10:28:03,331 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-04-25 10:28:03,331 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-25 10:28:03,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 10:28:03,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-25 10:28:03,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 10:28:03,644 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:03,644 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 135 [2025-04-25 10:28:03,660 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 112 [2025-04-25 10:28:03,662 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 88 [2025-04-25 10:28:03,688 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 10:28:03,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 10:28:03,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:03,931 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 101 treesize of output 226 [2025-04-25 10:28:04,103 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:04,104 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 73 treesize of output 518 [2025-04-25 10:28:04,222 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 10:28:04,223 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 12 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 505 treesize of output 461 [2025-04-25 10:30:13,611 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-25 10:30:13,611 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-25 10:30:13,612 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-25 10:30:13,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-25 10:30:13,812 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 10:30:13,818 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-25 10:30:13,819 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.PartialOrderCegarLoop.isCounterexampleFeasible(PartialOrderCegarLoop.java:320) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 70 more [2025-04-25 10:30:13,823 INFO L158 Benchmark]: Toolchain (without parser) took 136032.30ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 102.3MB in the beginning and 899.5MB in the end (delta: -797.2MB). Peak memory consumption was 844.8MB. Max. memory is 16.0GB. [2025-04-25 10:30:13,824 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 10:30:13,824 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 10:30:13,824 INFO L158 Benchmark]: Boogie Preprocessor took 25.10ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 936.6kB). There was no memory consumed. Max. memory is 16.0GB. [2025-04-25 10:30:13,824 INFO L158 Benchmark]: RCFGBuilder took 176.71ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 89.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. [2025-04-25 10:30:13,826 INFO L158 Benchmark]: TraceAbstraction took 135789.19ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 88.4MB in the beginning and 899.5MB in the end (delta: -811.1MB). Peak memory consumption was 828.0MB. Max. memory is 16.0GB. [2025-04-25 10:30:13,828 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.17ms. Allocated memory is still 167.8MB. Free memory is still 103.2MB. There was no memory consumed. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.43ms. Allocated memory is still 167.8MB. Free memory was 102.3MB in the beginning and 100.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * Boogie Preprocessor took 25.10ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 99.6MB in the end (delta: 936.6kB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 176.71ms. Allocated memory is still 167.8MB. Free memory was 98.7MB in the beginning and 89.3MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.0GB. * TraceAbstraction took 135789.19ms. Allocated memory was 167.8MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 88.4MB in the beginning and 899.5MB in the end (delta: -811.1MB). Peak memory consumption was 828.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...