/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/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:52:53,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:52:53,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:52:53,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:52:53,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:52:53,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:52:53,074 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:52:53,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:52:53,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:52:53,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:52:53,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:52:53,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:52:53,094 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:52:53,094 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:52:53,094 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:52:53,094 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:52:53,094 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:52:53,094 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:52:53,095 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:52:53,095 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:52:53,096 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:53,096 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:52:53,096 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:52:53,096 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:52:53,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:52:53,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:52:53,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:52:53,313 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:52:53,314 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:52:53,315 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl [2025-04-26 16:52:53,315 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/regression/equal-array-sums.bpl' [2025-04-26 16:52:53,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:52:53,329 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:52:53,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:53,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:52:53,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:52:53,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,359 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:52:53,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:52:53,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:52:53,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:52:53,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:52:53,367 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,367 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,371 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,371 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,375 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,375 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,375 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,385 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:52:53,386 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:52:53,386 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:52:53,386 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:52:53,389 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/1) ... [2025-04-26 16:52:53,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:52:53,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:53,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:52:53,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:52:53,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:52:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:52:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:52:53,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:52:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:52:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:52:53,436 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:52:53,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:52:53,436 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:52:53,437 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:52:53,470 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:52:53,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:52:53,539 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:52:53,539 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:52:53,551 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:52:53,552 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:52:53,553 INFO L201 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:53 BoogieIcfgContainer [2025-04-26 16:52:53,553 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:52:53,554 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:52:53,554 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:52:53,559 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:52:53,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:53,560 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:52:53" (1/2) ... [2025-04-26 16:52:53,561 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@462b7e22 and model type equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:52:53, skipping insertion in model container [2025-04-26 16:52:53,561 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:52:53,561 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:52:53" (2/2) ... [2025-04-26 16:52:53,562 INFO L376 chiAutomizerObserver]: Analyzing ICFG equal-array-sums.bpl [2025-04-26 16:52:53,606 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:52:53,642 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:52:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:52:53,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:53,644 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-26 16:52:53,646 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-26 16:52:53,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:52:53,716 INFO L116 PetriNetUnfolderBase]: 2/21 cut-off events. [2025-04-26 16:52:53,718 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:52:53,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30 conditions, 21 events. 2/21 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 25 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 15. Up to 2 conditions per place. [2025-04-26 16:52:53,723 INFO L82 GeneralOperation]: Start removeDead. Operand has 28 places, 25 transitions, 64 flow [2025-04-26 16:52:53,725 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 21 transitions, 54 flow [2025-04-26 16:52:53,726 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 26 places, 21 transitions, 54 flow [2025-04-26 16:52:53,730 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:52:53,767 WARN L140 AmpleReduction]: Number of pruned transitions: 22 [2025-04-26 16:52:53,768 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:52:53,768 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 7 [2025-04-26 16:52:53,768 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:17 [2025-04-26 16:52:53,768 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:20 [2025-04-26 16:52:53,768 WARN L145 AmpleReduction]: Times succ was already a loop node:3 [2025-04-26 16:52:53,768 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:9 [2025-04-26 16:52:53,768 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:52:53,771 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:52:53,776 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:52:53,776 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:52:53,776 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:52:53,777 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:52:53,777 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:52:53,777 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:52:53,777 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:52:53,777 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:52:53,778 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:52:53,785 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 16:52:53,786 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:53,786 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:53,788 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:53,788 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:53,788 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:52:53,789 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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:52:53,791 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 27 [2025-04-26 16:52:53,791 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:53,791 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:53,791 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:52:53,791 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:53,794 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L19: Formula: (= v_x_3 0) InVars {} OutVars{x=v_x_3} AuxVars[] AssignedVars[x]" "[45] L19-->L21: Formula: (= v_y_3 0) InVars {} OutVars{y=v_y_3} AuxVars[] AssignedVars[y]" "[64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:52:53,794 INFO L754 eck$LassoCheckResult]: Loop: "[52] L35-1-->L36: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_n_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} AuxVars[] AssignedVars[]" "[54] L36-->L37: Formula: (= v_x_1 (+ v_x_2 (select v_A_1 v_thread1Thread1of1ForFork0_i_7))) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[x]" "[55] L37-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" [2025-04-26 16:52:53,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:53,798 INFO L85 PathProgramCache]: Analyzing trace with hash 2220022, now seen corresponding path program 1 times [2025-04-26 16:52:53,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:53,802 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090188034] [2025-04-26 16:52:53,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:53,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:53,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:53,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:53,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,842 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:53,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:53,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:53,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,857 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:53,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:53,860 INFO L85 PathProgramCache]: Analyzing trace with hash 81492, now seen corresponding path program 1 times [2025-04-26 16:52:53,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:53,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646433] [2025-04-26 16:52:53,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:53,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:53,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:53,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:53,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,870 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:53,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:53,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:53,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,875 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:53,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:53,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1712217663, now seen corresponding path program 1 times [2025-04-26 16:52:53,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:53,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730004998] [2025-04-26 16:52:53,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:53,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:53,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:53,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:53,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,889 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:53,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:52:53,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:52:53,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:53,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:53,899 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:53,996 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:53,997 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:53,997 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:53,997 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:53,997 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:53,998 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:53,998 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:53,998 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:53,998 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:52:53,998 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:53,998 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:54,007 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,015 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,019 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,112 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:54,114 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:54,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,117 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:52:54,118 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:52:54,120 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:52:54,131 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:54,131 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:54,131 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:54,131 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:54,136 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:54,136 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:54,139 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:54,145 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:52:54,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,147 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:52:54,149 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:52:54,150 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:52:54,161 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:54,161 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:54,161 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:54,161 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:54,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:54,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:54,167 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:54,173 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:52:54,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,175 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:52:54,176 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:52:54,177 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:52:54,187 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:54,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:54,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:54,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:54,191 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:54,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:54,200 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:54,238 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:52:54,238 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:52:54,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,243 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:52:54,244 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:52:54,245 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:54,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:52:54,302 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:52:54,303 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:54,303 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork0_i, n) = -1*thread1Thread1of1ForFork0_i + 1*n Supporting invariants [] [2025-04-26 16:52:54,309 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:52:54,312 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:54,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:52:54,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:52:54,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:54,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:54,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:54,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:54,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:54,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:54,368 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:54,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:54,391 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:52:54,410 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:52:54,411 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:52:54,502 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 45 states, 43 states have (on average 1.4186046511627908) internal successors, (in total 61), 44 states have internal predecessors, (61), 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). Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 94 states and 135 transitions. Complement of second has 6 states. [2025-04-26 16:52:54,503 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:52:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:52:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2025-04-26 16:52:54,509 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 3 letters. [2025-04-26 16:52:54,510 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:54,510 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 7 letters. Loop has 3 letters. [2025-04-26 16:52:54,510 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:54,510 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 30 transitions. Stem has 4 letters. Loop has 6 letters. [2025-04-26 16:52:54,510 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:54,510 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 94 states and 135 transitions. [2025-04-26 16:52:54,513 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:52:54,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 94 states to 35 states and 48 transitions. [2025-04-26 16:52:54,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2025-04-26 16:52:54,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2025-04-26 16:52:54,516 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35 states and 48 transitions. [2025-04-26 16:52:54,516 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:52:54,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35 states and 48 transitions. [2025-04-26 16:52:54,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 48 transitions. [2025-04-26 16:52:54,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2025-04-26 16:52:54,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.375) internal successors, (in total 44), 31 states have internal predecessors, (44), 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:52:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2025-04-26 16:52:54,538 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-04-26 16:52:54,538 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 44 transitions. [2025-04-26 16:52:54,538 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:52:54,538 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 44 transitions. [2025-04-26 16:52:54,539 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:52:54,539 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:54,539 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:54,539 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:54,539 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:54,540 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L19: Formula: (= v_x_3 0) InVars {} OutVars{x=v_x_3} AuxVars[] AssignedVars[x]" "[45] L19-->L21: Formula: (= v_y_3 0) InVars {} OutVars{y=v_y_3} AuxVars[] AssignedVars[y]" "[64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L35-1-->thread1FINAL: Formula: (<= v_n_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} AuxVars[] AssignedVars[]" "[53] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L21-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:52:54,540 INFO L754 eck$LassoCheckResult]: Loop: "[58] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_n_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} AuxVars[] AssignedVars[]" "[60] L48-->L49: Formula: (= (+ (select v_A_2 v_thread2Thread1of1ForFork1_j_7) v_y_2) v_y_1) InVars {A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_2} OutVars{A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_1} AuxVars[] AssignedVars[y]" "[61] L49-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:52:54,540 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1539109677, now seen corresponding path program 1 times [2025-04-26 16:52:54,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,540 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825142428] [2025-04-26 16:52:54,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:54,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:54,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:54,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:54,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:52:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:52:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:54,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,547 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 1 times [2025-04-26 16:52:54,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743164520] [2025-04-26 16:52:54,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:54,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,550 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:54,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:54,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:54,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:54,555 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1454406930, now seen corresponding path program 1 times [2025-04-26 16:52:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,555 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384745429] [2025-04-26 16:52:54,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:54,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:54,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:54,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:54,607 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:52:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:52:54,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384745429] [2025-04-26 16:52:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384745429] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:52:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:52:54,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:52:54,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150027385] [2025-04-26 16:52:54,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:52:54,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:52:54,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:52:54,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:52:54,642 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. cyclomatic complexity: 17 Second operand has 5 states, 5 states have (on average 2.2) internal successors, (in total 11), 5 states have internal predecessors, (11), 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:52:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:52:54,688 INFO L93 Difference]: Finished difference Result 40 states and 52 transitions. [2025-04-26 16:52:54,688 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 52 transitions. [2025-04-26 16:52:54,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:52:54,689 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 36 states and 48 transitions. [2025-04-26 16:52:54,690 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2025-04-26 16:52:54,690 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2025-04-26 16:52:54,690 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36 states and 48 transitions. [2025-04-26 16:52:54,690 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:52:54,690 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-04-26 16:52:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 48 transitions. [2025-04-26 16:52:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2025-04-26 16:52:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 1.34375) internal successors, (in total 43), 31 states have internal predecessors, (43), 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:52:54,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2025-04-26 16:52:54,692 INFO L240 hiAutomatonCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 16:52:54,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:52:54,692 INFO L438 stractBuchiCegarLoop]: Abstraction has 32 states and 43 transitions. [2025-04-26 16:52:54,692 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:52:54,692 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 32 states and 43 transitions. [2025-04-26 16:52:54,693 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2025-04-26 16:52:54,693 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:54,693 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:54,693 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:54,693 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:54,694 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L19: Formula: (= v_x_3 0) InVars {} OutVars{x=v_x_3} AuxVars[] AssignedVars[x]" "[45] L19-->L21: Formula: (= v_y_3 0) InVars {} OutVars{y=v_y_3} AuxVars[] AssignedVars[y]" "[64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[52] L35-1-->L36: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_n_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} AuxVars[] AssignedVars[]" "[54] L36-->L37: Formula: (= v_x_1 (+ v_x_2 (select v_A_1 v_thread1Thread1of1ForFork0_i_7))) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[x]" "[67] L21-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" "[55] L37-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L35-1-->thread1FINAL: Formula: (<= v_n_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} AuxVars[] AssignedVars[]" [2025-04-26 16:52:54,694 INFO L754 eck$LassoCheckResult]: Loop: "[58] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_n_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} AuxVars[] AssignedVars[]" "[60] L48-->L49: Formula: (= (+ (select v_A_2 v_thread2Thread1of1ForFork1_j_7) v_y_2) v_y_1) InVars {A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_2} OutVars{A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_1} AuxVars[] AssignedVars[y]" "[61] L49-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:52:54,694 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1645204201, now seen corresponding path program 1 times [2025-04-26 16:52:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,694 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310365160] [2025-04-26 16:52:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:54,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:54,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:54,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:54,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:54,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,704 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 2 times [2025-04-26 16:52:54,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216503523] [2025-04-26 16:52:54,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:52:54,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,706 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:54,709 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:54,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:52:54,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,710 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:54,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:54,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:54,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:54,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1888372302, now seen corresponding path program 1 times [2025-04-26 16:52:54,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:54,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746669630] [2025-04-26 16:52:54,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:54,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:54,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:54,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:54,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,726 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:54,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:52:54,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:52:54,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:54,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:54,736 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:54,824 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:54,824 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:54,824 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:54,824 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:54,825 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:54,825 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,825 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:54,825 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:54,825 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:52:54,825 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:54,825 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:54,827 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,830 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,855 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,857 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:54,932 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:54,932 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:54,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,936 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:52:54,937 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:52:54,938 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:52:54,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:54,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:54,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:54,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:54,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:54,951 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:54,957 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:54,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 16:52:54,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,965 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:52:54,965 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:52:54,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:52:54,980 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:54,981 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:54,981 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:54,981 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:54,982 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:54,982 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:54,985 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:54,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:52:54,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:54,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:54,992 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:52:54,993 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:52:54,994 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:52:55,004 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:55,004 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:55,004 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:55,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:55,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:55,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:55,012 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:55,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:52:55,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:55,020 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:52:55,021 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:52:55,022 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:52:55,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:55,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:55,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:55,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:55,035 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:55,035 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:55,039 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:55,048 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:52:55,049 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:52:55,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:55,051 INFO L229 MonitoredProcess]: Starting monitored process 11 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:52:55,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:52:55,053 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:55,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:55,070 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:52:55,071 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:55,071 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, n) = -1*thread2Thread1of1ForFork1_j + 1*n Supporting invariants [] [2025-04-26 16:52:55,077 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:52:55,078 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:55,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:55,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:52:55,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:52:55,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:55,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:55,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:55,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:55,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:55,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:55,128 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:55,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:55,152 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:52:55,152 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:52:55,152 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 16 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:52:55,187 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 32 states and 43 transitions. cyclomatic complexity: 16. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 65 states and 89 transitions. Complement of second has 7 states. [2025-04-26 16:52:55,188 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:52:55,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:52:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 25 transitions. [2025-04-26 16:52:55,189 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 3 letters. [2025-04-26 16:52:55,189 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,189 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 13 letters. Loop has 3 letters. [2025-04-26 16:52:55,189 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,189 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 25 transitions. Stem has 10 letters. Loop has 6 letters. [2025-04-26 16:52:55,190 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 89 transitions. [2025-04-26 16:52:55,191 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 16:52:55,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 17 states and 19 transitions. [2025-04-26 16:52:55,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2025-04-26 16:52:55,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2025-04-26 16:52:55,191 INFO L74 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2025-04-26 16:52:55,191 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:55,191 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 16:52:55,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2025-04-26 16:52:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-26 16:52:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.1176470588235294) internal successors, (in total 19), 16 states have internal predecessors, (19), 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:52:55,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2025-04-26 16:52:55,194 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 16:52:55,194 INFO L438 stractBuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2025-04-26 16:52:55,194 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:52:55,194 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 19 transitions. [2025-04-26 16:52:55,195 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2025-04-26 16:52:55,195 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:52:55,195 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:52:55,195 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:52:55,195 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-04-26 16:52:55,195 INFO L752 eck$LassoCheckResult]: Stem: "[42] $Ultimate##0-->L19: Formula: (= v_x_3 0) InVars {} OutVars{x=v_x_3} AuxVars[] AssignedVars[x]" "[45] L19-->L21: Formula: (= v_y_3 0) InVars {} OutVars{y=v_y_3} AuxVars[] AssignedVars[y]" "[64] L21-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_14} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_i]" "[50] $Ultimate##0-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_1 0) InVars {} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[52] L35-1-->L36: Formula: (< v_thread1Thread1of1ForFork0_i_5 v_n_1) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_5, n=v_n_1} AuxVars[] AssignedVars[]" "[54] L36-->L37: Formula: (= v_x_1 (+ v_x_2 (select v_A_1 v_thread1Thread1of1ForFork0_i_7))) InVars {A=v_A_1, x=v_x_2, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} OutVars{A=v_A_1, x=v_x_1, thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_7} AuxVars[] AssignedVars[x]" "[55] L37-->L35-1: Formula: (= v_thread1Thread1of1ForFork0_i_10 (+ v_thread1Thread1of1ForFork0_i_9 1)) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_9} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_10} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_i]" "[51] L35-1-->thread1FINAL: Formula: (<= v_n_2 v_thread1Thread1of1ForFork0_i_3) InVars {thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} OutVars{thread1Thread1of1ForFork0_i=v_thread1Thread1of1ForFork0_i_3, n=v_n_2} AuxVars[] AssignedVars[]" "[53] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[67] L21-1-->$Ultimate##0: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_14, thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j, thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[56] $Ultimate##0-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_1 0) InVars {} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:52:55,195 INFO L754 eck$LassoCheckResult]: Loop: "[58] L47-1-->L48: Formula: (< v_thread2Thread1of1ForFork1_j_5 v_n_4) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_5, n=v_n_4} AuxVars[] AssignedVars[]" "[60] L48-->L49: Formula: (= (+ (select v_A_2 v_thread2Thread1of1ForFork1_j_7) v_y_2) v_y_1) InVars {A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_2} OutVars{A=v_A_2, thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_7, y=v_y_1} AuxVars[] AssignedVars[y]" "[61] L49-->L47-1: Formula: (= v_thread2Thread1of1ForFork1_j_10 (+ v_thread2Thread1of1ForFork1_j_9 1)) InVars {thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_9} OutVars{thread2Thread1of1ForFork1_j=v_thread2Thread1of1ForFork1_j_10} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_j]" [2025-04-26 16:52:55,196 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash -549509898, now seen corresponding path program 1 times [2025-04-26 16:52:55,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:55,196 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777477818] [2025-04-26 16:52:55,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:55,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:55,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:55,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:55,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:55,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:55,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:55,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:55,214 INFO L85 PathProgramCache]: Analyzing trace with hash 87450, now seen corresponding path program 3 times [2025-04-26 16:52:55,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:55,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643300661] [2025-04-26 16:52:55,214 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:52:55,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:55,216 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:55,217 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:55,217 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:52:55,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,217 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:55,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:55,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:55,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,219 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:55,219 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:55,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1966018693, now seen corresponding path program 1 times [2025-04-26 16:52:55,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:52:55,219 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407132820] [2025-04-26 16:52:55,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:52:55,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:52:55,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:52:55,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:52:55,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,223 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:52:55,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:52:55,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:52:55,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:52:55,228 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:52:55,291 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:52:55,291 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:52:55,291 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:52:55,291 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:52:55,291 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:52:55,291 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,292 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:52:55,292 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:52:55,292 INFO L132 ssoRankerPreferences]: Filename of dumped script: equal-array-sums.bpl_petrified1_Iteration4_Lasso [2025-04-26 16:52:55,292 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:52:55,292 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:52:55,292 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:55,295 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:55,310 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:55,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:55,315 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:52:55,384 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:52:55,384 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:52:55,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:55,390 INFO L229 MonitoredProcess]: Starting monitored process 12 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:52:55,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:52:55,392 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:52:55,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:55,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:55,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:55,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:55,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:55,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:55,405 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:52:55,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:55,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:55,414 INFO L229 MonitoredProcess]: Starting monitored process 13 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:52:55,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:52:55,416 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:52:55,425 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:52:55,426 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:52:55,426 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:52:55,426 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:52:55,428 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:52:55,428 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:52:55,432 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:52:55,441 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:52:55,441 INFO L437 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 16:52:55,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:52:55,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:52:55,444 INFO L229 MonitoredProcess]: Starting monitored process 14 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:52:55,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:52:55,446 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:52:55,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:55,462 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:52:55,462 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:52:55,462 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread2Thread1of1ForFork1_j, n) = -1*thread2Thread1of1ForFork1_j + 1*n Supporting invariants [] [2025-04-26 16:52:55,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:52:55,468 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:52:55,476 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:52:55,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:52:55,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:52:55,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:55,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:52:55,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:55,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:52:55,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:52:55,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:52:55,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:52:55,505 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:52:55,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:52:55,519 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:52:55,520 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:52:55,520 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:52:55,535 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 19 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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 22 states and 26 transitions. Complement of second has 4 states. [2025-04-26 16:52:55,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 16:52:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (in total 14), 3 states have internal predecessors, (14), 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:52:55,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 15 transitions. [2025-04-26 16:52:55,536 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 3 letters. [2025-04-26 16:52:55,536 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,536 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 14 letters. Loop has 3 letters. [2025-04-26 16:52:55,536 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,536 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 15 transitions. Stem has 11 letters. Loop has 6 letters. [2025-04-26 16:52:55,536 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:52:55,536 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 26 transitions. [2025-04-26 16:52:55,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:55,537 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:52:55,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:52:55,537 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:52:55,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:52:55,537 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:52:55,537 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:52:55,537 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:52:55,547 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-26 16:52:55,548 INFO L201 PluginConnector]: Adding new model equal-array-sums.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:52:55 BoogieIcfgContainer [2025-04-26 16:52:55,548 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:52:55,549 INFO L158 Benchmark]: Toolchain (without parser) took 2220.28ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 86.6MB in the beginning and 42.2MB in the end (delta: 44.4MB). Peak memory consumption was 51.7MB. Max. memory is 8.0GB. [2025-04-26 16:52:55,549 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:55,549 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.13ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:52:55,550 INFO L158 Benchmark]: Boogie Preprocessor took 22.83ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:52:55,550 INFO L158 Benchmark]: RCFGBuilder took 166.94ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:52:55,550 INFO L158 Benchmark]: BuchiAutomizer took 1994.58ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.7MB in the beginning and 42.2MB in the end (delta: 32.5MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. [2025-04-26 16:52:55,551 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 159.4MB. Free memory is still 87.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.13ms. Allocated memory is still 159.4MB. Free memory was 86.4MB in the beginning and 84.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 22.83ms. Allocated memory is still 159.4MB. Free memory was 84.7MB in the beginning and 83.6MB in the end (delta: 1.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 166.94ms. Allocated memory is still 159.4MB. Free memory was 83.6MB in the beginning and 74.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1994.58ms. Allocated memory was 159.4MB in the beginning and 167.8MB in the end (delta: 8.4MB). Free memory was 74.7MB in the beginning and 42.2MB in the end (delta: 32.5MB). Peak memory consumption was 39.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 73 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 70 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 88 IncrementalHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 43 mSDtfsCounter, 88 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital40 mio100 ax100 hnf100 lsp75 ukn95 mio100 lsp57 div100 bol100 ite100 ukn100 eq179 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 24ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 131, Number of transitions in reduction automaton: 61, Number of states in reduction automaton: 45, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + n and consists of 4 locations. One deterministic module has affine ranking function n + -1 * j and consists of 4 locations. One deterministic module has affine ranking function n + -1 * j and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:52:55,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...