/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 true -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:24:40,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-10 00:24:40,405 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:24:40,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-10 00:24:40,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-10 00:24:40,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-10 00:24:40,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-10 00:24:40,461 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-10 00:24:40,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-10 00:24:40,466 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-10 00:24:40,466 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-10 00:24:40,466 INFO L153 SettingsManager]: * Use SBE=true [2024-02-10 00:24:40,466 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-10 00:24:40,477 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-10 00:24:40,477 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-10 00:24:40,477 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-10 00:24:40,477 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-10 00:24:40,477 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-10 00:24:40,478 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-10 00:24:40,478 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-10 00:24:40,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-10 00:24:40,479 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-10 00:24:40,479 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-10 00:24:40,479 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-10 00:24:40,480 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-10 00:24:40,481 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-10 00:24:40,481 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-10 00:24:40,481 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-10 00:24:40,482 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-10 00:24:40,482 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-10 00:24:40,482 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-10 00:24:40,482 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-10 00:24:40,482 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-10 00:24:40,483 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 -> true [2024-02-10 00:24:40,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-10 00:24:41,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-10 00:24:41,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-10 00:24:41,034 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-10 00:24:41,035 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-10 00:24:41,036 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:24:41,036 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:24:41,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-10 00:24:41,077 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-10 00:24:41,079 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:41,079 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-10 00:24:41,079 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-10 00:24:41,111 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:24:41" (1/1) ... [2024-02-10 00:24:41,161 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:24:41" (1/1) ... [2024-02-10 00:24:41,185 INFO L138 Inliner]: procedures = 3, calls = 4, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-10 00:24:41,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-10 00:24:41,189 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-10 00:24:41,189 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-10 00:24:41,190 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-10 00:24:41,212 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:24:41" (1/1) ... [2024-02-10 00:24:41,212 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:24:41" (1/1) ... [2024-02-10 00:24:41,229 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:24:41" (1/1) ... [2024-02-10 00:24:41,229 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:24:41" (1/1) ... [2024-02-10 00:24:41,231 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:24:41" (1/1) ... [2024-02-10 00:24:41,236 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:24:41" (1/1) ... [2024-02-10 00:24:41,236 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:24:41" (1/1) ... [2024-02-10 00:24:41,237 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:24:41" (1/1) ... [2024-02-10 00:24:41,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-10 00:24:41,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-10 00:24:41,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-10 00:24:41,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-10 00:24:41,240 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:24:41" (1/1) ... [2024-02-10 00:24:41,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:41,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:41,301 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:24:41,356 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:24:41,403 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-10 00:24:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-10 00:24:41,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-10 00:24:41,404 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-10 00:24:41,404 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-10 00:24:41,404 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-10 00:24:41,405 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:24:41,478 INFO L236 CfgBuilder]: Building ICFG [2024-02-10 00:24:41,480 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-10 00:24:41,653 INFO L277 CfgBuilder]: Performing block encoding [2024-02-10 00:24:41,679 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-10 00:24:41,680 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-10 00:24:41,682 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 12:24:41 BoogieIcfgContainer [2024-02-10 00:24:41,682 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-10 00:24:41,683 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-10 00:24:41,683 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-10 00:24:41,690 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-10 00:24:41,691 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:41,691 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:24:41" (1/2) ... [2024-02-10 00:24:41,693 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3bcdbea8 and model type array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.02 12:24:41, skipping insertion in model container [2024-02-10 00:24:41,693 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-10 00:24:41,693 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:24:41" (2/2) ... [2024-02-10 00:24:41,707 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log.bpl [2024-02-10 00:24:41,848 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-10 00:24:41,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 40 places, 37 transitions, 88 flow [2024-02-10 00:24:41,923 INFO L124 PetriNetUnfolderBase]: 2/33 cut-off events. [2024-02-10 00:24:41,923 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-10 00:24:41,928 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:24:41,928 INFO L82 GeneralOperation]: Start removeDead. Operand has 40 places, 37 transitions, 88 flow [2024-02-10 00:24:41,932 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 38 places, 33 transitions, 78 flow [2024-02-10 00:24:41,937 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-10 00:24:41,938 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-10 00:24:41,938 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-10 00:24:41,939 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-10 00:24:41,939 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-10 00:24:41,939 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-10 00:24:41,939 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-10 00:24:41,939 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-10 00:24:41,939 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:41,940 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 38 places, 33 transitions, 78 flow [2024-02-10 00:24:41,979 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 200 states, 198 states have (on average 1.994949494949495) internal successors, (395), 199 states have internal predecessors, (395), 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:24:41,981 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 200 states, 198 states have (on average 1.994949494949495) internal successors, (395), 199 states have internal predecessors, (395), 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:24:42,020 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 171 [2024-02-10 00:24:42,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:42,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:42,025 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-10 00:24:42,025 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:42,025 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 38 places, 33 transitions, 78 flow [2024-02-10 00:24:42,035 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 200 states, 198 states have (on average 1.994949494949495) internal successors, (395), 199 states have internal predecessors, (395), 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:24:42,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 200 states, 198 states have (on average 1.994949494949495) internal successors, (395), 199 states have internal predecessors, (395), 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:24:42,049 INFO L131 ngComponentsAnalysis]: Automaton has 11 accepting balls. 171 [2024-02-10 00:24:42,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:42,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:42,060 INFO L748 eck$LassoCheckResult]: Stem: Black: 445#[$Ultimate##0]don't care [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] 448#[$Ultimate##0, L54]don't care [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] 452#[L38, L54]don't care [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] 458#[L39-1, L54]don't care [2024-02-10 00:24:42,061 INFO L750 eck$LassoCheckResult]: Loop: 458#[L39-1, L54]don't care [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[] 468#[L54, L40]don't care [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] 484#[L41, L54]don't care [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] 504#[L54, L44]don't care [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] 528#[L25, L54]don't care [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] 556#[L54, L25-1]don't care [59] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 588#[L45, L54]don't care [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] 622#[L54, L25-2]don't care [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] 656#[L25-3, L54]don't care [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] 458#[L39-1, L54]don't care [2024-02-10 00:24:42,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,066 INFO L85 PathProgramCache]: Analyzing trace with hash 106350, now seen corresponding path program 1 times [2024-02-10 00:24:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583398093] [2024-02-10 00:24:42,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,137 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,164 INFO L85 PathProgramCache]: Analyzing trace with hash -289189928, now seen corresponding path program 1 times [2024-02-10 00:24:42,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232505471] [2024-02-10 00:24:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,212 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,251 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,252 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:42,252 INFO L85 PathProgramCache]: Analyzing trace with hash 6929163, now seen corresponding path program 1 times [2024-02-10 00:24:42,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:42,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838758780] [2024-02-10 00:24:42,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:42,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,282 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:42,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:42,527 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:42,527 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:42,527 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:42,528 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:42,528 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:42,528 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,528 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:42,528 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:42,528 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration1_Lasso [2024-02-10 00:24:42,528 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:42,528 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:42,547 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:24:42,580 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:24:42,666 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:24:42,774 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:42,777 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:42,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,796 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:24:42,800 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:24:42,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,821 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,822 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,826 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:24:42,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,871 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:24:42,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,875 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:24:42,881 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:24:42,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:42,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:42,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:42,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:42,908 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:42,908 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:42,930 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:24:42,958 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:42,981 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:24:42,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:42,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:42,983 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:24:42,989 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:24:43,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:43,000 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:43,001 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:43,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:43,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:43,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:43,006 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:43,016 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:24:43,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:43,029 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:24:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:43,049 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:24:43,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-10 00:24:43,064 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:43,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:43,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:43,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:43,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:43,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:43,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:43,080 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:24:43,089 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:43,095 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:24:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:43,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:43,098 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:24:43,103 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:24:43,112 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:43,112 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:43,112 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:43,112 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:43,124 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:43,124 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:43,147 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:24:43,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:43,170 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-10 00:24:43,171 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-10 00:24:43,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:43,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:43,175 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:24:43,179 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:43,188 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:24:43,200 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:43,201 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:43,201 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:24:43,209 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:24:43,228 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:24:43,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:43,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:43,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:43,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:43,362 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:24:43,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:43,484 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:24:43,547 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:24:43,548 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:24:43,775 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:24:43,776 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:43,776 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:43,777 INFO L63 sectAllAcceptingtNet]: Starting Intersection with all accepting Petri Net [2024-02-10 00:24:43,837 INFO L72 sectAllAcceptingtNet]: Exiting Intersection with all accepting Petri Net [2024-02-10 00:24:43,856 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:43,859 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:24:43,864 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:24:43,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-02-10 00:24:43,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-10 00:24:43,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:43,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-10 00:24:43,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:43,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-10 00:24:43,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:43,869 INFO L428 stractBuchiCegarLoop]: Abstraction has has 47 places, 413 transitions, 1793 flow [2024-02-10 00:24:43,870 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-10 00:24:43,870 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:43,870 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 47 places, 413 transitions, 1793 flow [2024-02-10 00:24:43,922 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 425 states, 419 states have (on average 3.011933174224344) internal successors, (1262), 424 states have internal predecessors, (1262), 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:24:43,922 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 425 states, 419 states have (on average 3.011933174224344) internal successors, (1262), 424 states have internal predecessors, (1262), 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:24:43,941 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 126 [2024-02-10 00:24:43,941 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-02-10 00:24:43,941 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-02-10 00:24:43,944 INFO L748 eck$LassoCheckResult]: Stem: Black: 912#[$Ultimate##0]don't care [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] Black: 915#[L54, $Ultimate##0]don't care [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] 923#[$Ultimate##0, L55, $Ultimate##0]don't care [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] 933#[L38, L55, $Ultimate##0]don't care [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] 946#[L39-1, L55, $Ultimate##0]don't care [2024-02-10 00:24:43,945 INFO L750 eck$LassoCheckResult]: Loop: 946#[L39-1, L55, $Ultimate##0]don't care [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[] 979#[L55, L40, $Ultimate##0]don't care [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] 1027#[L41, L55, $Ultimate##0]don't care [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] 1081#[L44, L55, $Ultimate##0]don't care [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] 1163#[L25, L55, $Ultimate##0]don't care [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] 1259#[L25-1, L55, $Ultimate##0]don't care [72] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 1353#[L45, L55, $Ultimate##0]don't care [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] 1455#[L25-2, L55, $Ultimate##0]don't care [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] 1556#[L55, L25-3, $Ultimate##0]don't care [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] 946#[L39-1, L55, $Ultimate##0]don't care [2024-02-10 00:24:43,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:43,946 INFO L85 PathProgramCache]: Analyzing trace with hash 3327077, now seen corresponding path program 1 times [2024-02-10 00:24:43,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:43,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117254939] [2024-02-10 00:24:43,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:43,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:43,956 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:43,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:43,972 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:43,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2092332699, now seen corresponding path program 1 times [2024-02-10 00:24:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937169653] [2024-02-10 00:24:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:43,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:43,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:43,980 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:43,996 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:43,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:43,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1118008705, now seen corresponding path program 1 times [2024-02-10 00:24:43,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-10 00:24:43,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74466468] [2024-02-10 00:24:43,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-10 00:24:43,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-10 00:24:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:44,032 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-10 00:24:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-10 00:24:44,067 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-10 00:24:44,179 INFO L210 LassoAnalysis]: Preferences: [2024-02-10 00:24:44,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-10 00:24:44,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-10 00:24:44,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-10 00:24:44,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-10 00:24:44,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,179 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-10 00:24:44,179 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-10 00:24:44,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log.bpl_BEv2_Iteration2_Lasso [2024-02-10 00:24:44,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-10 00:24:44,180 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-10 00:24:44,182 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:24:44,184 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:24:44,190 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:24:44,194 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:24:44,234 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:24:44,237 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:24:44,239 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:24:44,240 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:24:44,359 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-10 00:24:44,359 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-10 00:24:44,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,374 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:24:44,420 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:24:44,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,427 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:44,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,428 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:44,428 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:44,432 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:24:44,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,472 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:24:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,474 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:24:44,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:24:44,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:44,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:44,514 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:24:44,527 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,546 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:24:44,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,551 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:24:44,577 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:24:44,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,594 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:44,594 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:44,608 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:24:44,621 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,640 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:24:44,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,661 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:24:44,694 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:24:44,694 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:24:44,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:44,703 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,703 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,703 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:44,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:44,726 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,746 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:24:44,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,765 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:24:44,802 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:24:44,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,810 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-10 00:24:44,810 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,810 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,811 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-10 00:24:44,811 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-10 00:24:44,820 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:24:44,829 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,851 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:24:44,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,869 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:24:44,891 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:24:44,899 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:44,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:44,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:44,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:44,904 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:44,904 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:44,909 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:24:44,926 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-10 00:24:44,954 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:24:44,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:44,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:44,969 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:24:44,995 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:24:45,003 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-10 00:24:45,003 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-10 00:24:45,003 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-10 00:24:45,004 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-10 00:24:45,009 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-10 00:24:45,009 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-10 00:24:45,013 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:24:45,024 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-10 00:24:45,053 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-02-10 00:24:45,053 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-02-10 00:24:45,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-10 00:24:45,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-10 00:24:45,060 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:24:45,065 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-10 00:24:45,073 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:24:45,083 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-10 00:24:45,083 INFO L513 LassoAnalysis]: Proved termination. [2024-02-10 00:24:45,084 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:24:45,091 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:24:45,105 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-10 00:24:45,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-10 00:24:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:45,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-10 00:24:45,130 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-10 00:24:45,161 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-10 00:24:45,162 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-10 00:24:45,275 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:24:45,276 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:24:45,276 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:24:45,413 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:24:45,413 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-10 00:24:45,413 INFO L112 BuchiIntersect]: use intersection optimizations [2024-02-10 00:24:45,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 465 transitions. [2024-02-10 00:24:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2024-02-10 00:24:45,426 INFO L79 tersectStemOptimized]: Starting StemOptimized Intersection [2024-02-10 00:24:45,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states and 465 transitions. [2024-02-10 00:24:45,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 465 transitions. [2024-02-10 00:24:45,519 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:24:45,540 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:24:45,777 INFO L90 tersectStemOptimized]: Exiting StemOptimized Intersection [2024-02-10 00:24:45,777 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-10 00:24:45,778 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:24:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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:24:45,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2024-02-10 00:24:45,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 4 letters. Loop has 9 letters. [2024-02-10 00:24:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:45,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 13 letters. Loop has 9 letters. [2024-02-10 00:24:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:45,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 179 transitions. Stem has 4 letters. Loop has 18 letters. [2024-02-10 00:24:45,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-10 00:24:45,779 INFO L428 stractBuchiCegarLoop]: Abstraction has has 60 places, 6722 transitions, 42456 flow [2024-02-10 00:24:45,779 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-10 00:24:45,780 INFO L139 chiPetriNetCegarLoop]: use automaton for emptiness check [2024-02-10 00:24:45,780 INFO L128 iNet2FiniteAutomaton]: Start buchiPetriNet2FiniteAutomaton. Operand has 60 places, 6722 transitions, 42456 flow [2024-02-10 00:24:47,245 INFO L151 iNet2FiniteAutomaton]: Finished buchiPetriNet2FiniteAutomaton. Result has 1090 states, 1060 states have (on average 4.05188679245283) internal successors, (4295), 1089 states have internal predecessors, (4295), 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:24:47,246 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 1090 states, 1060 states have (on average 4.05188679245283) internal successors, (4295), 1089 states have internal predecessors, (4295), 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:24:47,276 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-02-10 00:24:47,276 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-02-10 00:24:47,285 INFO L201 PluginConnector]: Adding new model array-sum-with-log.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.02 12:24:47 BoogieIcfgContainer [2024-02-10 00:24:47,285 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-10 00:24:47,292 INFO L158 Benchmark]: Toolchain (without parser) took 6208.90ms. Allocated memory was 174.1MB in the beginning and 285.2MB in the end (delta: 111.1MB). Free memory was 143.7MB in the beginning and 135.8MB in the end (delta: 7.9MB). Peak memory consumption was 133.1MB. Max. memory is 8.0GB. [2024-02-10 00:24:47,292 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-10 00:24:47,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 109.10ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 149.5MB in the end (delta: -6.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-10 00:24:47,293 INFO L158 Benchmark]: Boogie Preprocessor took 48.38ms. Allocated memory is still 174.1MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 990.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-10 00:24:47,295 INFO L158 Benchmark]: RCFGBuilder took 443.54ms. Allocated memory is still 174.1MB. Free memory was 148.4MB in the beginning and 138.9MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-10 00:24:47,295 INFO L158 Benchmark]: BuchiAutomizer took 5602.68ms. Allocated memory was 174.1MB in the beginning and 285.2MB in the end (delta: 111.1MB). Free memory was 138.7MB in the beginning and 135.8MB in the end (delta: 2.9MB). Peak memory consumption was 129.0MB. Max. memory is 8.0GB. [2024-02-10 00:24:47,301 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.10ms. Allocated memory is still 174.1MB. Free memory is still 144.8MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 109.10ms. Allocated memory is still 174.1MB. Free memory was 143.5MB in the beginning and 149.5MB in the end (delta: -6.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 48.38ms. Allocated memory is still 174.1MB. Free memory was 149.5MB in the beginning and 148.5MB in the end (delta: 990.2kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 443.54ms. Allocated memory is still 174.1MB. Free memory was 148.4MB in the beginning and 138.9MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 5602.68ms. Allocated memory was 174.1MB in the beginning and 285.2MB in the end (delta: 111.1MB). Free memory was 138.7MB in the beginning and 135.8MB in the end (delta: 2.9MB). Peak memory consumption was 129.0MB. 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 5.3s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 2.3s. Construction of modules took 0.1s. Büchi inclusion checks took 1.1s. 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.2s 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: inital47 mio100 ax100 hnf100 lsp87 ukn71 mio100 lsp47 div100 bol100 ite100 ukn100 eq178 hnf94 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 71ms 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:24:47,334 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...