/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/POPL2023/sum2_diff_incr_decr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:21:44,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:21:44,466 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:21:44,471 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:21:44,472 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:21:44,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:21:44,493 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:21:44,493 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:21:44,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:21:44,494 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:21:44,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:21:44,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:21:44,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:21:44,495 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:21:44,495 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:21:44,495 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:21:44,496 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:21:44,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:21:44,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:21:44,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:21:44,705 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:21:44,706 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:21:44,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum2_diff_incr_decr.bpl [2025-04-26 16:21:44,707 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/sum2_diff_incr_decr.bpl' [2025-04-26 16:21:44,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:21:44,723 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:21:44,724 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:44,724 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:21:44,724 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:21:44,731 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,756 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,763 INFO L138 Inliner]: procedures = 3, calls = 2, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:21:44,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:21:44,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:21:44,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:21:44,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:21:44,771 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,771 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,773 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,776 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,791 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:21:44,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:21:44,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:21:44,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:21:44,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/1) ... [2025-04-26 16:21:44,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:44,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:44,813 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:21:44,818 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:21:44,840 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:21:44,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:21:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:21:44,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T1 given in one single declaration [2025-04-26 16:21:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure T1 [2025-04-26 16:21:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure T1 [2025-04-26 16:21:44,841 INFO L124 BoogieDeclarations]: Specification and implementation of procedure T2 given in one single declaration [2025-04-26 16:21:44,841 INFO L130 BoogieDeclarations]: Found specification of procedure T2 [2025-04-26 16:21:44,841 INFO L138 BoogieDeclarations]: Found implementation of procedure T2 [2025-04-26 16:21:44,841 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:21:44,878 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:21:44,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:21:44,965 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:21:44,965 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:21:44,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:21:44,984 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:21:44,984 INFO L201 PluginConnector]: Adding new model sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:44 BoogieIcfgContainer [2025-04-26 16:21:44,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:21:44,985 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:21:44,985 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:21:44,991 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:21:44,992 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:44,992 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:21:44" (1/2) ... [2025-04-26 16:21:44,993 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@b4173a4 and model type sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:21:44, skipping insertion in model container [2025-04-26 16:21:44,993 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:21:44,993 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:21:44" (2/2) ... [2025-04-26 16:21:44,994 INFO L376 chiAutomizerObserver]: Analyzing ICFG sum2_diff_incr_decr.bpl [2025-04-26 16:21:45,041 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-26 16:21:45,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:21:45,093 INFO L116 PetriNetUnfolderBase]: 2/23 cut-off events. [2025-04-26 16:21:45,094 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-26 16:21:45,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32 conditions, 23 events. 2/23 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 35 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 19. Up to 2 conditions per place. [2025-04-26 16:21:45,098 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-26 16:21:45,100 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 28 places, 23 transitions, 58 flow [2025-04-26 16:21:45,100 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 28 places, 23 transitions, 58 flow [2025-04-26 16:21:45,112 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:21:45,113 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:21:45,113 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:21:45,113 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:21:45,113 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:21:45,113 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:21:45,113 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:21:45,113 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:21:45,115 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:21:45,156 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 56 [2025-04-26 16:21:45,157 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:45,157 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:45,160 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:45,161 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:45,161 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:21:45,161 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 84 states, but on-demand construction may add more states [2025-04-26 16:21:45,165 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 56 [2025-04-26 16:21:45,167 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:45,167 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:45,168 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:21:45,169 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:45,174 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_16, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_8} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0, T1Thread1of1ForFork0_sum]" "[56] $Ultimate##0-->L16: Formula: (= v_T1Thread1of1ForFork0_i_1 0) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i]" "[57] L16-->L17-1: Formula: (= v_T1Thread1of1ForFork0_sum_1 0) InVars {} OutVars{T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_1} AuxVars[] AssignedVars[T1Thread1of1ForFork0_sum]" [2025-04-26 16:21:45,175 INFO L754 eck$LassoCheckResult]: Loop: "[59] L17-1-->L18: Formula: (< v_T1Thread1of1ForFork0_i_5 v_N_2) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[61] L18-->L18-1: Formula: (and (= v_B_6 (store v_B_7 v_T1Thread1of1ForFork0_i_7 (+ (- 1) (select v_B_7 v_T1Thread1of1ForFork0_i_7)))) (= (store v_A_7 v_T1Thread1of1ForFork0_i_7 (+ (select v_A_7 v_T1Thread1of1ForFork0_i_7) 1)) v_A_6)) InVars {A=v_A_7, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_7} OutVars{A=v_A_6, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_7, B=v_B_6} AuxVars[] AssignedVars[A, B]" "[62] L18-1-->L23: Formula: (= v_T1Thread1of1ForFork0_sum_4 (+ (select v_B_3 v_T1Thread1of1ForFork0_i_9) (select v_A_3 v_T1Thread1of1ForFork0_i_9) v_T1Thread1of1ForFork0_sum_3)) InVars {A=v_A_3, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_9, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_3, B=v_B_3} OutVars{A=v_A_3, T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_9, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_4, B=v_B_3} AuxVars[] AssignedVars[T1Thread1of1ForFork0_sum]" "[63] L23-->L17-1: Formula: (= (+ v_T1Thread1of1ForFork0_i_11 1) v_T1Thread1of1ForFork0_i_12) InVars {T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_11} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_12} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i]" [2025-04-26 16:21:45,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 102698, now seen corresponding path program 1 times [2025-04-26 16:21:45,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:45,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014406739] [2025-04-26 16:21:45,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:45,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:45,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:45,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:45,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:45,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:45,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,266 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:45,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:45,270 INFO L85 PathProgramCache]: Analyzing trace with hash 2741796, now seen corresponding path program 1 times [2025-04-26 16:21:45,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:45,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959198992] [2025-04-26 16:21:45,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:45,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:45,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:45,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:45,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,291 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:45,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:45,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:45,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:45,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 356297421, now seen corresponding path program 1 times [2025-04-26 16:21:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:45,309 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912996662] [2025-04-26 16:21:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:45,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:45,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:45,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,321 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:45,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:21:45,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:21:45,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:45,329 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:45,460 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:45,461 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:45,461 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:45,461 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:45,461 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:45,461 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:45,461 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:45,461 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:45,461 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum2_diff_incr_decr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:21:45,461 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:45,462 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:45,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:45,481 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:45,580 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:45,583 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:45,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:45,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:45,587 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:21:45,589 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:21:45,591 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:21:45,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:45,602 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:45,602 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:45,602 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:45,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:45,610 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:45,618 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:45,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:45,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:45,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:45,627 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:21:45,630 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:21:45,631 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:21:45,642 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:45,642 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:45,642 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:45,642 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:45,645 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:45,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:45,652 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:45,658 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:21:45,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:45,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:45,660 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:21:45,662 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:21:45,663 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:21:45,674 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:45,674 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:45,674 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:45,674 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:45,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:45,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:45,689 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:45,701 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:21:45,701 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:45,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:45,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:45,705 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:21:45,707 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:21:45,708 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:45,741 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:21:45,741 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:45,741 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:45,742 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(T1Thread1of1ForFork0_i, N) = -1*T1Thread1of1ForFork0_i + 1*N Supporting invariants [] [2025-04-26 16:21:45,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:21:45,750 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:45,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:45,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:21:45,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:21:45,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:45,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:45,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:45,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:45,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:45,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:45,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:45,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:45,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:45,844 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:21:45,894 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:21:45,912 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 84 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:21:46,008 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 84 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 190 states and 439 transitions. Complement of second has 6 states. [2025-04-26 16:21:46,010 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:21:46,015 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:21:46,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2025-04-26 16:21:46,024 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:21:46,025 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,025 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:21:46,025 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,025 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 52 transitions. Stem has 3 letters. Loop has 8 letters. [2025-04-26 16:21:46,025 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 190 states and 439 transitions. [2025-04-26 16:21:46,037 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:21:46,042 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 190 states to 120 states and 278 transitions. [2025-04-26 16:21:46,043 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 66 [2025-04-26 16:21:46,043 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 86 [2025-04-26 16:21:46,044 INFO L74 IsDeterministic]: Start isDeterministic. Operand 120 states and 278 transitions. [2025-04-26 16:21:46,044 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:21:46,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 120 states and 278 transitions. [2025-04-26 16:21:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states and 278 transitions. [2025-04-26 16:21:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2025-04-26 16:21:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 103 states have (on average 2.320388349514563) internal successors, (in total 239), 102 states have internal predecessors, (239), 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:21:46,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 239 transitions. [2025-04-26 16:21:46,075 INFO L240 hiAutomatonCegarLoop]: Abstraction has 103 states and 239 transitions. [2025-04-26 16:21:46,075 INFO L438 stractBuchiCegarLoop]: Abstraction has 103 states and 239 transitions. [2025-04-26 16:21:46,075 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:21:46,075 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 103 states and 239 transitions. [2025-04-26 16:21:46,078 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 36 [2025-04-26 16:21:46,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:21:46,078 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:21:46,079 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:21:46,079 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2025-04-26 16:21:46,079 INFO L752 eck$LassoCheckResult]: Stem: "[74] $Ultimate##0-->$Ultimate##0: Formula: (= v_T1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{T1Thread1of1ForFork0_i=v_T1Thread1of1ForFork0_i_16, T1Thread1of1ForFork0_thidvar0=v_T1Thread1of1ForFork0_thidvar0_2, T1Thread1of1ForFork0_sum=v_T1Thread1of1ForFork0_sum_8} AuxVars[] AssignedVars[T1Thread1of1ForFork0_i, T1Thread1of1ForFork0_thidvar0, T1Thread1of1ForFork0_sum]" "[77] L46-->$Ultimate##0: Formula: (and (= v_T2Thread1of1ForFork1_thidvar1_2 2) (= v_T2Thread1of1ForFork1_thidvar0_2 2)) InVars {} OutVars{T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_8, T2Thread1of1ForFork1_thidvar0=v_T2Thread1of1ForFork1_thidvar0_2, T2Thread1of1ForFork1_thidvar1=v_T2Thread1of1ForFork1_thidvar1_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_16} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum, T2Thread1of1ForFork1_thidvar0, T2Thread1of1ForFork1_thidvar1, T2Thread1of1ForFork1_j]" "[64] $Ultimate##0-->L33: Formula: (= v_T2Thread1of1ForFork1_j_1 0) InVars {} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_1} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j]" "[65] L33-->L34-1: Formula: (= v_T2Thread1of1ForFork1_sum_1 0) InVars {} OutVars{T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_1} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum]" [2025-04-26 16:21:46,079 INFO L754 eck$LassoCheckResult]: Loop: "[67] L34-1-->L35: Formula: (< v_T2Thread1of1ForFork1_j_5 v_N_3) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_3} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_5, N=v_N_3} AuxVars[] AssignedVars[]" "[69] L35-->L36: Formula: (= (+ (select v_A_4 v_T2Thread1of1ForFork1_j_7) v_T2Thread1of1ForFork1_sum_3 (select v_B_4 v_T2Thread1of1ForFork1_j_7)) v_T2Thread1of1ForFork1_sum_4) InVars {A=v_A_4, T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_3, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, B=v_B_4} OutVars{A=v_A_4, T2Thread1of1ForFork1_sum=v_T2Thread1of1ForFork1_sum_4, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_7, B=v_B_4} AuxVars[] AssignedVars[T2Thread1of1ForFork1_sum]" "[70] L36-->L37: Formula: (= (store v_D_2 v_T2Thread1of1ForFork1_j_9 (+ (select v_A_5 v_T2Thread1of1ForFork1_j_9) (* (- 1) (select v_B_5 v_T2Thread1of1ForFork1_j_9)))) v_D_1) InVars {A=v_A_5, D=v_D_2, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_5} OutVars{A=v_A_5, D=v_D_1, T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_9, B=v_B_5} AuxVars[] AssignedVars[D]" "[71] L37-->L34-1: Formula: (= v_T2Thread1of1ForFork1_j_12 (+ v_T2Thread1of1ForFork1_j_11 1)) InVars {T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_11} OutVars{T2Thread1of1ForFork1_j=v_T2Thread1of1ForFork1_j_12} AuxVars[] AssignedVars[T2Thread1of1ForFork1_j]" [2025-04-26 16:21:46,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash 3204101, now seen corresponding path program 1 times [2025-04-26 16:21:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:46,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39682907] [2025-04-26 16:21:46,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:46,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:46,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,087 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:46,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:46,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:46,092 INFO L85 PathProgramCache]: Analyzing trace with hash 2988068, now seen corresponding path program 1 times [2025-04-26 16:21:46,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:46,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077094310] [2025-04-26 16:21:46,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:46,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:46,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,102 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:46,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,107 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:46,107 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -175842776, now seen corresponding path program 1 times [2025-04-26 16:21:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:21:46,107 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801564598] [2025-04-26 16:21:46,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:21:46,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:21:46,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:46,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:46,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,112 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:21:46,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:21:46,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:21:46,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:21:46,120 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:21:46,189 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:21:46,189 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:21:46,189 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:21:46,189 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:21:46,189 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:21:46,189 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:46,189 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:21:46,189 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:21:46,190 INFO L132 ssoRankerPreferences]: Filename of dumped script: sum2_diff_incr_decr.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:21:46,190 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:21:46,190 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:21:46,191 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,194 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:21:46,283 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:21:46,284 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:21:46,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:46,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:46,286 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:21:46,287 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:21:46,289 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:21:46,300 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:46,300 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:46,300 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:46,300 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:46,301 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:46,301 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:46,305 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:46,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 16:21:46,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:46,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:46,313 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:21:46,315 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:21:46,316 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:21:46,326 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:46,326 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:21:46,326 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:46,326 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:46,326 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:46,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:21:46,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:21:46,329 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:21:46,334 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:21:46,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:46,372 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:21:46,372 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:21:46,373 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:21:46,383 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:21:46,383 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:21:46,383 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:21:46,383 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:21:46,386 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:21:46,386 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:21:46,390 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:21:46,396 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:21:46,396 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:21:46,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:21:46,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:21:46,398 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:21:46,400 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:21:46,401 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:21:46,417 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:21:46,418 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:21:46,418 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:21:46,418 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(T2Thread1of1ForFork1_j, N) = -1*T2Thread1of1ForFork1_j + 1*N Supporting invariants [] [2025-04-26 16:21:46,423 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:21:46,424 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:21:46,437 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:21:46,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:46,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:21:46,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:46,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:21:46,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:21:46,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:21:46,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:21:46,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:21:46,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:21:46,473 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:21:46,474 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:21:46,474 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 103 states and 239 transitions. cyclomatic complexity: 149 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:21:46,531 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 103 states and 239 transitions. cyclomatic complexity: 149. 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 236 states and 572 transitions. Complement of second has 6 states. [2025-04-26 16:21:46,534 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:21:46,534 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:21:46,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2025-04-26 16:21:46,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 4 letters. [2025-04-26 16:21:46,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 8 letters. Loop has 4 letters. [2025-04-26 16:21:46,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,535 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 44 transitions. Stem has 4 letters. Loop has 8 letters. [2025-04-26 16:21:46,535 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:21:46,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 236 states and 572 transitions. [2025-04-26 16:21:46,540 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:46,540 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 236 states to 0 states and 0 transitions. [2025-04-26 16:21:46,540 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:21:46,540 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:21:46,541 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:21:46,541 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:21:46,541 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:46,541 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:46,541 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:21:46,541 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:21:46,541 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:21:46,541 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:21:46,541 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:21:46,550 INFO L201 PluginConnector]: Adding new model sum2_diff_incr_decr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:21:46 BoogieIcfgContainer [2025-04-26 16:21:46,550 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:21:46,551 INFO L158 Benchmark]: Toolchain (without parser) took 1827.84ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 83.8MB in the beginning and 63.3MB in the end (delta: 20.5MB). Peak memory consumption was 5.7MB. Max. memory is 8.0GB. [2025-04-26 16:21:46,551 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.16ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:46,551 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.22ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:46,551 INFO L158 Benchmark]: Boogie Preprocessor took 25.47ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 997.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:46,552 INFO L158 Benchmark]: RCFGBuilder took 192.11ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:21:46,552 INFO L158 Benchmark]: BuchiAutomizer took 1565.58ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.3MB in the beginning and 63.3MB in the end (delta: 8.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:21:46,553 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.16ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.22ms. Allocated memory is still 155.2MB. Free memory was 83.8MB in the beginning and 81.9MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.47ms. Allocated memory is still 155.2MB. Free memory was 81.9MB in the beginning and 80.9MB in the end (delta: 997.0kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 192.11ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 71.5MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 1565.58ms. Allocated memory was 155.2MB in the beginning and 142.6MB in the end (delta: -12.6MB). Free memory was 71.3MB in the beginning and 63.3MB in the end (delta: 8.0MB). 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 1.4s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 78 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 76 mSDsluCounter, 86 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 64 IncrementalHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 45 mSDtfsCounter, 64 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp88 ukn47 mio100 lsp68 div100 bol100 ite100 ukn100 eq171 hnf95 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s InitialAbstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 4 locations. One deterministic module has affine ranking function N + -1 * j 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:21:46,563 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...