/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.automaton.type.for.concurrent.programs BUCHI_PETRI_NET --buchiautomizer.use.buchi.petri.net.intersection.optimizations true --buchiautomizer.use.automata.for.buchi.petri.net.emptiness.check false -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-10 00:57:41,996 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:57:42,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2024-02-10 00:57:42,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:57:42,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:57:42,084 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:57:42,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:57:42,125 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:57:42,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:57:42,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:57:42,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:57:42,130 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:57:42,130 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:57:42,131 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:57:42,132 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:57:42,132 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:57:42,132 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:57:42,132 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:57:42,133 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:57:42,133 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:57:42,133 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:57:42,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:57:42,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:57:42,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:57:42,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:57:42,135 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:57:42,135 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:57:42,135 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:57:42,135 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:57:42,136 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:57:42,137 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:57:42,137 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:57:42,137 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:57:42,137 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:57:42,137 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:57:42,137 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:57:42,138 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:57:42,138 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:57:42,138 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Automaton type for concurrent programs -> BUCHI_PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use Buchi Petri Net Intersection Optimizations -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Use automata for Buchi Petri Net emptiness check -> false [2024-02-10 00:57:42,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:57:42,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:57:42,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:57:42,466 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:57:42,468 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:57:42,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl [2024-02-10 00:57:42,469 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log.bpl' [2024-02-10 00:57:42,492 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:57:42,494 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:57:42,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:42,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:57:42,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:57:42,513 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,520 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,533 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-10 00:57:42,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:57:42,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:57:42,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:57:42,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:57:42,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,557 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,557 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,558 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,562 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,563 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:57:42,565 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:57:42,565 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:57:42,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:57:42,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/1) ... [2024-02-10 00:57:42,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:42,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:42,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:42,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-02-10 00:57:42,670 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:57:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:57:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:57:42,671 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 00:57:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 00:57:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 00:57:42,672 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-10 00:57:42,719 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:57:42,722 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:57:42,854 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:57:42,866 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:57:42,867 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:57:42,883 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:57:42 BoogieIcfgContainer [2024-02-10 00:57:42,883 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:57:42,884 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:57:42,884 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:57:42,889 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:57:42,890 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:42,890 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 12:57:42" (1/2) ... [2024-02-10 00:57:42,892 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6dcfe7ad and model type array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:57:42, skipping insertion in model container [2024-02-10 00:57:42,892 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:57:42,892 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:57:42" (2/2) ... [2024-02-10 00:57:42,894 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log.bpl [2024-02-10 00:57:42,998 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:57:43,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 88 flow [2024-02-10 00:57:43,058 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-02-10 00:57:43,058 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:43,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 33 events. 2/33 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2024-02-10 00:57:43,068 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 88 flow [2024-02-10 00:57:43,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 78 flow [2024-02-10 00:57:43,080 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:57:43,080 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:57:43,081 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:57:43,082 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:57:43,082 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:57:43,082 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:57:43,082 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:57:43,083 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:57:43,083 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 33 transitions, 78 flow [2024-02-10 00:57:43,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:43,097 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-10 00:57:43,097 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:43,097 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:43,104 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:57:43,104 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 38 places, 33 transitions, 78 flow [2024-02-10 00:57:43,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:43,115 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-02-10 00:57:43,116 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:57:43,116 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:43,121 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [78] $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] 46#[L54, $Ultimate##0]true [50] $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] 48#[L54, L38]true [51] 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] 50#[L54, L39-1]true [2024-02-10 00:57:43,122 INFO L750 eck$LassoCheckResult]: Loop: 50#[L54, L39-1]true [53] 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[] 53#[L54, L40]true [55] 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] 55#[L54, L41]true [56] 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] 57#[L54, L44]true [57] 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] 59#[L54, L25]true [58] 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, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 61#[L25-1, L54]true [59] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 63#[L54, L45]true [60] 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#[L54, L25-2]true [61] 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, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 67#[L54, L25-3]true [62] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 50#[L54, L39-1]true [2024-02-10 00:57:43,127 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:43,127 INFO L85 PathProgramCache]: Analyzing trace with hash 106350, now seen corresponding path program 1 times [2024-02-10 00:57:43,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:43,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077917459] [2024-02-10 00:57:43,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:43,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:43,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,230 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:43,236 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:43,236 INFO L85 PathProgramCache]: Analyzing trace with hash -289189928, now seen corresponding path program 1 times [2024-02-10 00:57:43,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:43,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763286862] [2024-02-10 00:57:43,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:43,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,260 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,272 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:43,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:43,274 INFO L85 PathProgramCache]: Analyzing trace with hash 6929163, now seen corresponding path program 1 times [2024-02-10 00:57:43,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328710574] [2024-02-10 00:57:43,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:43,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,294 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:43,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:43,308 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:43,483 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:43,484 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:43,484 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:43,484 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:43,485 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:43,485 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,485 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:43,485 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:43,485 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:57:43,485 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:43,485 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:43,502 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:43,526 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:43,575 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:43,674 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:57:43,678 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:57:43,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,692 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 [2024-02-10 00:57:43,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:43,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:43,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:43,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:43,710 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:43,711 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:43,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-02-10 00:57:43,722 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:43,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:43,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,740 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 [2024-02-10 00:57:43,751 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:43,752 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:43,752 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:43,752 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:43,757 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:43,758 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:43,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-02-10 00:57:43,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:43,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:43,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,783 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,789 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 [2024-02-10 00:57:43,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:43,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:43,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:43,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:43,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:43,801 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:43,801 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:43,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-02-10 00:57:43,816 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:43,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:43,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,827 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,833 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 [2024-02-10 00:57:43,844 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:43,844 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:43,845 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:43,845 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:43,845 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:43,846 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:43,846 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:43,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-02-10 00:57:43,864 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:43,872 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:43,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:57:43,892 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:43,892 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:43,892 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:43,892 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:43,900 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:43,900 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:43,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-02-10 00:57:43,916 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:57:43,926 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:57:43,926 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:57:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:43,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:43,933 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:43,938 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:57:43,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-02-10 00:57:43,965 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:57:43,965 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:57:43,966 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2024-02-10 00:57:43,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:43,982 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:57:44,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:44,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-02-10 00:57:44,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:44,065 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:57:44,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:44,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:44,106 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:57:44,114 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:44,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:57:44,266 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 [2024-02-10 00:57:44,269 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:57:44,419 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 465 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:57:44,421 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:57:44,421 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:57:44,422 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:57:44,447 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:57:44,447 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:57:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:57:44,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:57:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-02-10 00:57:44,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-10 00:57:44,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:44,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-10 00:57:44,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:44,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-10 00:57:44,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:44,465 INFO L428 stractBuchiCegarLoop]: Abstraction has has 47 places, 413 transitions, 1793 flow [2024-02-10 00:57:44,465 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:57:44,465 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 47 places, 413 transitions, 1793 flow [2024-02-10 00:57:44,613 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-10 00:57:44,613 INFO L124 PetriNetUnfolderBase]: 480/736 cut-off events. [2024-02-10 00:57:44,613 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2024-02-10 00:57:44,614 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-10 00:57:44,615 INFO L748 eck$LassoCheckResult]: Stem: 44#[$Ultimate##0]true [78] $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] 46#[L54, $Ultimate##0]true [81] 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] 152#[$Ultimate##0, $Ultimate##0, L55]true [63] $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] 154#[L38, $Ultimate##0, L55]true [64] 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] 156#[L39-1, $Ultimate##0, L55]true [66] 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[] 158#[L40, $Ultimate##0, L55]true [68] 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_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 160#[L41, $Ultimate##0, L55]true [69] 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] 162#[L44, $Ultimate##0, L55]true [70] 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] 164#[L25, $Ultimate##0, L55]true [71] 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 {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 166#[L25-1, $Ultimate##0, L55]true [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 168#[L45, $Ultimate##0, L55]true [73] 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] 170#[L25-2, $Ultimate##0, L55]true [74] 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 {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 172#[L25-3, $Ultimate##0, L55]true [75] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 156#[L39-1, $Ultimate##0, L55]true [2024-02-10 00:57:44,616 INFO L750 eck$LassoCheckResult]: Loop: 156#[L39-1, $Ultimate##0, L55]true [66] 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[] 158#[L40, $Ultimate##0, L55]true [68] 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_x#1=|v_sumThread1of1ForFork1_x#1_3|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 160#[L41, $Ultimate##0, L55]true [69] 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] 162#[L44, $Ultimate##0, L55]true [70] 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] 164#[L25, $Ultimate##0, L55]true [71] 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 {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 166#[L25-1, $Ultimate##0, L55]true [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 168#[L45, $Ultimate##0, L55]true [73] 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] 170#[L25-2, $Ultimate##0, L55]true [74] 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 {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 172#[L25-3, $Ultimate##0, L55]true [75] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 156#[L39-1, $Ultimate##0, L55]true [2024-02-10 00:57:44,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1118008705, now seen corresponding path program 1 times [2024-02-10 00:57:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:44,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498991865] [2024-02-10 00:57:44,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:44,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:44,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:44,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2092332699, now seen corresponding path program 1 times [2024-02-10 00:57:44,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:44,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792876299] [2024-02-10 00:57:44,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:44,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,671 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,678 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:44,678 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:44,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1030898661, now seen corresponding path program 2 times [2024-02-10 00:57:44,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:57:44,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033165101] [2024-02-10 00:57:44,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:57:44,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:57:44,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:57:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:57:44,731 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:57:44,863 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:57:44,864 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:57:44,864 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:57:44,864 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:57:44,864 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:57:44,864 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:44,866 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:57:44,866 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:57:44,866 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:57:44,866 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:57:44,866 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:57:44,870 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,873 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,875 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,878 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,881 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,884 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,886 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:44,888 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-02-10 00:57:45,086 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:57:45,087 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:57:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,089 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,101 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 [2024-02-10 00:57:45,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,110 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:45,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,110 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,111 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:45,111 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:45,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-02-10 00:57:45,128 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,137 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-02-10 00:57:45,142 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 [2024-02-10 00:57:45,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,150 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:45,151 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,151 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,151 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,151 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:45,151 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:45,165 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,176 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,181 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 [2024-02-10 00:57:45,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-02-10 00:57:45,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,207 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,216 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-02-10 00:57:45,224 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 [2024-02-10 00:57:45,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,235 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,235 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,255 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2024-02-10 00:57:45,261 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 [2024-02-10 00:57:45,270 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,270 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,270 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,270 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,273 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,273 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,287 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,296 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,303 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 [2024-02-10 00:57:45,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,312 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:45,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,332 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,334 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:45,334 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:45,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2024-02-10 00:57:45,348 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,354 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,364 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 [2024-02-10 00:57:45,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:45,373 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,373 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,374 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:45,374 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:45,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2024-02-10 00:57:45,384 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,393 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,403 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 [2024-02-10 00:57:45,413 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,413 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:57:45,413 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,413 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,413 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,414 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:57:45,414 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:57:45,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2024-02-10 00:57:45,428 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,434 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-10 00:57:45,437 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 [2024-02-10 00:57:45,443 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,444 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,444 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,444 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,462 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,470 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,479 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 [2024-02-10 00:57:45,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-10 00:57:45,487 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,487 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,487 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,488 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,493 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,493 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,508 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:57:45,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,519 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,525 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 [2024-02-10 00:57:45,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:57:45,535 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:57:45,535 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:57:45,535 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:57:45,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:57:45,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:57:45,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-10 00:57:45,560 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:57:45,570 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-10 00:57:45,570 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-10 00:57:45,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:57:45,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:57:45,573 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-10 00:57:45,584 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:57:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-02-10 00:57:45,617 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:57:45,617 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:57:45,617 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2024-02-10 00:57:45,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-10 00:57:45,625 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:57:45,637 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:57:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:45,651 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:57:45,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:57:45,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:57:45,697 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:57:45,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-10 00:57:45,760 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 [2024-02-10 00:57:45,760 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:57:45,868 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 9 states and 465 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-10 00:57:45,869 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:57:45,869 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:57:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 465 transitions. [2024-02-10 00:57:45,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2024-02-10 00:57:45,882 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:57:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 465 transitions. [2024-02-10 00:57:45,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2024-02-10 00:57:46,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-02-10 00:57:46,116 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:57:46,116 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:57:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-10 00:57:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-10 00:57:46,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-02-10 00:57:46,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 13 letters. Loop has 9 letters. [2024-02-10 00:57:46,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:46,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 22 letters. Loop has 9 letters. [2024-02-10 00:57:46,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:46,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 13 letters. Loop has 18 letters. [2024-02-10 00:57:46,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:57:46,122 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 6722 transitions, 42456 flow [2024-02-10 00:57:46,124 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:57:46,124 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 60 places, 6722 transitions, 42456 flow [2024-02-10 00:57:49,049 INFO L124 PetriNetUnfolderBase]: 5668/7591 cut-off events. [2024-02-10 00:57:49,049 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2024-02-10 00:57:49,049 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is empty [2024-02-10 00:57:49,056 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:57:49 BoogieIcfgContainer [2024-02-10 00:57:49,056 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:57:49,057 INFO L158 Benchmark]: Toolchain (without parser) took 6563.54ms. Allocated memory was 186.6MB in the beginning and 556.8MB in the end (delta: 370.1MB). Free memory was 159.8MB in the beginning and 401.1MB in the end (delta: -241.3MB). Peak memory consumption was 239.1MB. Max. memory is 8.0GB. [2024-02-10 00:57:49,058 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.13ms. Allocated memory is still 186.6MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:57:49,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.32ms. Allocated memory is still 186.6MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:57:49,059 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory was 186.6MB in the beginning and 289.4MB in the end (delta: 102.8MB). Free memory was 157.7MB in the beginning and 264.8MB in the end (delta: -107.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-02-10 00:57:49,059 INFO L158 Benchmark]: RCFGBuilder took 317.69ms. Allocated memory is still 289.4MB. Free memory was 264.8MB in the beginning and 257.1MB in the end (delta: 7.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-10 00:57:49,059 INFO L158 Benchmark]: BuchiAutomizer took 6172.59ms. Allocated memory was 289.4MB in the beginning and 556.8MB in the end (delta: 267.4MB). Free memory was 256.8MB in the beginning and 401.1MB in the end (delta: -144.2MB). Peak memory consumption was 234.3MB. Max. memory is 8.0GB. [2024-02-10 00:57:49,061 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.13ms. Allocated memory is still 186.6MB. Free memory is still 160.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.32ms. Allocated memory is still 186.6MB. Free memory was 159.8MB in the beginning and 157.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.00ms. Allocated memory was 186.6MB in the beginning and 289.4MB in the end (delta: 102.8MB). Free memory was 157.7MB in the beginning and 264.8MB in the end (delta: -107.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 317.69ms. Allocated memory is still 289.4MB. Free memory was 264.8MB in the beginning and 257.1MB in the end (delta: 7.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 6172.59ms. Allocated memory was 289.4MB in the beginning and 556.8MB in the end (delta: 267.4MB). Free memory was 256.8MB in the beginning and 401.1MB in the end (delta: -144.2MB). Peak memory consumption was 234.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. One deterministic module has affine ranking function -1 * i + N and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.8s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 1. Minimization of det autom 0. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 272 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 126 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 146 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital57 mio100 ax100 hnf100 lsp90 ukn68 mio100 lsp46 div100 bol100 ite100 ukn100 eq180 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-02-10 00:57:49,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...