/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-3threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.2.3-?-9ecb849-m [2024-02-09 23:49:38,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-09 23:49:38,353 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:38,357 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-09 23:49:38,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-09 23:49:38,358 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:38,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-09 23:49:38,391 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-09 23:49:38,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-09 23:49:38,392 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-09 23:49:38,392 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-09 23:49:38,393 INFO L153 SettingsManager]: * Use SBE=true [2024-02-09 23:49:38,393 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-02-09 23:49:38,393 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-02-09 23:49:38,394 INFO L153 SettingsManager]: * Use old map elimination=false [2024-02-09 23:49:38,394 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-02-09 23:49:38,394 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-02-09 23:49:38,395 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-02-09 23:49:38,395 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-09 23:49:38,395 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-02-09 23:49:38,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-09 23:49:38,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-09 23:49:38,399 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-09 23:49:38,400 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-09 23:49:38,401 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-02-09 23:49:38,401 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-02-09 23:49:38,401 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-02-09 23:49:38,402 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-02-09 23:49:38,402 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-09 23:49:38,402 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-09 23:49:38,402 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-02-09 23:49:38,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-09 23:49:38,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-09 23:49:38,403 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-09 23:49:38,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-09 23:49:38,404 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-09 23:49:38,404 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-09 23:49:38,405 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-02-09 23:49:38,405 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:38,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-09 23:49:38,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-09 23:49:38,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-09 23:49:38,750 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2024-02-09 23:49:38,752 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2024-02-09 23:49:38,753 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-3threads.bpl [2024-02-09 23:49:38,754 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-3threads.bpl' [2024-02-09 23:49:38,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-09 23:49:38,788 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2024-02-09 23:49:38,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:38,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-09 23:49:38,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-09 23:49:38,798 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,814 INFO L138 Inliner]: procedures = 3, calls = 5, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2024-02-09 23:49:38,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-09 23:49:38,832 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-09 23:49:38,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-09 23:49:38,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-09 23:49:38,841 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,841 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,852 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,854 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-09 23:49:38,855 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-09 23:49:38,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-09 23:49:38,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-09 23:49:38,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/1) ... [2024-02-09 23:49:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:38,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:38,900 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:38,904 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:38,937 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2024-02-09 23:49:38,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-09 23:49:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-09 23:49:38,938 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2024-02-09 23:49:38,938 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2024-02-09 23:49:38,938 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2024-02-09 23:49:38,939 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:38,987 INFO L236 CfgBuilder]: Building ICFG [2024-02-09 23:49:38,989 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-09 23:49:39,112 INFO L277 CfgBuilder]: Performing block encoding [2024-02-09 23:49:39,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-09 23:49:39,125 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-09 23:49:39,126 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:39 BoogieIcfgContainer [2024-02-09 23:49:39,127 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-09 23:49:39,127 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-02-09 23:49:39,128 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-02-09 23:49:39,137 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-02-09 23:49:39,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:39,138 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 09.02 11:49:38" (1/2) ... [2024-02-09 23:49:39,140 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ddb7b97 and model type array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.02 11:49:39, skipping insertion in model container [2024-02-09 23:49:39,140 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-02-09 23:49:39,140 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.02 11:49:39" (2/2) ... [2024-02-09 23:49:39,143 INFO L332 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-3threads.bpl [2024-02-09 23:49:39,211 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-02-09 23:49:39,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 58 places, 54 transitions, 129 flow [2024-02-09 23:49:39,264 INFO L124 PetriNetUnfolderBase]: 3/48 cut-off events. [2024-02-09 23:49:39,265 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-02-09 23:49:39,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 48 events. 3/48 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 122 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2024-02-09 23:49:39,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 54 transitions, 129 flow [2024-02-09 23:49:39,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 48 transitions, 114 flow [2024-02-09 23:49:39,280 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2024-02-09 23:49:39,280 INFO L304 stractBuchiCegarLoop]: Hoare is false [2024-02-09 23:49:39,280 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-02-09 23:49:39,280 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-02-09 23:49:39,281 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-02-09 23:49:39,281 INFO L308 stractBuchiCegarLoop]: Difference is false [2024-02-09 23:49:39,281 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-02-09 23:49:39,281 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiPetriNetCegarLoop ======== [2024-02-09 23:49:39,282 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 places, 48 transitions, 114 flow [2024-02-09 23:49:39,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:39,294 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-02-09 23:49:39,294 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:39,294 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:39,298 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-02-09 23:49:39,298 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 55 places, 48 transitions, 114 flow [2024-02-09 23:49:39,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:39,309 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2024-02-09 23:49:39,309 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-09 23:49:39,310 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:39,314 INFO L748 eck$LassoCheckResult]: Stem: 62#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 64#[L54, $Ultimate##0]true [54] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 66#[L54, L38]true [55] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 68#[L54, L39-1]true [2024-02-09 23:49:39,315 INFO L750 eck$LassoCheckResult]: Loop: 68#[L54, L39-1]true [57] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 71#[L54, L40]true [59] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 73#[L54, L41]true [60] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 75#[L54, L44]true [61] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 77#[L54, L25]true [62] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, 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] 79#[L54, L25-1]true [63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 81#[L54, L45]true [64] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 83#[L54, L25-2]true [65] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, 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] 85#[L54, L25-3]true [66] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 68#[L54, L39-1]true [2024-02-09 23:49:39,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:39,324 INFO L85 PathProgramCache]: Analyzing trace with hash 122815, now seen corresponding path program 1 times [2024-02-09 23:49:39,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:39,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754229973] [2024-02-09 23:49:39,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:39,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,389 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,405 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:39,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:39,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1174385188, now seen corresponding path program 1 times [2024-02-09 23:49:39,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:39,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119317723] [2024-02-09 23:49:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:39,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,428 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:39,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:39,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1932215262, now seen corresponding path program 1 times [2024-02-09 23:49:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903623429] [2024-02-09 23:49:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,469 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:39,481 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:39,614 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:39,614 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:39,614 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:39,614 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:39,615 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:39,615 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,615 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:39,615 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:39,615 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration1_Lasso [2024-02-09 23:49:39,615 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:39,615 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:39,629 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:39,639 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:39,673 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:39,755 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:39,759 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:39,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,766 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:39,769 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:39,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:39,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:39,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:39,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:39,786 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:39,786 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:39,795 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:39,801 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:39,807 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-09 23:49:39,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,811 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:39,812 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:39,813 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:39,820 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:39,821 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:39,821 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:39,821 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:39,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:39,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:39,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:39,842 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-09 23:49:39,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,845 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:39,855 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:39,855 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:39,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:39,863 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:39,864 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:39,864 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:39,864 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:39,866 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:39,866 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:39,875 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:39,881 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:39,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,882 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:39,884 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:39,888 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:39,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:39,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:39,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:39,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:39,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:39,898 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:39,898 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:39,907 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:39,913 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:39,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,915 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:39,927 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:39,936 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:39,937 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:39,937 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:39,938 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:39,938 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:39,942 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:39,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:39,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:39,966 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-02-09 23:49:39,966 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2024-02-09 23:49:39,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:39,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:39,976 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:39,984 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:39,993 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:40,003 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:40,003 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:40,004 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:40,009 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:40,016 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:40,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:40,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:40,063 INFO L262 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:40,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:40,097 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2024-02-09 23:49:40,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:40,215 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:40,256 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:40,259 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:40,478 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 686 transitions.6 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:40,479 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:40,479 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:40,491 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:40,491 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:40,493 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:40,497 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:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2024-02-09 23:49:40,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 9 letters. [2024-02-09 23:49:40,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:40,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 12 letters. Loop has 9 letters. [2024-02-09 23:49:40,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:40,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 264 transitions. Stem has 3 letters. Loop has 18 letters. [2024-02-09 23:49:40,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:40,504 INFO L428 stractBuchiCegarLoop]: Abstraction has has 73 places, 1216 transitions, 5302 flow [2024-02-09 23:49:40,504 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-02-09 23:49:40,504 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 73 places, 1216 transitions, 5302 flow [2024-02-09 23:49:40,539 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-09 23:49:41,545 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:49:41,545 INFO L124 PetriNetUnfolderBase]: 4873/6553 cut-off events. [2024-02-09 23:49:41,546 INFO L125 PetriNetUnfolderBase]: For 544/544 co-relation queries the response was YES. [2024-02-09 23:49:41,546 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:49:41,551 INFO L748 eck$LassoCheckResult]: Stem: 62#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 64#[L54, $Ultimate##0]true [98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] 179#[$Ultimate##0, $Ultimate##0, L55]true [67] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1] 181#[L38, $Ultimate##0, L55]true [68] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 183#[L39-1, $Ultimate##0, L55]true [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 185#[L40, $Ultimate##0, L55]true [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_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] 187#[L41, $Ultimate##0, L55]true [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 189#[L44, $Ultimate##0, L55]true [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 191#[L25, $Ultimate##0, L55]true [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {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] 193#[L25-1, $Ultimate##0, L55]true [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 195#[L45, $Ultimate##0, L55]true [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 197#[L25-2, $Ultimate##0, L55]true [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {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] 199#[L25-3, $Ultimate##0, L55]true [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 183#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:41,551 INFO L750 eck$LassoCheckResult]: Loop: 183#[L39-1, $Ultimate##0, L55]true [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 185#[L40, $Ultimate##0, L55]true [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_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] 187#[L41, $Ultimate##0, L55]true [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 189#[L44, $Ultimate##0, L55]true [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 191#[L25, $Ultimate##0, L55]true [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {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] 193#[L25-1, $Ultimate##0, L55]true [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 195#[L45, $Ultimate##0, L55]true [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 197#[L25-2, $Ultimate##0, L55]true [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {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] 199#[L25-3, $Ultimate##0, L55]true [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 183#[L39-1, $Ultimate##0, L55]true [70] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_1) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 185#[L40, $Ultimate##0, L55]true [72] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_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] 187#[L41, $Ultimate##0, L55]true [73] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1] 189#[L44, $Ultimate##0, L55]true [74] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 191#[L25, $Ultimate##0, L55]true [75] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {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] 193#[L25-1, $Ultimate##0, L55]true [76] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 195#[L45, $Ultimate##0, L55]true [77] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 197#[L25-2, $Ultimate##0, L55]true [78] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {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] 199#[L25-3, $Ultimate##0, L55]true [79] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1] 183#[L39-1, $Ultimate##0, L55]true [2024-02-09 23:49:41,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1944556315, now seen corresponding path program 1 times [2024-02-09 23:49:41,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349314715] [2024-02-09 23:49:41,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,597 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,598 INFO L85 PathProgramCache]: Analyzing trace with hash -281160447, now seen corresponding path program 1 times [2024-02-09 23:49:41,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042854043] [2024-02-09 23:49:41,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,633 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:41,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1303228187, now seen corresponding path program 2 times [2024-02-09 23:49:41,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:49:41,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34306645] [2024-02-09 23:49:41,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:49:41,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:49:41,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,656 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:49:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:49:41,675 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:49:41,927 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:49:41,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:49:41,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:49:41,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:49:41,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:49:41,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:41,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:49:41,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:49:41,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration2_Lasso [2024-02-09 23:49:41,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:49:41,928 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:49:41,930 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:42,012 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:42,014 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:42,018 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:42,021 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:42,023 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:42,025 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:42,027 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:42,157 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:49:42,158 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:49:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,159 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:42,166 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:42,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,174 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:42,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,175 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:42,175 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:42,177 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:42,188 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,195 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:42,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,197 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:42,203 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:42,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,211 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:42,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,212 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:42,212 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:42,219 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:42,228 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,235 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:42,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,237 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:42,244 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:42,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,252 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:49:42,253 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,253 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,253 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,253 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:49:42,253 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:49:42,255 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:42,276 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:49:42,283 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:42,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,284 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:42,293 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:42,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:49:42,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:49:42,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:49:42,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:49:42,308 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:42,310 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:49:42,310 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:49:42,328 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:49:42,348 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2024-02-09 23:49:42,349 INFO L444 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-02-09 23:49:42,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:49:42,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:49:42,350 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:42,357 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:49:42,365 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:42,377 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:49:42,378 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:49:42,378 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:42,387 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:42,416 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:49:42,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:49:42,450 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-09 23:49:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:42,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:49:42,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:49:42,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:49:42,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:49:42,599 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:42,600 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:42,600 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:42,736 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 634 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:49:42,736 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:49:42,736 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:49:42,905 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:49:42,906 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:49:42,906 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:42,907 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:42,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2024-02-09 23:49:42,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 13 letters. Loop has 18 letters. [2024-02-09 23:49:42,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 31 letters. Loop has 18 letters. [2024-02-09 23:49:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 13 letters. Loop has 36 letters. [2024-02-09 23:49:42,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:49:42,913 INFO L428 stractBuchiCegarLoop]: Abstraction has has 89 places, 28456 transitions, 180468 flow [2024-02-09 23:49:42,914 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-02-09 23:49:42,914 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 89 places, 28456 transitions, 180468 flow [2024-02-09 23:51:36,824 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-09 23:51:36,824 INFO L124 PetriNetUnfolderBase]: 80360/99512 cut-off events. [2024-02-09 23:51:36,824 INFO L125 PetriNetUnfolderBase]: For 5777/5777 co-relation queries the response was YES. [2024-02-09 23:51:36,825 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty language is not empty [2024-02-09 23:51:36,826 INFO L748 eck$LassoCheckResult]: Stem: 62#[$Ultimate##0]true [95] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0] 64#[L54, $Ultimate##0]true [54] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 66#[L54, L38]true [55] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 68#[L54, L39-1]true [57] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_1) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[] 71#[L54, L40]true [59] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1] 73#[L54, L41]true [60] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1] 75#[L54, L44]true [61] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 77#[L54, L25]true [98] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1] 360#[$Ultimate##0, L25, L55]true [101] L55-->$Ultimate##0: Formula: (and (= 3 v_sumThread1of1ForFork2_thidvar1_2) (= 3 v_sumThread1of1ForFork2_thidvar0_2) (= 3 v_sumThread1of1ForFork2_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork2_thidvar0=v_sumThread1of1ForFork2_thidvar0_2, sumThread1of1ForFork2_thidvar1=v_sumThread1of1ForFork2_thidvar1_2, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_10|, sumThread1of1ForFork2_thidvar2=v_sumThread1of1ForFork2_thidvar2_2, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_14|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork2_thidvar0, sumThread1of1ForFork2_thidvar1, sumThread1of1ForFork2_x#1, sumThread1of1ForFork2_thidvar2, sumThread1of1ForFork2_log_msg#1, sumThread1of1ForFork2_i#1] 362#[L56, L25, $Ultimate##0, $Ultimate##0]true [80] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork2_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 364#[L56, L38, $Ultimate##0, L25]true [81] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 366#[L39-1, L56, L25, $Ultimate##0]true [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 368#[L56, L40, $Ultimate##0, L25]true [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 370#[L41, L56, L25, $Ultimate##0]true [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 372#[L56, $Ultimate##0, L25, L44]true [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 374#[L56, L25, L25, $Ultimate##0]true [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 376#[L56, L25-1, $Ultimate##0, L25]true [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 378#[L56, L45, L25, $Ultimate##0]true [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 380#[L25-2, L56, $Ultimate##0, L25]true [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 382#[L25-3, L56, L25, $Ultimate##0]true [62] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, 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] 384#[L25-1, L25-3, L56, $Ultimate##0]true [63] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1] 386#[L25-3, L56, $Ultimate##0, L45]true [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 388#[L39-1, L56, $Ultimate##0, L45]true [2024-02-09 23:51:36,826 INFO L750 eck$LassoCheckResult]: Loop: 388#[L39-1, L56, $Ultimate##0, L45]true [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 391#[L56, L40, $Ultimate##0, L45]true [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 393#[L41, L56, $Ultimate##0, L45]true [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 395#[L56, $Ultimate##0, L45, L44]true [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 397#[L56, L25, $Ultimate##0, L45]true [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 399#[L56, L25-1, $Ultimate##0, L45]true [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 401#[L56, L45, $Ultimate##0, L45]true [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 403#[L25-2, L56, $Ultimate##0, L45]true [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 386#[L25-3, L56, $Ultimate##0, L45]true [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 388#[L39-1, L56, $Ultimate##0, L45]true [83] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_1) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_1} AuxVars[] AssignedVars[] 391#[L56, L40, $Ultimate##0, L45]true [85] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1] 393#[L41, L56, $Ultimate##0, L45]true [86] L41-->L44: Formula: (= |v_sumThread1of1ForFork2_i#1_10| (+ |v_sumThread1of1ForFork2_i#1_9| 1)) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_9|} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1] 395#[L56, $Ultimate##0, L45, L44]true [87] L44-->L25: Formula: (= |v_sumThread1of1ForFork2_i#1_13| |v_sumThread1of1ForFork2_log_msg#1_1|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_1|, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 397#[L56, L25, $Ultimate##0, L45]true [88] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} OutVars{stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|} AuxVars[] AssignedVars[stdout, stdout_ptr] 399#[L56, L25-1, $Ultimate##0, L45]true [89] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 401#[L56, L45, $Ultimate##0, L45]true [90] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork2_log_msg#1_7| |v_sumThread1of1ForFork2_x#1_7|) InVars {sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 403#[L25-2, L56, $Ultimate##0, L45]true [91] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} OutVars{stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11, sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|} AuxVars[] AssignedVars[stdout, stdout_ptr] 386#[L25-3, L56, $Ultimate##0, L45]true [92] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1] 388#[L39-1, L56, $Ultimate##0, L45]true [2024-02-09 23:51:36,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:36,827 INFO L85 PathProgramCache]: Analyzing trace with hash 667966160, now seen corresponding path program 1 times [2024-02-09 23:51:36,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:36,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317905314] [2024-02-09 23:51:36,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:36,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:36,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,871 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:36,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:36,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1935588447, now seen corresponding path program 1 times [2024-02-09 23:51:36,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:36,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155601381] [2024-02-09 23:51:36,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:36,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:36,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,896 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:36,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,919 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:36,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1819006800, now seen corresponding path program 2 times [2024-02-09 23:51:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-09 23:51:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218776695] [2024-02-09 23:51:36,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-09 23:51:36,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-09 23:51:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,949 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-02-09 23:51:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-02-09 23:51:36,968 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-02-09 23:51:37,307 INFO L210 LassoAnalysis]: Preferences: [2024-02-09 23:51:37,307 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2024-02-09 23:51:37,307 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-02-09 23:51:37,307 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2024-02-09 23:51:37,307 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2024-02-09 23:51:37,307 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,307 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2024-02-09 23:51:37,308 INFO L132 ssoRankerPreferences]: Path of dumped script: [2024-02-09 23:51:37,308 INFO L133 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-3threads.bpl_BEv2_Iteration3_Lasso [2024-02-09 23:51:37,308 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2024-02-09 23:51:37,308 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2024-02-09 23:51:37,310 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:51:37,312 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:51:37,419 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:51:37,421 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:51:37,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:51:37,425 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:51:37,427 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:51:37,430 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:51:37,433 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:51:37,435 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:51:37,437 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:51:37,440 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:51:37,442 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:51:37,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2024-02-09 23:51:37,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2024-02-09 23:51:37,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,578 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-09 23:51:37,586 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-09 23:51:37,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:51:37,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:37,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:37,608 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:37,608 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:37,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:37,609 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:37,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:37,614 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:37,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2024-02-09 23:51:37,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,620 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-09 23:51:37,621 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-09 23:51:37,622 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:51:37,628 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:37,628 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:37,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:37,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:37,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:37,629 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:37,629 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:37,641 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:37,644 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-09 23:51:37,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,648 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-09 23:51:37,654 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:51:37,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:37,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:37,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:37,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:37,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:37,662 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:37,662 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:37,664 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-09 23:51:37,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:37,686 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-09 23:51:37,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,689 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:51:37,699 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:51:37,706 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:37,706 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-02-09 23:51:37,707 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:37,707 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:37,707 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:37,707 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-02-09 23:51:37,707 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-02-09 23:51:37,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-02-09 23:51:37,728 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-02-09 23:51:37,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-02-09 23:51:37,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,735 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:51:37,739 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:51:37,746 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-02-09 23:51:37,746 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-02-09 23:51:37,746 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-02-09 23:51:37,746 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-02-09 23:51:37,750 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-02-09 23:51:37,750 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-02-09 23:51:37,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-02-09 23:51:37,780 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-02-09 23:51:37,789 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2024-02-09 23:51:37,789 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2024-02-09 23:51:37,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-02-09 23:51:37,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-09 23:51:37,792 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-02-09 23:51:37,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-02-09 23:51:37,795 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-02-09 23:51:37,813 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-02-09 23:51:37,814 INFO L513 LassoAnalysis]: Proved termination. [2024-02-09 23:51:37,814 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork2_i#1, N) = -1*sumThread1of1ForFork2_i#1 + 1*N Supporting invariants [] [2024-02-09 23:51:37,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-02-09 23:51:37,820 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2024-02-09 23:51:37,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2024-02-09 23:51:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:37,850 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2024-02-09 23:51:37,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:37,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-09 23:51:37,887 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2024-02-09 23:51:37,888 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-02-09 23:51:37,951 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:51:37,952 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:51:37,952 INFO L162 BuchiComplementFKV]: Start buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:51:38,056 INFO L171 BuchiComplementFKV]: Finished buchiComplementFKV with optimization HEIMAT2. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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 634 transitions.5 powerset states3 rank states. The highest rank that occured is 1 [2024-02-09 23:51:38,056 INFO L89 BuchiIntersect]: Starting Intersection [2024-02-09 23:51:38,056 INFO L72 uchiIntersectDefault]: Starting Basic Intersection [2024-02-09 23:51:41,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-02-09 23:51:43,967 INFO L85 uchiIntersectDefault]: Exiting Basic Intersection [2024-02-09 23:51:43,967 INFO L99 BuchiIntersect]: Exiting Intersection [2024-02-09 23:51:43,968 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:51:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 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:51:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2024-02-09 23:51:43,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 22 letters. Loop has 18 letters. [2024-02-09 23:51:43,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:43,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 40 letters. Loop has 18 letters. [2024-02-09 23:51:43,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:43,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 210 transitions. Stem has 22 letters. Loop has 36 letters. [2024-02-09 23:51:43,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-02-09 23:51:43,970 INFO L428 stractBuchiCegarLoop]: Abstraction has has 105 places, 665472 transitions, 5538624 flow [2024-02-09 23:51:43,971 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-02-09 23:51:43,971 INFO L84 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 105 places, 665472 transitions, 5538624 flow Received shutdown request... [2024-02-09 23:53:36,921 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:53:36,957 WARN L341 stractBuchiCegarLoop]: Verification cancelled [2024-02-09 23:53:36,966 INFO L201 PluginConnector]: Adding new model array-sum-with-log-3threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.02 11:53:36 BoogieIcfgContainer [2024-02-09 23:53:36,966 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-02-09 23:53:36,967 INFO L158 Benchmark]: Toolchain (without parser) took 238178.74ms. Allocated memory was 151.0MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 122.9MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2024-02-09 23:53:36,971 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. [2024-02-09 23:53:36,972 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.95ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 120.9MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-02-09 23:53:36,973 INFO L158 Benchmark]: Boogie Preprocessor took 22.35ms. Allocated memory is still 233.8MB. Free memory was 208.2MB in the beginning and 207.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-02-09 23:53:36,974 INFO L158 Benchmark]: RCFGBuilder took 271.47ms. Allocated memory is still 233.8MB. Free memory was 207.1MB in the beginning and 198.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-02-09 23:53:36,974 INFO L158 Benchmark]: BuchiAutomizer took 237838.59ms. Allocated memory was 233.8MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 198.2MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 5.9GB. Max. memory is 8.0GB. [2024-02-09 23:53:36,981 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.11ms. Allocated memory is still 151.0MB. Free memory is still 124.1MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 26.95ms. Allocated memory is still 151.0MB. Free memory was 122.9MB in the beginning and 120.9MB in the end (delta: 2.0MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.35ms. Allocated memory is still 233.8MB. Free memory was 208.2MB in the beginning and 207.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 271.47ms. Allocated memory is still 233.8MB. Free memory was 207.1MB in the beginning and 198.3MB in the end (delta: 8.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * BuchiAutomizer took 237838.59ms. Allocated memory was 233.8MB in the beginning and 7.5GB in the end (delta: 7.3GB). Free memory was 198.2MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 5.9GB. 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 3 terminating modules (0 trivial, 3 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. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. The remainder module has 5538624 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 237.7s and 4 iterations. TraceHistogramMax:0. Analysis of lassos took 2.5s. Construction of modules took 0.2s. Büchi inclusion checks took 6.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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 18/18 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 463 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 460 mSDsluCounter, 612 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 288 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 362 IncrementalHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 324 mSDtfsCounter, 362 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital82 mio100 ax100 hnf100 lsp88 ukn57 mio100 lsp46 div100 bol100 ite100 ukn100 eq200 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 41ms 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