/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:23:29,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:23:29,604 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:23:29,607 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:23:29,608 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:23:29,624 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:23:29,625 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:23:29,625 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:23:29,625 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:23:29,625 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:23:29,625 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:23:29,625 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:23:29,625 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:23:29,625 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:23:29,626 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:23:29,626 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:23:29,626 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:23:29,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:23:29,627 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:23:29,628 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:23:29,628 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:23:29,628 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:23:29,628 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:23:29,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:23:29,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:23:29,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:23:29,872 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:23:29,873 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:23:29,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl [2025-04-26 16:23:29,876 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/sum-fun.wvr.bpl' [2025-04-26 16:23:29,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:23:29,895 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:23:29,896 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:29,896 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:23:29,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:23:29,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,925 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,934 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:23:29,935 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:23:29,936 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:23:29,936 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:23:29,936 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:23:29,943 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,946 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,946 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,953 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:23:29,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:23:29,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:23:29,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:23:29,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/1) ... [2025-04-26 16:23:29,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:29,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:29,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:29,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:23:30,024 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:23:30,024 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:23:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:23:30,025 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:23:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:23:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:23:30,025 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:23:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:23:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:23:30,025 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:23:30,025 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:23:30,025 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:23:30,026 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:23:30,065 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:23:30,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:23:30,158 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:23:30,158 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:23:30,181 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:23:30,181 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:23:30,182 INFO L201 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:30 BoogieIcfgContainer [2025-04-26 16:23:30,182 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:23:30,184 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:23:30,184 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:23:30,188 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:23:30,188 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:30,188 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:23:29" (1/2) ... [2025-04-26 16:23:30,189 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@254259a8 and model type sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:23:30, skipping insertion in model container [2025-04-26 16:23:30,189 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:23:30,189 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:23:30" (2/2) ... [2025-04-26 16:23:30,190 INFO L376 chiAutomizerObserver]: Analyzing ICFG sum-fun.wvr.bpl [2025-04-26 16:23:30,240 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:23:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:23:30,301 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 16:23:30,303 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:23:30,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 16:23:30,308 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 16:23:30,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 16:23:30,314 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 16:23:30,323 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:23:30,323 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:23:30,323 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:23:30,323 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:23:30,323 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:23:30,323 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:23:30,323 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:23:30,323 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:23:30,325 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:23:30,370 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:23:30,371 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:30,371 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:30,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:30,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:30,375 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:23:30,376 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 113 states, but on-demand construction may add more states [2025-04-26 16:23:30,384 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 16:23:30,385 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:30,385 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:30,385 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:23:30,385 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:30,393 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_i_6 v_sum2_3) (= v_j_6 v_i_6) (= v_i_6 v_sum3_1) (= v_i_6 v_sum1_3)) InVars {sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} OutVars{sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:23:30,393 INFO L754 eck$LassoCheckResult]: Loop: "[68] L23-1-->L23: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[70] L23-->L23-1: Formula: (and (= (+ v_sum1_6 (select v_A_4 v_i_8)) v_sum1_5) (= (+ v_i_8 1) v_i_7)) InVars {sum1=v_sum1_6, A=v_A_4, i=v_i_8} OutVars{sum1=v_sum1_5, A=v_A_4, i=v_i_7} AuxVars[] AssignedVars[sum1, i]" [2025-04-26 16:23:30,397 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,398 INFO L85 PathProgramCache]: Analyzing trace with hash 86396430, now seen corresponding path program 1 times [2025-04-26 16:23:30,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,405 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619600962] [2025-04-26 16:23:30,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,465 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:30,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:30,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,494 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 16:23:30,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168155429] [2025-04-26 16:23:30,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:30,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:30,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,506 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:30,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:30,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,513 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:30,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1422592784, now seen corresponding path program 1 times [2025-04-26 16:23:30,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:30,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007710697] [2025-04-26 16:23:30,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:30,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:30,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:30,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:30,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,528 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:30,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:30,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:30,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:30,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:30,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:30,684 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:30,684 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:30,684 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:30,685 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:30,685 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:30,685 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,685 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:30,685 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:30,685 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:23:30,685 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:30,685 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:30,696 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,720 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,723 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,750 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:30,839 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:30,842 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:30,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,845 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:23:30,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:23:30,848 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:23:30,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,871 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:30,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:23:30,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,879 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:23:30,881 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:23:30,882 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:23:30,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:30,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:30,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:30,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:30,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:30,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:30,909 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:30,928 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:23:30,928 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:30,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:30,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:30,961 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:23:30,964 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:23:30,964 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:30,982 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:23:30,982 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:30,982 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:30,983 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 16:23:30,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:23:30,994 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:31,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:23:31,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:23:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,085 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:23:31,133 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:23:31,140 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 113 states, but on-demand construction may add more states 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:23:31,227 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 113 states, but on-demand construction may add more states. 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 301 states and 946 transitions. Complement of second has 7 states. [2025-04-26 16:23:31,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:23:31,234 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:23:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2025-04-26 16:23:31,238 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:23:31,239 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,239 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:31,239 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,239 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 48 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 16:23:31,239 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,240 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 946 transitions. [2025-04-26 16:23:31,247 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:23:31,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 185 states and 589 transitions. [2025-04-26 16:23:31,253 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2025-04-26 16:23:31,254 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 135 [2025-04-26 16:23:31,254 INFO L74 IsDeterministic]: Start isDeterministic. Operand 185 states and 589 transitions. [2025-04-26 16:23:31,254 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:31,254 INFO L218 hiAutomatonCegarLoop]: Abstraction has 185 states and 589 transitions. [2025-04-26 16:23:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states and 589 transitions. [2025-04-26 16:23:31,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2025-04-26 16:23:31,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 3.2481751824817517) internal successors, (in total 445), 136 states have internal predecessors, (445), 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:23:31,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 445 transitions. [2025-04-26 16:23:31,286 INFO L240 hiAutomatonCegarLoop]: Abstraction has 137 states and 445 transitions. [2025-04-26 16:23:31,286 INFO L438 stractBuchiCegarLoop]: Abstraction has 137 states and 445 transitions. [2025-04-26 16:23:31,286 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:23:31,286 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 445 transitions. [2025-04-26 16:23:31,287 INFO L131 ngComponentsAnalysis]: Automaton has 30 accepting balls. 70 [2025-04-26 16:23:31,288 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:31,288 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:31,288 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:23:31,288 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:31,288 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_i_6 v_sum2_3) (= v_j_6 v_i_6) (= v_i_6 v_sum3_1) (= v_i_6 v_sum1_3)) InVars {sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} OutVars{sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:23:31,288 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (+ v_sum2_6 (select v_A_6 v_j_8)) v_sum2_5)) InVars {A=v_A_6, sum2=v_sum2_6, j=v_j_8} OutVars{A=v_A_6, sum2=v_sum2_5, j=v_j_7} AuxVars[] AssignedVars[sum2, j]" [2025-04-26 16:23:31,289 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1616677882, now seen corresponding path program 1 times [2025-04-26 16:23:31,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,289 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610565181] [2025-04-26 16:23:31,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,291 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:31,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:31,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:31,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:31,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,296 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,297 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,297 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 16:23:31,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,297 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719549078] [2025-04-26 16:23:31,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,299 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,299 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1150718856, now seen corresponding path program 1 times [2025-04-26 16:23:31,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454080917] [2025-04-26 16:23:31,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:31,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:31,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:23:31,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:23:31,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,313 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,399 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:31,399 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:31,399 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:31,399 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:31,399 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:31,399 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,399 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:31,399 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:31,399 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:23:31,399 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:31,399 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:31,400 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,403 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,421 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:31,519 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:31,519 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,525 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:23:31,539 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:23:31,539 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:23:31,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,557 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,564 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:23:31,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,575 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:23:31,615 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:23:31,616 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:23:31,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,638 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:31,644 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:23:31,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,646 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:23:31,648 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:23:31,649 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:23:31,659 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:31,660 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:31,660 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:31,660 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:31,665 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:31,665 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:31,673 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:31,709 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:23:31,709 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 16:23:31,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:31,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:31,711 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:23:31,712 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:23:31,713 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:31,728 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:23:31,729 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:31,729 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:31,729 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 16:23:31,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:23:31,736 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:31,765 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:23:31,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:23:31,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:31,790 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:31,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:31,803 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:23:31,804 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:23:31,804 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 137 states and 445 transitions. cyclomatic complexity: 347 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:23:31,864 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 137 states and 445 transitions. cyclomatic complexity: 347. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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 409 states and 1404 transitions. Complement of second has 6 states. [2025-04-26 16:23:31,864 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:23:31,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:23:31,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2025-04-26 16:23:31,865 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 16:23:31,865 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,865 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 8 letters. Loop has 2 letters. [2025-04-26 16:23:31,865 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,865 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 47 transitions. Stem has 6 letters. Loop has 4 letters. [2025-04-26 16:23:31,865 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:31,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 409 states and 1404 transitions. [2025-04-26 16:23:31,872 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:23:31,877 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 409 states to 231 states and 791 transitions. [2025-04-26 16:23:31,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 89 [2025-04-26 16:23:31,878 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 130 [2025-04-26 16:23:31,878 INFO L74 IsDeterministic]: Start isDeterministic. Operand 231 states and 791 transitions. [2025-04-26 16:23:31,878 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:23:31,878 INFO L218 hiAutomatonCegarLoop]: Abstraction has 231 states and 791 transitions. [2025-04-26 16:23:31,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states and 791 transitions. [2025-04-26 16:23:31,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 190. [2025-04-26 16:23:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 190 states have (on average 3.5736842105263156) internal successors, (in total 679), 189 states have internal predecessors, (679), 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:23:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 679 transitions. [2025-04-26 16:23:31,895 INFO L240 hiAutomatonCegarLoop]: Abstraction has 190 states and 679 transitions. [2025-04-26 16:23:31,895 INFO L438 stractBuchiCegarLoop]: Abstraction has 190 states and 679 transitions. [2025-04-26 16:23:31,895 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:23:31,895 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 190 states and 679 transitions. [2025-04-26 16:23:31,900 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 42 [2025-04-26 16:23:31,901 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:23:31,901 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:23:31,901 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:23:31,901 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:23:31,901 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_i_6 v_sum2_3) (= v_j_6 v_i_6) (= v_i_6 v_sum3_1) (= v_i_6 v_sum1_3)) InVars {sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} OutVars{sum1=v_sum1_3, i=v_i_6, sum2=v_sum2_3, sum3=v_sum3_1, j=v_j_6} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[84] L59-1-->L34-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[87] L60-->L45-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:23:31,901 INFO L754 eck$LassoCheckResult]: Loop: "[76] L45-1-->L45: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[78] L45-->L45-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (+ v_sum3_6 (select v_A_8 v_k_8)) v_sum3_5)) InVars {A=v_A_8, sum3=v_sum3_6, k=v_k_8} OutVars{A=v_A_8, sum3=v_sum3_5, k=v_k_7} AuxVars[] AssignedVars[sum3, k]" [2025-04-26 16:23:31,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1422593297, now seen corresponding path program 1 times [2025-04-26 16:23:31,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824535301] [2025-04-26 16:23:31,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:31,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:31,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,910 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:31,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:31,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,920 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:23:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348341439] [2025-04-26 16:23:31,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:31,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:31,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:31,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:31,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1312560723, now seen corresponding path program 1 times [2025-04-26 16:23:31,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:23:31,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953589287] [2025-04-26 16:23:31,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:23:31,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:23:31,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:31,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:31,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:23:31,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:23:31,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:23:31,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:31,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:23:31,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:23:32,032 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:23:32,032 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:23:32,032 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:23:32,033 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:23:32,033 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:23:32,033 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,033 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:23:32,033 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:23:32,035 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum-fun.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:23:32,035 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:23:32,035 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:23:32,036 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,039 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,041 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,052 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,055 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,057 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,061 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,062 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,064 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,066 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,068 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:23:32,194 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:23:32,195 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:23:32,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,197 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:23:32,198 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:23:32,199 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:23:32,209 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,213 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,213 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,216 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,222 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:23:32,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,224 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:23:32,225 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:23:32,226 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:23:32,237 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,237 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,237 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,237 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,239 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,239 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,243 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:23:32,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:23:32,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,251 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:23:32,252 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:23:32,254 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:23:32,264 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:23:32,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:23:32,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:23:32,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:23:32,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:23:32,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:23:32,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:23:32,282 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:23:32,282 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:23:32,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:23:32,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:23:32,284 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:23:32,285 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:23:32,286 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:23:32,302 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 16:23:32,302 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:23:32,302 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:23:32,302 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:23:32,308 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:23:32,308 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:23:32,324 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:23:32,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:23:32,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:23:32,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:32,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:32,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:23:32,331 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:32,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:23:32,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:23:32,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:23:32,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:23:32,346 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:23:32,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:23:32,355 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:23:32,356 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:23:32,356 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 190 states and 679 transitions. cyclomatic complexity: 530 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:32,404 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 190 states and 679 transitions. cyclomatic complexity: 530. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 507 states and 1780 transitions. Complement of second has 6 states. [2025-04-26 16:23:32,405 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:23:32,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:23:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2025-04-26 16:23:32,405 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:23:32,405 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,405 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:23:32,406 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,406 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 48 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:23:32,406 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:23:32,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 507 states and 1780 transitions. [2025-04-26 16:23:32,412 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:32,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 507 states to 0 states and 0 transitions. [2025-04-26 16:23:32,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:23:32,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:23:32,412 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:23:32,412 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:23:32,412 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:32,412 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:32,412 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:23:32,413 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:23:32,413 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:23:32,413 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:23:32,413 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:23:32,417 INFO L201 PluginConnector]: Adding new model sum-fun.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:23:32 BoogieIcfgContainer [2025-04-26 16:23:32,417 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:23:32,418 INFO L158 Benchmark]: Toolchain (without parser) took 2522.61ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 86.0MB in the beginning and 84.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:32,418 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.72ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:32,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.42ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:32,419 INFO L158 Benchmark]: Boogie Preprocessor took 29.27ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 972.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:32,419 INFO L158 Benchmark]: RCFGBuilder took 216.41ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:23:32,419 INFO L158 Benchmark]: BuchiAutomizer took 2233.83ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.3MB in the beginning and 84.8MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:23:32,420 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.72ms. Allocated memory is still 159.4MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.42ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.1MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.27ms. Allocated memory is still 159.4MB. Free memory was 84.1MB in the beginning and 83.1MB in the end (delta: 972.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 216.41ms. Allocated memory is still 159.4MB. Free memory was 83.1MB in the beginning and 73.4MB in the end (delta: 9.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2233.83ms. Allocated memory was 159.4MB in the beginning and 142.6MB in the end (delta: -16.8MB). Free memory was 73.3MB in the beginning and 84.8MB in the end (delta: -11.6MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 89 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, 101 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 103 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 116 IncrementalHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 53 mSDtfsCounter, 116 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital55 mio100 ax100 hnf100 lsp64 ukn94 mio100 lsp75 div100 bol100 ite100 ukn100 eq150 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 28ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:23:32,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...