/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:10,144 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:10,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:10,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:10,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:10,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:10,221 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:10,221 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:10,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:10,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:10,221 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:10,221 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:10,222 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:10,222 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:10,223 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:10,223 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:10,223 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:10,223 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:10,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:10,223 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:10,223 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:10,223 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:10,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:10,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:10,434 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:10,435 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:10,435 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:10,436 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl [2025-04-26 16:20:10,436 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/equal-array-sums-locked.bpl' [2025-04-26 16:20:10,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:10,457 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:10,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:10,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:10,459 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:10,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,501 INFO L138 Inliner]: procedures = 5, calls = 6, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 20 [2025-04-26 16:20:10,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:10,503 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:10,503 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:10,503 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:10,507 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,508 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,509 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,509 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,512 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,516 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:10,516 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:10,516 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:10,516 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:10,517 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/1) ... [2025-04-26 16:20:10,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:10,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:10,537 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:10,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:10,556 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:20:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:20:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:20:10,557 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:20:10,557 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:20:10,557 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:20:10,558 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:10,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:10,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:10,558 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:10,592 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:10,594 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:10,657 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:10,658 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:10,666 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:10,667 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:10,667 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:10 BoogieIcfgContainer [2025-04-26 16:20:10,667 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:10,668 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:10,668 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:10,672 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:10,672 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:10,672 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:10" (1/2) ... [2025-04-26 16:20:10,673 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3ac14f9e and model type equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:10, skipping insertion in model container [2025-04-26 16:20:10,673 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:10,673 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:10" (2/2) ... [2025-04-26 16:20:10,674 INFO L376 chiAutomizerObserver]: Analyzing ICFG equal-array-sums-locked.bpl [2025-04-26 16:20:10,714 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:20:10,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 72 flow [2025-04-26 16:20:10,764 INFO L116 PetriNetUnfolderBase]: 2/25 cut-off events. [2025-04-26 16:20:10,765 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:20:10,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 2/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 41 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:20:10,770 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 72 flow [2025-04-26 16:20:10,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 25 transitions, 62 flow [2025-04-26 16:20:10,773 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 30 places, 25 transitions, 62 flow [2025-04-26 16:20:10,781 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:10,781 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:10,781 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:10,781 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:10,782 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:10,782 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:10,782 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:10,782 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:10,783 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:10,814 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2025-04-26 16:20:10,814 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:10,814 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:10,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:10,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:10,817 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:10,817 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 86 states, but on-demand construction may add more states [2025-04-26 16:20:10,820 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 65 [2025-04-26 16:20:10,820 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:10,820 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:10,820 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:10,820 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:10,824 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y]" "[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0]" "[66] $Ultimate##0-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_1| 0) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1]" [2025-04-26 16:20:10,824 INFO L754 eck$LassoCheckResult]: Loop: "[68] L40-1-->L65: Formula: (< |v_thread1Thread1of1ForFork0_i#1_5| v_n_1) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_5|, n=v_n_1} AuxVars[] AssignedVars[]" "[70] L65-->L65-2: Formula: (and (not v_m_8) v_m_7) InVars {m=v_m_8} OutVars{m=v_m_7} AuxVars[] AssignedVars[m]" "[71] L65-2-->L71: Formula: (= v_x_1 (+ (select v_A_1 |v_thread1Thread1of1ForFork0_i#1_7|) v_x_2)) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[x]" "[72] L71-->L68: Formula: (not v_m_3) InVars {} OutVars{m=v_m_3} AuxVars[] AssignedVars[m]" "[73] L68-->L40-1: Formula: (= |v_thread1Thread1of1ForFork0_i#1_10| (+ |v_thread1Thread1of1ForFork0_i#1_9| 1)) InVars {thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_9|} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1]" [2025-04-26 16:20:10,828 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash 2881826, now seen corresponding path program 1 times [2025-04-26 16:20:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:10,833 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813453914] [2025-04-26 16:20:10,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:10,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:10,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:10,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:10,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,882 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:10,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:10,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:10,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:10,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:10,901 INFO L85 PathProgramCache]: Analyzing trace with hash 93584485, now seen corresponding path program 1 times [2025-04-26 16:20:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:10,901 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207951374] [2025-04-26 16:20:10,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:10,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:10,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:10,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:10,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:10,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:10,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,915 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:10,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:10,916 INFO L85 PathProgramCache]: Analyzing trace with hash -2025091100, now seen corresponding path program 1 times [2025-04-26 16:20:10,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:10,916 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587323459] [2025-04-26 16:20:10,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:10,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:10,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:10,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:10,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,928 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:10,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:10,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:10,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:10,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:10,934 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:11,069 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:11,070 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:11,070 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:11,070 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:11,070 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:11,070 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,071 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:11,071 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:11,071 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:20:11,071 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:11,071 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:11,085 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,098 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,128 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,212 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:11,215 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:11,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,218 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:11,222 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:11,236 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,236 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,236 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:11,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:11,244 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:11,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:20:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,252 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:11,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,297 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:11,297 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:11,302 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:11,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:11,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,314 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:11,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,327 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,327 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,327 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,327 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,332 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:11,332 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:11,339 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:11,348 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:11,348 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:20:11,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,353 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:11,355 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:11,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:11,372 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:20:11,372 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:11,373 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread1Thread1of1ForFork0_i#1) = 1*n - 1*thread1Thread1of1ForFork0_i#1 Supporting invariants [] [2025-04-26 16:20:11,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:11,383 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:11,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:11,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:11,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:11,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:11,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:11,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:11,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:11,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:11,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:11,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:11,498 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-26 16:20:11,525 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:11,528 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 86 states, but on-demand construction may add more states Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:11,631 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 86 states, but on-demand construction may add more states. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 201 states and 459 transitions. Complement of second has 6 states. [2025-04-26 16:20:11,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:11,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:11,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2025-04-26 16:20:11,643 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 5 letters. [2025-04-26 16:20:11,643 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:11,644 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 9 letters. Loop has 5 letters. [2025-04-26 16:20:11,644 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:11,644 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 54 transitions. Stem has 4 letters. Loop has 10 letters. [2025-04-26 16:20:11,644 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:11,644 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 459 transitions. [2025-04-26 16:20:11,649 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:20:11,655 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 129 states and 294 transitions. [2025-04-26 16:20:11,655 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2025-04-26 16:20:11,656 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-04-26 16:20:11,656 INFO L74 IsDeterministic]: Start isDeterministic. Operand 129 states and 294 transitions. [2025-04-26 16:20:11,656 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:11,656 INFO L218 hiAutomatonCegarLoop]: Abstraction has 129 states and 294 transitions. [2025-04-26 16:20:11,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states and 294 transitions. [2025-04-26 16:20:11,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2025-04-26 16:20:11,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 112 states have (on average 2.2767857142857144) internal successors, (in total 255), 111 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:11,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2025-04-26 16:20:11,681 INFO L240 hiAutomatonCegarLoop]: Abstraction has 112 states and 255 transitions. [2025-04-26 16:20:11,681 INFO L438 stractBuchiCegarLoop]: Abstraction has 112 states and 255 transitions. [2025-04-26 16:20:11,681 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:11,681 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 112 states and 255 transitions. [2025-04-26 16:20:11,683 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 45 [2025-04-26 16:20:11,683 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:11,683 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:11,683 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:11,683 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:11,683 INFO L752 eck$LassoCheckResult]: Stem: "[64] $Ultimate##0-->L24: Formula: (= v_x_5 0) InVars {} OutVars{x=v_x_5} AuxVars[] AssignedVars[x]" "[51] L24-->L26: Formula: (= v_y_5 0) InVars {} OutVars{y=v_y_5} AuxVars[] AssignedVars[y]" "[84] L26-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_i#1=|v_thread1Thread1of1ForFork0_i#1_14|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i#1, thread1Thread1of1ForFork0_thidvar0]" "[87] L26-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_14|, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[74] $Ultimate##0-->L54-1: Formula: (= |v_thread2Thread1of1ForFork1_j#1_1| 0) InVars {} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1]" [2025-04-26 16:20:11,684 INFO L754 eck$LassoCheckResult]: Loop: "[76] L54-1-->L65: Formula: (< |v_thread2Thread1of1ForFork1_j#1_5| v_n_3) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_5|, n=v_n_3} AuxVars[] AssignedVars[]" "[78] L65-->L65-2: Formula: (and v_m_11 (not v_m_12)) InVars {m=v_m_12} OutVars{m=v_m_11} AuxVars[] AssignedVars[m]" "[79] L65-2-->L71: Formula: (= (+ v_y_2 (select v_A_2 |v_thread2Thread1of1ForFork1_j#1_7|)) v_y_1) InVars {A=v_A_2, y=v_y_2, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} OutVars{A=v_A_2, y=v_y_1, thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_7|} AuxVars[] AssignedVars[y]" "[80] L71-->L68: Formula: (not v_m_6) InVars {} OutVars{m=v_m_6} AuxVars[] AssignedVars[m]" "[81] L68-->L54-1: Formula: (= (+ |v_thread2Thread1of1ForFork1_j#1_9| 1) |v_thread2Thread1of1ForFork1_j#1_10|) InVars {thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_9|} OutVars{thread2Thread1of1ForFork1_j#1=|v_thread2Thread1of1ForFork1_j#1_10|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j#1]" [2025-04-26 16:20:11,684 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:11,684 INFO L85 PathProgramCache]: Analyzing trace with hash 89337331, now seen corresponding path program 1 times [2025-04-26 16:20:11,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:11,684 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156959280] [2025-04-26 16:20:11,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:11,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:11,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:11,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,692 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:11,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:11,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:11,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:11,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 101218925, now seen corresponding path program 1 times [2025-04-26 16:20:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:11,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090703440] [2025-04-26 16:20:11,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:11,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:11,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:11,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:11,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:11,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:11,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:11,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:11,709 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:11,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1013042245, now seen corresponding path program 1 times [2025-04-26 16:20:11,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:11,709 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561993414] [2025-04-26 16:20:11,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:11,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:20:11,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:20:11,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,718 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:20:11,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:20:11,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:11,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:11,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:11,793 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:11,794 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:11,794 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:11,794 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:11,794 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:11,794 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,794 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:11,794 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:11,794 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums-locked.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:20:11,794 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:11,794 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:11,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,813 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,817 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,820 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:11,884 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:11,884 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:11,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,887 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:11,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,901 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,902 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:11,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:11,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:11,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:11,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,917 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:11,920 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,930 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:11,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:11,935 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:11,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:11,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,944 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:11,947 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,957 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:11,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:11,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:11,959 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:11,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,967 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:11,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:11,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:11,980 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:11,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:11,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:11,983 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:11,983 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:11,987 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:11,994 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:20:11,994 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:20:11,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:11,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:11,996 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:11,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:20:11,999 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:12,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:12,016 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:20:12,016 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:12,016 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(n, thread2Thread1of1ForFork1_j#1) = 1*n - 1*thread2Thread1of1ForFork1_j#1 Supporting invariants [] [2025-04-26 16:20:12,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:12,023 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:20:12,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:12,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:12,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:12,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:12,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:12,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:12,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:12,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:12,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:12,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:12,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:12,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:12,087 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-26 16:20:12,088 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:20:12,088 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 112 states and 255 transitions. cyclomatic complexity: 155 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:12,136 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 112 states and 255 transitions. cyclomatic complexity: 155. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 282 states and 671 transitions. Complement of second has 6 states. [2025-04-26 16:20:12,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (in total 10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:12,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2025-04-26 16:20:12,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 5 letters. [2025-04-26 16:20:12,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:12,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 10 letters. Loop has 5 letters. [2025-04-26 16:20:12,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:12,138 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 46 transitions. Stem has 5 letters. Loop has 10 letters. [2025-04-26 16:20:12,138 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:12,138 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 282 states and 671 transitions. [2025-04-26 16:20:12,144 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:12,144 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 282 states to 0 states and 0 transitions. [2025-04-26 16:20:12,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:12,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:12,144 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:12,144 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:12,145 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:12,145 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:12,145 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:12,145 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:12,145 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:12,145 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:12,145 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:12,152 INFO L201 PluginConnector]: Adding new model equal-array-sums-locked.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:12 BoogieIcfgContainer [2025-04-26 16:20:12,152 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:12,153 INFO L158 Benchmark]: Toolchain (without parser) took 1695.67ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.0MB in the beginning and 69.9MB in the end (delta: 17.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2025-04-26 16:20:12,154 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 87.9MB in the end (delta: 199.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:12,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.87ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 82.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:12,155 INFO L158 Benchmark]: Boogie Preprocessor took 13.13ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 82.1MB in the end (delta: 837.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:12,155 INFO L158 Benchmark]: RCFGBuilder took 151.03ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:20:12,156 INFO L158 Benchmark]: BuchiAutomizer took 1484.16ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 975.0kB. Max. memory is 8.0GB. [2025-04-26 16:20:12,157 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.18ms. Allocated memory is still 159.4MB. Free memory was 88.1MB in the beginning and 87.9MB in the end (delta: 199.9kB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.87ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 82.9MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 13.13ms. Allocated memory is still 159.4MB. Free memory was 82.9MB in the beginning and 82.1MB in the end (delta: 837.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 151.03ms. Allocated memory is still 159.4MB. Free memory was 81.9MB in the beginning and 72.8MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1484.16ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 72.6MB in the beginning and 69.9MB in the end (delta: 2.7MB). Peak memory consumption was 975.0kB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 46 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital38 mio100 ax100 hnf100 lsp66 ukn92 mio100 lsp60 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 51ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n + -1 * i and consists of 4 locations. One deterministic module has affine ranking function -1 * j + n and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:12,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...