/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/array-sum-with-log-3threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:20:51,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:20:51,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-noLbe.epf [2025-04-26 16:20:51,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:20:51,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:20:51,930 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:20:51,931 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:20:51,931 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:20:51,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:20:51,932 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:20:51,932 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:20:51,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:20:51,933 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:20:51,933 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:20:51,934 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:20:51,934 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:20:51,934 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:20:51,934 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:20:52,175 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:20:52,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:20:52,183 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:20:52,184 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:20:52,184 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:20:52,186 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl [2025-04-26 16:20:52,187 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl' [2025-04-26 16:20:52,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:20:52,212 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:20:52,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:52,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:20:52,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:20:52,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,270 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 16:20:52,272 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:20:52,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:20:52,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:20:52,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:20:52,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,282 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,283 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,285 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,285 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,286 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,296 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:20:52,297 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:20:52,297 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:20:52,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:20:52,301 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/1) ... [2025-04-26 16:20:52,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:52,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:52,328 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:52,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-04-26 16:20:52,352 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:20:52,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:20:52,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:20:52,353 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:20:52,353 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:20:52,353 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:20:52,354 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:20:52,393 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:20:52,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:20:52,482 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:20:52,482 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:20:52,500 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:20:52,501 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:20:52,501 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:52 BoogieIcfgContainer [2025-04-26 16:20:52,501 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:20:52,504 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:20:52,504 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:20:52,509 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:20:52,510 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:52,510 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:20:52" (1/2) ... [2025-04-26 16:20:52,511 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@38cd6592 and model type array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:20:52, skipping insertion in model container [2025-04-26 16:20:52,511 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:20:52,511 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:20:52" (2/2) ... [2025-04-26 16:20:52,513 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-3threads.bpl [2025-04-26 16:20:52,585 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:20:52,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 129 flow [2025-04-26 16:20:52,661 INFO L116 PetriNetUnfolderBase]: 3/48 cut-off events. [2025-04-26 16:20:52,665 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:20:52,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2025-04-26 16:20:52,671 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 129 flow [2025-04-26 16:20:52,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 48 transitions, 114 flow [2025-04-26 16:20:52,677 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 55 places, 48 transitions, 114 flow [2025-04-26 16:20:52,686 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:20:52,686 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:20:52,686 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:20:52,686 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:20:52,687 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:20:52,687 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:20:52,687 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:20:52,688 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:20:52,689 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2025-04-26 16:20:52,957 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2025-04-26 16:20:52,958 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:52,958 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:52,961 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:20:52,961 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:52,961 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:20:52,961 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 2565 states, but on-demand construction may add more states [2025-04-26 16:20:52,996 INFO L131 ngComponentsAnalysis]: Automaton has 81 accepting balls. 2457 [2025-04-26 16:20:52,996 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:52,996 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:52,996 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:20:52,997 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:53,001 INFO L752 eck$LassoCheckResult]: Stem: "[95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[54] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[55] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" [2025-04-26 16:20:53,003 INFO L754 eck$LassoCheckResult]: Loop: "[57] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[59] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[60] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[61] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[62] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[64] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[65] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[66] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" [2025-04-26 16:20:53,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:53,008 INFO L85 PathProgramCache]: Analyzing trace with hash 122815, now seen corresponding path program 1 times [2025-04-26 16:20:53,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:53,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712726256] [2025-04-26 16:20:53,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:53,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:53,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:53,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:53,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,064 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:53,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:53,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:53,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,081 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:53,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1174385188, now seen corresponding path program 1 times [2025-04-26 16:20:53,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:53,085 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944494850] [2025-04-26 16:20:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:53,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:53,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:53,107 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,107 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:53,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:53,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:53,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:53,124 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:53,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1932215262, now seen corresponding path program 1 times [2025-04-26 16:20:53,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:53,124 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262500791] [2025-04-26 16:20:53,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:53,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:53,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:20:53,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:20:53,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,143 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:53,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:20:53,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:20:53,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:53,150 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:53,273 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:53,274 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:53,274 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:53,274 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:53,274 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:53,274 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,274 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:53,274 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:53,274 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:20:53,274 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:53,274 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:53,301 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:53,353 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:53,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:53,456 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:53,459 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:53,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:53,463 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:53,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-04-26 16:20:53,466 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:53,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:53,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:53,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:53,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:53,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:53,491 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:53,499 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:53,505 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-04-26 16:20:53,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:53,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:53,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:20:53,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:53,524 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:53,524 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:53,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:53,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:53,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:53,526 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:53,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:53,530 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:53,536 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:20:53,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:53,538 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:53,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:20:53,543 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:53,553 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:53,553 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:53,553 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:53,553 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:53,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:53,554 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:53,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:53,558 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:53,564 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:20:53,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:53,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:53,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:20:53,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:53,578 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:53,579 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:53,579 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:53,579 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:53,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:53,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:53,589 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:53,598 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:20:53,598 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:20:53,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:53,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:53,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:53,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:20:53,605 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:53,627 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:20:53,627 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:20:53,627 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:53,628 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2025-04-26 16:20:53,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 16:20:53,640 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:20:53,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:53,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:20:53,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:20:53,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:53,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:53,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:53,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:53,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:53,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:53,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:53,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:53,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:53,782 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:20:53,784 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand currently 2565 states, but on-demand construction may add more states Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:53,982 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand currently 2565 states, but on-demand construction may add more states. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 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 6040 states and 19511 transitions. Complement of second has 6 states. [2025-04-26 16:20:53,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:53,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2025-04-26 16:20:53,994 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 3 letters. Loop has 9 letters. [2025-04-26 16:20:53,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:53,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 12 letters. Loop has 9 letters. [2025-04-26 16:20:53,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:53,997 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 135 transitions. Stem has 3 letters. Loop has 18 letters. [2025-04-26 16:20:53,997 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:53,998 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 6040 states and 19511 transitions. [2025-04-26 16:20:54,116 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 2268 [2025-04-26 16:20:54,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 6040 states to 5362 states and 17299 transitions. [2025-04-26 16:20:54,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2680 [2025-04-26 16:20:54,196 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3573 [2025-04-26 16:20:54,197 INFO L74 IsDeterministic]: Start isDeterministic. Operand 5362 states and 17299 transitions. [2025-04-26 16:20:54,197 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:54,197 INFO L218 hiAutomatonCegarLoop]: Abstraction has 5362 states and 17299 transitions. [2025-04-26 16:20:54,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5362 states and 17299 transitions. [2025-04-26 16:20:54,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5362 to 4471. [2025-04-26 16:20:54,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4471 states, 4471 states have (on average 3.2319391634980987) internal successors, (in total 14450), 4470 states have internal predecessors, (14450), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:54,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4471 states to 4471 states and 14450 transitions. [2025-04-26 16:20:54,364 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4471 states and 14450 transitions. [2025-04-26 16:20:54,364 INFO L438 stractBuchiCegarLoop]: Abstraction has 4471 states and 14450 transitions. [2025-04-26 16:20:54,364 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:20:54,364 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4471 states and 14450 transitions. [2025-04-26 16:20:54,430 INFO L131 ngComponentsAnalysis]: Automaton has 140 accepting balls. 2268 [2025-04-26 16:20:54,430 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:54,430 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:54,431 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 16:20:54,431 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:54,431 INFO L752 eck$LassoCheckResult]: Stem: "[95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[67] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[68] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" [2025-04-26 16:20:54,431 INFO L754 eck$LassoCheckResult]: Loop: "[70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[]" "[72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" [2025-04-26 16:20:54,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash 3849989, now seen corresponding path program 1 times [2025-04-26 16:20:54,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:54,432 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401550336] [2025-04-26 16:20:54,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:54,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:54,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:54,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:54,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,439 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:54,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:54,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:54,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:54,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1317439337, now seen corresponding path program 1 times [2025-04-26 16:20:54,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:54,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888904712] [2025-04-26 16:20:54,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:54,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:54,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:54,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:54,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,447 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:54,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:54,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:54,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,453 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:54,453 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:54,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1944556315, now seen corresponding path program 1 times [2025-04-26 16:20:54,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:54,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094633544] [2025-04-26 16:20:54,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:54,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:54,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:54,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:54,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,461 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:54,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:20:54,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:20:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:54,474 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:54,549 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:54,549 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:54,549 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:54,549 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:54,549 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:54,549 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,549 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:54,549 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:54,549 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration2_Lasso [2025-04-26 16:20:54,549 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:54,549 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:54,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,557 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,589 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:54,671 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:54,671 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:54,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,674 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:20:54,677 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,687 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,687 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:54,690 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:54,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:54,695 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,702 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:20:54,705 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,715 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,715 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,715 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,715 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:54,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:54,722 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,730 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:20:54,733 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:54,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:54,748 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,757 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:20:54,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:54,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:54,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:54,772 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,783 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:20:54,785 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:20:54,785 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,796 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,796 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:54,796 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,796 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,796 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:54,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:54,798 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,805 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:20:54,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,808 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:20:54,810 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:20:54,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:54,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:54,831 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:54,837 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:20:54,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:20:54,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:54,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:54,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:54,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:54,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:54,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:54,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:54,863 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:54,871 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:20:54,871 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:20:54,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:54,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:54,874 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:54,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:20:54,877 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:54,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,894 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:20:54,894 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:54,895 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2025-04-26 16:20:54,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:54,904 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:20:54,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:54,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 16:20:54,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 16:20:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:54,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:54,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:54,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:54,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:54,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:54,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:54,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:54,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:55,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:55,004 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:20:55,004 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 4471 states and 14450 transitions. cyclomatic complexity: 10146 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:55,207 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 4471 states and 14450 transitions. cyclomatic complexity: 10146. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 12028 states and 41198 transitions. Complement of second has 6 states. [2025-04-26 16:20:55,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:55,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (in total 13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:55,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2025-04-26 16:20:55,208 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 4 letters. Loop has 9 letters. [2025-04-26 16:20:55,208 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:55,208 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 13 letters. Loop has 9 letters. [2025-04-26 16:20:55,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:55,209 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 131 transitions. Stem has 4 letters. Loop has 18 letters. [2025-04-26 16:20:55,209 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:55,209 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12028 states and 41198 transitions. [2025-04-26 16:20:55,335 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 1647 [2025-04-26 16:20:55,424 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12028 states to 9649 states and 32999 transitions. [2025-04-26 16:20:55,424 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2741 [2025-04-26 16:20:55,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3572 [2025-04-26 16:20:55,432 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9649 states and 32999 transitions. [2025-04-26 16:20:55,433 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:20:55,433 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9649 states and 32999 transitions. [2025-04-26 16:20:55,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9649 states and 32999 transitions. [2025-04-26 16:20:55,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9649 to 8594. [2025-04-26 16:20:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8594 states have (on average 3.455084942983477) internal successors, (in total 29693), 8593 states have internal predecessors, (29693), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:55,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 29693 transitions. [2025-04-26 16:20:55,698 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8594 states and 29693 transitions. [2025-04-26 16:20:55,698 INFO L438 stractBuchiCegarLoop]: Abstraction has 8594 states and 29693 transitions. [2025-04-26 16:20:55,698 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:20:55,699 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8594 states and 29693 transitions. [2025-04-26 16:20:55,740 INFO L131 ngComponentsAnalysis]: Automaton has 183 accepting balls. 1647 [2025-04-26 16:20:55,740 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:20:55,740 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:20:55,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 16:20:55,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:20:55,741 INFO L752 eck$LassoCheckResult]: Stem: "[95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1]" "[80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 16:20:55,741 INFO L754 eck$LassoCheckResult]: Loop: "[83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[]" "[85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" "[87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 16:20:55,741 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:55,741 INFO L85 PathProgramCache]: Analyzing trace with hash 119382786, now seen corresponding path program 1 times [2025-04-26 16:20:55,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:55,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055443240] [2025-04-26 16:20:55,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:55,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:55,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:55,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:55,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,745 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:55,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:55,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:55,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:55,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:55,747 INFO L85 PathProgramCache]: Analyzing trace with hash -485703434, now seen corresponding path program 1 times [2025-04-26 16:20:55,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:55,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198688549] [2025-04-26 16:20:55,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:55,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:55,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:55,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:55,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,757 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:55,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:55,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:55,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:55,767 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1138749205, now seen corresponding path program 1 times [2025-04-26 16:20:55,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:20:55,767 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717523423] [2025-04-26 16:20:55,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:20:55,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:20:55,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:55,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:55,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,775 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:20:55,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-26 16:20:55,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-26 16:20:55,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:55,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:20:55,785 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:20:55,899 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:20:55,900 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:20:55,900 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:20:55,900 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:20:55,900 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:20:55,900 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:55,900 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:20:55,900 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:20:55,900 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:20:55,900 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:20:55,900 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:20:55,901 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,903 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,905 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,907 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,909 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,911 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,913 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,915 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,917 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,918 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,921 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,922 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,924 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:55,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:20:56,050 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:20:56,050 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:20:56,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,053 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:20:56,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,067 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:20:56,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,075 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:20:56,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,088 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,088 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,094 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 16:20:56,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,104 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:20:56,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,118 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,125 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:20:56,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,140 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,140 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,144 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,150 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:20:56,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,153 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:20:56,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,165 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,166 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,166 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,166 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,170 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,179 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:20:56,182 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,192 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,192 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,192 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,196 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,200 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:20:56,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,208 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:20:56,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,220 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,222 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:20:56,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,230 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:20:56,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,248 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,257 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:20:56,259 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,269 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,270 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,271 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,277 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:20:56,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,280 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:20:56,283 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,293 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,293 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,293 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,293 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,297 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,306 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:20:56,308 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,319 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,319 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,319 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,319 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,319 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,321 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:20:56,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,328 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:20:56,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,340 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,342 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:20:56,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,349 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:20:56,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,361 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,361 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,361 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,361 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,361 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,362 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,370 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:20:56,372 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,382 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,388 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 16:20:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,397 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:20:56,399 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,409 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,410 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,418 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:20:56,421 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:20:56,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,431 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:20:56,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:20:56,433 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:20:56,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,440 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:20:56,443 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:20:56,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:20:56,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:20:56,471 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:20:56,471 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:20:56,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:20:56,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:20:56,486 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:20:56,499 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:20:56,499 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:20:56,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:20:56,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:20:56,503 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:20:56,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:20:56,507 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:20:56,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,527 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:20:56,527 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:20:56,527 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i#1, N) = -1*sumThread1of1ForFork2_i#1 + 1*N Supporting invariants [] [2025-04-26 16:20:56,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2025-04-26 16:20:56,547 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:20:56,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:20:56,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:20:56,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:20:56,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:56,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:56,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:20:56,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:56,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:20:56,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:20:56,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:20:56,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:20:56,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:20:56,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:20:56,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:20:56,656 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:20:56,656 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8594 states and 29693 transitions. cyclomatic complexity: 21398 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:56,877 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8594 states and 29693 transitions. cyclomatic complexity: 21398. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 23349 states and 83294 transitions. Complement of second has 6 states. [2025-04-26 16:20:56,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:20:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (in total 14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:20:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-04-26 16:20:56,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 128 transitions. Stem has 5 letters. Loop has 9 letters. [2025-04-26 16:20:56,879 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:56,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 128 transitions. Stem has 14 letters. Loop has 9 letters. [2025-04-26 16:20:56,879 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:56,879 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 128 transitions. Stem has 5 letters. Loop has 18 letters. [2025-04-26 16:20:56,880 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:20:56,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23349 states and 83294 transitions. [2025-04-26 16:20:57,094 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:57,095 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23349 states to 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:20:57,095 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:20:57,095 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:20:57,095 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:20:57,095 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:20:57,095 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:20:57,095 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:20:57,101 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:20:57 BoogieIcfgContainer [2025-04-26 16:20:57,101 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:20:57,102 INFO L158 Benchmark]: Toolchain (without parser) took 4889.99ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 85.5MB in the beginning and 264.5MB in the end (delta: -179.0MB). Peak memory consumption was 111.5MB. Max. memory is 8.0GB. [2025-04-26 16:20:57,102 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.67ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:57,102 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.24ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:57,102 INFO L158 Benchmark]: Boogie Preprocessor took 24.24ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 82.1MB in the end (delta: 874.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:20:57,102 INFO L158 Benchmark]: RCFGBuilder took 204.24ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.8MB in the end (delta: 9.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:20:57,103 INFO L158 Benchmark]: BuchiAutomizer took 4596.87ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 72.7MB in the beginning and 264.5MB in the end (delta: -191.8MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. [2025-04-26 16:20:57,103 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.67ms. Allocated memory is still 159.4MB. Free memory is still 86.4MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.24ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 83.0MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.24ms. Allocated memory is still 159.4MB. Free memory was 83.0MB in the beginning and 82.1MB in the end (delta: 874.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 204.24ms. Allocated memory is still 159.4MB. Free memory was 82.0MB in the beginning and 72.8MB in the end (delta: 9.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * BuchiAutomizer took 4596.87ms. Allocated memory was 159.4MB in the beginning and 448.8MB in the end (delta: 289.4MB). Free memory was 72.7MB in the beginning and 264.5MB in the end (delta: -191.8MB). Peak memory consumption was 103.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.4s AutomataMinimizationTime, 2 MinimizatonAttempts, 1946 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.6s 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, 302 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 384 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 190 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 234 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 194 mSDtfsCounter, 234 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital51 mio100 ax100 hnf100 lsp81 ukn73 mio100 lsp46 div100 bol100 ite100 ukn100 eq180 hnf93 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 38ms 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 -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:20:57,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request...