/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 -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-6threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:49:46,099 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:49:46,157 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-09 23:49:46,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:49:46,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:49:46,161 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.Only consider context switches at boundaries of atomic blocks [2024-02-09 23:49:46,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:49:46,197 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:49:46,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:49:46,201 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:49:46,201 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:49:46,201 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:49:46,201 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:49:46,202 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:49:46,202 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:49:46,203 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:49:46,203 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:49:46,203 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:49:46,203 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:49:46,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:49:46,204 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:49:46,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:49:46,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:49:46,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:49:46,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:49:46,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:49:46,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:49:46,206 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:49:46,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:49:46,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:49:46,207 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:49:46,207 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:49:46,207 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:49:46,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:49:46,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:49:46,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:49:46,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:49:46,208 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:49:46,208 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 [2024-02-09 23:49:46,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:49:46,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:49:46,477 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:49:46,478 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:49:46,479 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:49:46,480 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-6threads.bpl [2024-02-09 23:49:46,480 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-6threads.bpl' [2024-02-09 23:49:46,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:49:46,513 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:49:46,514 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:46,514 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:49:46,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:49:46,523 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,528 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,593 INFO L138 Inliner]: procedures = 3, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-09 23:49:46,595 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:46,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:49:46,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:49:46,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:49:46,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:49:46,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:49:46,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:49:46,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:49:46,619 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/1) ... [2024-02-09 23:49:46,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:46,650 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-09 23:49:46,667 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-09 23:49:46,697 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:49:46,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:49:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:49:46,698 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-09 23:49:46,698 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-09 23:49:46,698 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-09 23:49:46,699 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-09 23:49:46,743 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:49:46,744 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:49:46,819 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:49:46,829 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:49:46,829 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:49:46,831 INFO L201 PluginConnector]: Adding new model array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:46 BoogieIcfgContainer [2024-02-09 23:49:46,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:49:46,832 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:49:46,832 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:49:46,834 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:49:46,835 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:46,835 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:46" (1/2) ... [2024-02-09 23:49:46,836 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@44bc0aba and model type array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:49:46, skipping insertion in model container [2024-02-09 23:49:46,836 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:46,836 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:46" (2/2) ... [2024-02-09 23:49:46,837 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-6threads.bpl [2024-02-09 23:49:46,963 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2024-02-09 23:49:46,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 105 transitions, 252 flow [2024-02-09 23:49:47,042 INFO L124 PetriNetUnfolderBase]: 6/93 cut-off events. [2024-02-09 23:49:47,042 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-02-09 23:49:47,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 93 events. 6/93 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 349 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2024-02-09 23:49:47,048 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 105 transitions, 252 flow [2024-02-09 23:49:47,056 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 93 transitions, 222 flow [2024-02-09 23:49:47,061 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:49:47,061 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:49:47,061 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:49:47,061 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:49:47,061 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:49:47,061 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:49:47,061 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:49:47,061 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:49:47,062 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 places, 93 transitions, 222 flow [2024-02-09 23:49:47,077 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:47,078 INFO L124 PetriNetUnfolderBase]: 0/60 cut-off events. [2024-02-09 23:49:47,078 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:47,078 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:47,080 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:49:47,081 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 106 places, 93 transitions, 222 flow [2024-02-09 23:49:47,090 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:47,090 INFO L124 PetriNetUnfolderBase]: 0/60 cut-off events. [2024-02-09 23:49:47,090 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:47,091 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:47,095 INFO L748 eck$LassoCheckResult]: Stem: 116#[$Ultimate##0]true [146] $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] 118#[L54, $Ultimate##0]true [79] $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] 120#[L54, L38]true [80] 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] 122#[L54, L39-1]true [2024-02-09 23:49:47,095 INFO L750 eck$LassoCheckResult]: Loop: 122#[L54, L39-1]true [82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 125#[L54, L40]true [84] 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] 127#[L54, L41]true [85] 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] 129#[L54, L44]true [86] 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] 131#[L54, L25]true [87] 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] 133#[L25-1, L54]true [88] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 135#[L54, L45]true [89] 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] 137#[L54, L25-2]true [90] 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] 139#[L54, L25-3]true [91] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 122#[L54, L39-1]true [2024-02-09 23:49:47,104 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 172626, now seen corresponding path program 1 times [2024-02-09 23:49:47,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779803213] [2024-02-09 23:49:47,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,182 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1338146443, now seen corresponding path program 1 times [2024-02-09 23:49:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590603949] [2024-02-09 23:49:47,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,204 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1464724036, now seen corresponding path program 1 times [2024-02-09 23:49:47,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:47,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616305254] [2024-02-09 23:49:47,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:47,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,235 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:47,247 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:47,378 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:47,378 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:47,378 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:47,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:47,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:47,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,379 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:47,379 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:47,379 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:49:47,379 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:47,379 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:47,391 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-09 23:49:47,398 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-09 23:49:47,423 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-09 23:49:47,486 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:47,489 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:47,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,493 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-09 23:49:47,512 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-09 23:49:47,519 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:47,519 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:47,520 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:47,520 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:47,521 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-09 23:49:47,525 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:47,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:47,542 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:47,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2024-02-09 23:49:47,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,563 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-09 23:49:47,565 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-09 23:49:47,566 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-09 23:49:47,572 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:47,572 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:47,572 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:47,572 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:47,575 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:47,575 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:47,586 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:47,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2024-02-09 23:49:47,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,596 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-09 23:49:47,601 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-09 23:49:47,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:47,607 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:47,607 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-09 23:49:47,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:47,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:47,608 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:47,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:47,609 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:47,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:47,625 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-09 23:49:47,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,627 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-09 23:49:47,632 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-09 23:49:47,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:47,639 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:47,640 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:47,640 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:47,640 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:47,640 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:47,640 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:47,644 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-09 23:49:47,652 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:47,657 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-09 23:49:47,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,659 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-09 23:49:47,660 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-09 23:49:47,661 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-09 23:49:47,667 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:47,667 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:47,667 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:47,668 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:47,671 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:47,671 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:47,695 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:47,710 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:49:47,710 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:49:47,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:47,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:47,754 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-09 23:49:47,759 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:47,780 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-09 23:49:47,784 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:47,784 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:47,784 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2024-02-09 23:49:47,788 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-09 23:49:47,793 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:47,810 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:47,826 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:47,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:47,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:47,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:49:47,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:47,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-02-09 23:49:47,970 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-09 23:49:48,004 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-02-09 23:49:48,007 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-09 23:49:48,283 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 1349 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:48,284 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:48,285 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:48,300 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:48,300 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:48,303 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-09 23:49:48,308 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-09 23:49:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2024-02-09 23:49:48,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 519 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-09 23:49:48,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,316 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 519 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-09 23:49:48,316 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,317 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 519 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-09 23:49:48,317 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:48,317 INFO L428 stractBuchiCegarLoop]: Abstraction has has 124 places, 2386 transitions, 10450 flow [2024-02-09 23:49:48,318 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:49:48,318 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 124 places, 2386 transitions, 10450 flow [2024-02-09 23:49:55,217 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:55,217 INFO L124 PetriNetUnfolderBase]: 49229/57704 cut-off events. [2024-02-09 23:49:55,218 INFO L125 PetriNetUnfolderBase]: For 4823/4823 co-relation queries the response was YES. [2024-02-09 23:49:55,218 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:55,219 INFO L748 eck$LassoCheckResult]: Stem: 116#[$Ultimate##0]true [146] $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] 118#[L54, $Ultimate##0]true [149] 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] 233#[$Ultimate##0, $Ultimate##0, L55]true [118] $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] 235#[L38, $Ultimate##0, L55]true [119] 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] 237#[L39-1, $Ultimate##0, L55]true [121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[] 239#[L40, $Ultimate##0, L55]true [123] 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] 241#[L41, $Ultimate##0, L55]true [124] 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] 243#[$Ultimate##0, L44, L55]true [125] 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] 245#[L25, $Ultimate##0, L55]true [126] 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] 247#[L25-1, $Ultimate##0, L55]true [127] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 249#[L45, $Ultimate##0, L55]true [128] 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] 251#[L25-2, $Ultimate##0, L55]true [129] 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] 253#[L25-3, $Ultimate##0, L55]true [130] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 237#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:55,219 INFO L750 eck$LassoCheckResult]: Loop: 237#[L39-1, $Ultimate##0, L55]true [121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[] 239#[L40, $Ultimate##0, L55]true [123] 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] 241#[L41, $Ultimate##0, L55]true [124] 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] 243#[$Ultimate##0, L44, L55]true [125] 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] 245#[L25, $Ultimate##0, L55]true [126] 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] 247#[L25-1, $Ultimate##0, L55]true [127] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 249#[L45, $Ultimate##0, L55]true [128] 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] 251#[L25-2, $Ultimate##0, L55]true [129] 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] 253#[L25-3, $Ultimate##0, L55]true [130] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 237#[L39-1, $Ultimate##0, L55]true [121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[] 239#[L40, $Ultimate##0, L55]true [123] 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] 241#[L41, $Ultimate##0, L55]true [124] 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] 243#[$Ultimate##0, L44, L55]true [125] 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] 245#[L25, $Ultimate##0, L55]true [126] 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] 247#[L25-1, $Ultimate##0, L55]true [127] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 249#[L45, $Ultimate##0, L55]true [128] 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] 251#[L25-2, $Ultimate##0, L55]true [129] 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] 253#[L25-3, $Ultimate##0, L55]true [130] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 237#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:55,220 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 202471128, now seen corresponding path program 1 times [2024-02-09 23:49:55,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:55,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76217672] [2024-02-09 23:49:55,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:55,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,251 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:55,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,258 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:55,259 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:55,259 INFO L85 PathProgramCache]: Analyzing trace with hash -2146259359, now seen corresponding path program 1 times [2024-02-09 23:49:55,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:55,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329642977] [2024-02-09 23:49:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,280 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,303 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:55,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:55,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1292549496, now seen corresponding path program 2 times [2024-02-09 23:49:55,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:55,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560136749] [2024-02-09 23:49:55,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:55,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,330 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:55,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:55,552 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:55,553 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:55,553 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:55,553 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:55,553 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:55,553 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,553 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:55,553 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:55,553 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:49:55,553 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:55,553 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:55,554 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-09 23:49:55,614 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-09 23:49:55,616 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-09 23:49:55,618 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-09 23:49:55,620 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-09 23:49:55,621 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-09 23:49:55,623 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-09 23:49:55,625 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-09 23:49:55,715 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:55,715 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:55,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:55,716 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-09 23:49:55,731 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-09 23:49:55,737 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:55,737 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:55,738 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:55,738 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:55,738 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:55,738 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:55,738 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:55,740 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-09 23:49:55,748 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:55,753 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-09 23:49:55,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:55,755 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-09 23:49:55,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2024-02-09 23:49:55,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:55,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:55,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:55,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:55,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:55,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:55,768 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:55,769 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-09 23:49:55,784 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:55,790 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-09 23:49:55,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:55,791 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-09 23:49:55,796 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-09 23:49:55,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:55,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:55,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:55,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:55,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:55,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:55,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:55,812 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-09 23:49:55,812 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:55,817 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-09 23:49:55,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:55,819 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-09 23:49:55,835 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-09 23:49:55,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:55,841 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:55,841 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:55,841 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:55,843 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:55,843 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:55,848 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-09 23:49:55,856 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:55,873 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:49:55,874 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:49:55,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:55,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:55,893 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-09 23:49:55,897 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:55,906 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-09 23:49:55,914 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:55,915 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:55,915 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2024-02-09 23:49:55,921 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-09 23:49:55,923 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:55,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:55,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:55,948 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:56,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:49:56,015 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-09 23:49:56,110 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2024-02-09 23:49:56,111 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-09 23:49:56,278 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 8 states and 1246 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:56,278 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:56,278 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:56,492 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:56,493 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:56,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-02-09 23:49:56,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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-09 23:49:56,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2024-02-09 23:49:56,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 414 transitions. Stem has 13 letters. Loop has 18 letters. [2024-02-09 23:49:56,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:56,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 414 transitions. Stem has 31 letters. Loop has 18 letters. [2024-02-09 23:49:56,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:56,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 414 transitions. Stem has 13 letters. Loop has 36 letters. [2024-02-09 23:49:56,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:56,500 INFO L428 stractBuchiCegarLoop]: Abstraction has has 140 places, 56536 transitions, 360180 flow [2024-02-09 23:49:56,500 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:49:56,500 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 140 places, 56536 transitions, 360180 flow [2024-02-09 23:49:58,199 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 Received shutdown request... [2024-02-09 23:54:11,329 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-02-09 23:54:12,219 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-09 23:54:12,225 INFO L201 PluginConnector]: Adding new model array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:54:12 BoogieIcfgContainer [2024-02-09 23:54:12,225 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:54:12,229 INFO L158 Benchmark]: Toolchain (without parser) took 265712.36ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 135.5MB in the beginning and 3.5GB in the end (delta: -3.4GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2024-02-09 23:54:12,230 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.10ms. Allocated memory is still 199.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:12,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.24ms. Allocated memory is still 199.2MB. Free memory was 135.1MB in the beginning and 168.7MB in the end (delta: -33.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:12,231 INFO L158 Benchmark]: Boogie Preprocessor took 20.75ms. Allocated memory is still 199.2MB. Free memory was 168.7MB in the beginning and 167.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:54:12,232 INFO L158 Benchmark]: RCFGBuilder took 213.73ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 157.6MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2024-02-09 23:54:12,234 INFO L158 Benchmark]: BuchiAutomizer took 265393.29ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 157.2MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2024-02-09 23:54:12,241 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 199.2MB. Free memory is still 136.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 81.24ms. Allocated memory is still 199.2MB. Free memory was 135.1MB in the beginning and 168.7MB in the end (delta: -33.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.75ms. Allocated memory is still 199.2MB. Free memory was 168.7MB in the beginning and 167.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 213.73ms. Allocated memory is still 199.2MB. Free memory was 167.4MB in the beginning and 157.6MB in the end (delta: 9.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 265393.29ms. Allocated memory was 199.2MB in the beginning and 7.0GB in the end (delta: 6.8GB). Free memory was 157.2MB in the beginning and 3.5GB in the end (delta: -3.3GB). Peak memory consumption was 4.3GB. 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) and one module whose termination is unknown.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 4 locations. The remainder module has 360180 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 265.2s and 3 iterations. TraceHistogramMax:0. Analysis of lassos took 1.4s. Construction of modules took 0.2s. 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: 9/9 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 615 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 613 mSDsluCounter, 816 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 390 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 426 mSDtfsCounter, 442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital67 mio100 ax100 hnf100 lsp91 ukn61 mio100 lsp47 div100 bol100 ite100 ukn100 eq193 hnf92 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms 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 - TimeoutResult: Timeout (de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction) Buchi Automizer is unable to decide termination: Timeout while executing PetriNetUnfolderBuchi. RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown