/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/Termination.epf -tc ../../../trunk/examples/toolchains/BuchiAutomizerBplInline.xml -i ../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-6threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:53:28,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:29,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:29,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:29,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:29,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:29,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:29,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:29,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:29,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:29,034 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:29,034 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:29,035 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:29,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:29,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:29,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:29,036 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:29,036 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:29,036 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:29,037 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:29,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:29,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:29,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:29,250 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:29,251 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:29,252 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-6threads.bpl [2025-04-26 16:53:29,252 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-6threads.bpl' [2025-04-26 16:53:29,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:29,277 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:29,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:29,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:29,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:29,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,335 INFO L138 Inliner]: procedures = 3, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 16:53:29,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:29,341 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:29,341 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:29,341 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:29,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,355 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:29,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:29,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:29,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:29,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/1) ... [2025-04-26 16:53:29,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:29,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:29,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:29,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:29,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:29,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:29,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:29,420 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:53:29,421 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:53:29,421 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:53:29,421 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:29,453 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:29,455 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:29,534 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:29,535 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:29,548 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:29,549 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:29,549 INFO L201 PluginConnector]: Adding new model array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:29 BoogieIcfgContainer [2025-04-26 16:53:29,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:29,550 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:29,550 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:29,556 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:29,557 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:29,557 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:53:29" (1/2) ... [2025-04-26 16:53:29,559 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@61af9a89 and model type array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:29, skipping insertion in model container [2025-04-26 16:53:29,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:29,559 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:29" (2/2) ... [2025-04-26 16:53:29,560 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-6threads.bpl [2025-04-26 16:53:29,646 INFO L143 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2025-04-26 16:53:29,680 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:29,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:29,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:29,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:29,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:29,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 105 transitions, 252 flow [2025-04-26 16:53:29,781 INFO L116 PetriNetUnfolderBase]: 6/93 cut-off events. [2025-04-26 16:53:29,804 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-26 16:53:29,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 93 events. 6/93 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 349 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2025-04-26 16:53:29,811 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 105 transitions, 252 flow [2025-04-26 16:53:29,818 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 93 transitions, 222 flow [2025-04-26 16:53:29,818 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 106 places, 93 transitions, 222 flow [2025-04-26 16:53:29,823 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:32,684 WARN L140 AmpleReduction]: Number of pruned transitions: 59654 [2025-04-26 16:53:32,684 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:32,684 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 55 [2025-04-26 16:53:32,684 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:1149 [2025-04-26 16:53:32,684 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:17884 [2025-04-26 16:53:32,684 WARN L145 AmpleReduction]: Times succ was already a loop node:1958 [2025-04-26 16:53:32,684 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:149 [2025-04-26 16:53:32,684 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:32,723 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 19089 states, 19087 states have (on average 1.287525540944098) internal successors, (in total 24575), 19088 states have internal predecessors, (24575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:32,729 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:32,729 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:32,729 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:32,729 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:32,729 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:32,729 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:32,729 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:32,729 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:32,759 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19089 states, 19087 states have (on average 1.287525540944098) internal successors, (in total 24575), 19088 states have internal predecessors, (24575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:32,975 INFO L131 ngComponentsAnalysis]: Automaton has 175 accepting balls. 15616 [2025-04-26 16:53:32,976 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:32,976 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:32,981 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:32,981 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:32,982 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:33,009 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 19089 states, 19087 states have (on average 1.287525540944098) internal successors, (in total 24575), 19088 states have internal predecessors, (24575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:33,171 INFO L131 ngComponentsAnalysis]: Automaton has 175 accepting balls. 15616 [2025-04-26 16:53:33,172 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:33,172 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:33,172 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:33,172 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:33,176 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" [2025-04-26 16:53:33,177 INFO L754 eck$LassoCheckResult]: Loop: "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[87] L25-->L25-1: Formula: (and (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork0_log_msg#1_3|)) (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7)) InVars {stdout=v_stdout_6, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[88] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[89] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_7| |v_sumThread1of1ForFork0_x#1_7|) InVars {sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_7|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[90] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork0_log_msg#1_9|))) InVars {stdout=v_stdout_10, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[91] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" [2025-04-26 16:53:33,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,181 INFO L85 PathProgramCache]: Analyzing trace with hash 172626, now seen corresponding path program 1 times [2025-04-26 16:53:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843769463] [2025-04-26 16:53:33,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:33,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:33,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,235 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,254 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1338146443, now seen corresponding path program 1 times [2025-04-26 16:53:33,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,258 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190948345] [2025-04-26 16:53:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:33,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:33,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,275 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:33,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:33,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,291 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1464724036, now seen corresponding path program 1 times [2025-04-26 16:53:33,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,292 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380276421] [2025-04-26 16:53:33,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:33,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:33,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:33,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,306 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:33,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:33,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,323 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,570 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:33,570 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:33,570 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:33,570 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:33,570 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:33,571 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,571 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:33,571 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:33,571 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:33,571 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:33,571 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:33,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,657 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,740 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:33,743 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:33,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,749 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:33,755 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,771 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,771 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,771 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,779 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,779 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,784 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:33,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,795 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:33,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,809 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:33,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,811 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:33,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:33,812 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:53:33,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,821 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:33,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:33,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:33,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:33,837 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,847 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:33,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,861 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,861 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,861 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,873 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:33,882 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:33,882 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:33,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,948 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:33,950 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:33,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,970 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:33,970 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:33,970 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:33,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 16:53:33,983 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:34,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:34,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:34,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:34,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:34,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:34,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:34,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:34,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:34,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:34,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:34,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:34,126 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:34,152 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 19089 states, 19087 states have (on average 1.287525540944098) internal successors, (in total 24575), 19088 states have internal predecessors, (24575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:34,555 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 19089 states, 19087 states have (on average 1.287525540944098) internal successors, (in total 24575), 19088 states have internal predecessors, (24575), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 38176 states and 50365 transitions. Complement of second has 6 states. [2025-04-26 16:53:34,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:34,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2025-04-26 16:53:34,564 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 9 letters. [2025-04-26 16:53:34,564 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:34,567 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 12 letters. Loop has 9 letters. [2025-04-26 16:53:34,567 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:34,567 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 95 transitions. Stem has 3 letters. Loop has 18 letters. [2025-04-26 16:53:34,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:34,569 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38176 states and 50365 transitions. [2025-04-26 16:53:34,920 INFO L131 ngComponentsAnalysis]: Automaton has 221 accepting balls. 13011 [2025-04-26 16:53:35,234 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38176 states to 30747 states and 40887 transitions. [2025-04-26 16:53:35,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17890 [2025-04-26 16:53:35,261 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18254 [2025-04-26 16:53:35,262 INFO L74 IsDeterministic]: Start isDeterministic. Operand 30747 states and 40887 transitions. [2025-04-26 16:53:35,262 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:35,263 INFO L218 hiAutomatonCegarLoop]: Abstraction has 30747 states and 40887 transitions. [2025-04-26 16:53:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30747 states and 40887 transitions. [2025-04-26 16:53:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30747 to 30384. [2025-04-26 16:53:35,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30384 states, 30384 states have (on average 1.2937730384412849) internal successors, (in total 39310), 30383 states have internal predecessors, (39310), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30384 states to 30384 states and 39310 transitions. [2025-04-26 16:53:35,955 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30384 states and 39310 transitions. [2025-04-26 16:53:35,955 INFO L438 stractBuchiCegarLoop]: Abstraction has 30384 states and 39310 transitions. [2025-04-26 16:53:35,955 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:35,955 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30384 states and 39310 transitions. [2025-04-26 16:53:36,081 INFO L131 ngComponentsAnalysis]: Automaton has 221 accepting balls. 13011 [2025-04-26 16:53:36,081 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:36,082 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:36,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:36,082 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:36,083 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[81] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[83] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" [2025-04-26 16:53:36,083 INFO L754 eck$LassoCheckResult]: Loop: "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[126] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[127] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[128] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[129] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[130] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" [2025-04-26 16:53:36,084 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1294112350, now seen corresponding path program 1 times [2025-04-26 16:53:36,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:36,084 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541620097] [2025-04-26 16:53:36,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:36,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:36,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:36,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:36,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,090 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:36,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:36,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:36,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:36,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1842359836, now seen corresponding path program 1 times [2025-04-26 16:53:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:36,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343090246] [2025-04-26 16:53:36,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:36,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:36,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:36,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,100 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:36,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:36,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:36,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:36,109 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1697188251, now seen corresponding path program 1 times [2025-04-26 16:53:36,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:36,109 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533618334] [2025-04-26 16:53:36,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:36,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:36,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:36,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:36,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:36,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:36,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:36,167 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533618334] [2025-04-26 16:53:36,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533618334] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:36,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832829201] [2025-04-26 16:53:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:36,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:36,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:36,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:36,217 INFO L87 Difference]: Start difference. First operand 30384 states and 39310 transitions. cyclomatic complexity: 9209 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (in total 17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:36,551 INFO L93 Difference]: Finished difference Result 32239 states and 41577 transitions. [2025-04-26 16:53:36,551 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32239 states and 41577 transitions. [2025-04-26 16:53:36,719 INFO L131 ngComponentsAnalysis]: Automaton has 282 accepting balls. 14436 [2025-04-26 16:53:36,862 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32239 states to 32239 states and 41577 transitions. [2025-04-26 16:53:36,862 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19744 [2025-04-26 16:53:36,892 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19744 [2025-04-26 16:53:36,892 INFO L74 IsDeterministic]: Start isDeterministic. Operand 32239 states and 41577 transitions. [2025-04-26 16:53:36,893 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:36,893 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32239 states and 41577 transitions. [2025-04-26 16:53:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32239 states and 41577 transitions. [2025-04-26 16:53:37,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32239 to 30389. [2025-04-26 16:53:37,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30389 states, 30389 states have (on average 1.2937247030175392) internal successors, (in total 39315), 30388 states have internal predecessors, (39315), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:37,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30389 states to 30389 states and 39315 transitions. [2025-04-26 16:53:37,664 INFO L240 hiAutomatonCegarLoop]: Abstraction has 30389 states and 39315 transitions. [2025-04-26 16:53:37,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:37,665 INFO L438 stractBuchiCegarLoop]: Abstraction has 30389 states and 39315 transitions. [2025-04-26 16:53:37,665 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:37,665 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30389 states and 39315 transitions. [2025-04-26 16:53:37,741 INFO L131 ngComponentsAnalysis]: Automaton has 221 accepting balls. 13011 [2025-04-26 16:53:37,741 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:37,741 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:37,741 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:37,742 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:37,742 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" [2025-04-26 16:53:37,742 INFO L754 eck$LassoCheckResult]: Loop: "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[126] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork1_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[127] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[128] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork1_x#1_7| |v_sumThread1of1ForFork1_log_msg#1_7|) InVars {sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[129] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork1_log_msg#1_9|))) InVars {sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[130] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" [2025-04-26 16:53:37,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1540313023, now seen corresponding path program 1 times [2025-04-26 16:53:37,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594716415] [2025-04-26 16:53:37,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:37,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:37,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:37,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:37,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:37,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:37,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,758 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:37,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1842359836, now seen corresponding path program 2 times [2025-04-26 16:53:37,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900432570] [2025-04-26 16:53:37,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:37,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,763 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:37,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:37,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,768 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:37,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:37,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:37,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,777 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:37,777 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,777 INFO L85 PathProgramCache]: Analyzing trace with hash 264357340, now seen corresponding path program 1 times [2025-04-26 16:53:37,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832556168] [2025-04-26 16:53:37,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:37,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:37,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:37,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:37,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:37,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:37,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,809 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:37,905 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:37,905 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:37,905 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:37,905 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:37,905 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:37,905 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:37,905 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:37,905 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:37,905 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:37,905 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:37,905 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:37,906 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,912 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,914 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,939 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,941 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:37,944 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:38,045 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:38,045 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:38,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:38,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,061 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,065 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,073 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:38,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,085 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:38,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,086 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,086 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:38,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:38,087 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,093 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:38,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,108 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,108 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,111 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,115 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,124 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:38,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,137 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,137 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,137 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,142 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:53:38,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,156 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:38,159 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,169 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:38,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,170 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:38,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:38,172 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:38,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:38,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:38,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:38,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:38,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:38,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:38,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:38,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:38,202 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:38,211 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:38,211 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:38,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:38,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:38,215 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:38,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:38,217 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:38,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:38,235 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:38,235 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:38,235 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:38,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:38,245 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:38,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:38,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:38,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:38,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:38,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:38,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:38,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:38,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:38,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:38,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:38,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:38,354 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:38,354 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30389 states and 39315 transitions. cyclomatic complexity: 9209 Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,795 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30389 states and 39315 transitions. cyclomatic complexity: 9209. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 60879 states and 81169 transitions. Complement of second has 6 states. [2025-04-26 16:53:38,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:38,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:38,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2025-04-26 16:53:38,797 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 10 letters. Loop has 9 letters. [2025-04-26 16:53:38,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 19 letters. Loop has 9 letters. [2025-04-26 16:53:38,798 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,798 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 111 transitions. Stem has 10 letters. Loop has 18 letters. [2025-04-26 16:53:38,799 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:38,799 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60879 states and 81169 transitions. [2025-04-26 16:53:39,140 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 10377 [2025-04-26 16:53:39,391 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60879 states to 49863 states and 66706 transitions. [2025-04-26 16:53:39,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16945 [2025-04-26 16:53:39,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17308 [2025-04-26 16:53:39,409 INFO L74 IsDeterministic]: Start isDeterministic. Operand 49863 states and 66706 transitions. [2025-04-26 16:53:39,409 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:39,409 INFO L218 hiAutomatonCegarLoop]: Abstraction has 49863 states and 66706 transitions. [2025-04-26 16:53:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49863 states and 66706 transitions. [2025-04-26 16:53:40,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49863 to 49499. [2025-04-26 16:53:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49499 states, 49499 states have (on average 1.315784157255702) internal successors, (in total 65130), 49498 states have internal predecessors, (65130), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49499 states to 49499 states and 65130 transitions. [2025-04-26 16:53:40,244 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49499 states and 65130 transitions. [2025-04-26 16:53:40,244 INFO L438 stractBuchiCegarLoop]: Abstraction has 49499 states and 65130 transitions. [2025-04-26 16:53:40,244 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:40,244 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49499 states and 65130 transitions. [2025-04-26 16:53:40,375 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 10377 [2025-04-26 16:53:40,375 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:40,375 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:40,376 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,376 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,376 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[81] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[83] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[120] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[122] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[152] 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]" "[131] $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]" "[132] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 16:53:40,376 INFO L754 eck$LassoCheckResult]: Loop: "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[139] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[140] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[141] 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]" "[142] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[143] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 16:53:40,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -681439147, now seen corresponding path program 1 times [2025-04-26 16:53:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,377 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963506216] [2025-04-26 16:53:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:40,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:40,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:40,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:40,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,384 INFO L85 PathProgramCache]: Analyzing trace with hash 39217065, now seen corresponding path program 1 times [2025-04-26 16:53:40,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417895117] [2025-04-26 16:53:40,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:40,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:40,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,399 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:40,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:40,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,406 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,406 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,407 INFO L85 PathProgramCache]: Analyzing trace with hash 408909269, now seen corresponding path program 1 times [2025-04-26 16:53:40,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,407 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348732056] [2025-04-26 16:53:40,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:53:40,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:53:40,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:40,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348732056] [2025-04-26 16:53:40,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348732056] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:40,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:40,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:40,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388425268] [2025-04-26 16:53:40,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:40,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:40,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:40,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:40,507 INFO L87 Difference]: Start difference. First operand 49499 states and 65130 transitions. cyclomatic complexity: 16119 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (in total 22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:40,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:40,973 INFO L93 Difference]: Finished difference Result 50127 states and 65871 transitions. [2025-04-26 16:53:40,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50127 states and 65871 transitions. [2025-04-26 16:53:41,180 INFO L131 ngComponentsAnalysis]: Automaton has 313 accepting balls. 10876 [2025-04-26 16:53:41,487 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50127 states to 50127 states and 65871 transitions. [2025-04-26 16:53:41,488 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17570 [2025-04-26 16:53:41,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17570 [2025-04-26 16:53:41,504 INFO L74 IsDeterministic]: Start isDeterministic. Operand 50127 states and 65871 transitions. [2025-04-26 16:53:41,504 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:41,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50127 states and 65871 transitions. [2025-04-26 16:53:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50127 states and 65871 transitions. [2025-04-26 16:53:42,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50127 to 49505. [2025-04-26 16:53:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49505 states, 49505 states have (on average 1.3157458842541156) internal successors, (in total 65136), 49504 states have internal predecessors, (65136), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49505 states to 49505 states and 65136 transitions. [2025-04-26 16:53:42,273 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49505 states and 65136 transitions. [2025-04-26 16:53:42,273 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:42,276 INFO L438 stractBuchiCegarLoop]: Abstraction has 49505 states and 65136 transitions. [2025-04-26 16:53:42,276 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:42,276 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49505 states and 65136 transitions. [2025-04-26 16:53:42,443 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 10377 [2025-04-26 16:53:42,443 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:42,443 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:42,444 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,444 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,444 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[120] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[122] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[152] 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]" "[131] $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]" "[132] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 16:53:42,445 INFO L754 eck$LassoCheckResult]: Loop: "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[139] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[140] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[141] 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]" "[142] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[143] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 16:53:42,445 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1149048086, now seen corresponding path program 1 times [2025-04-26 16:53:42,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570497390] [2025-04-26 16:53:42,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:42,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:42,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:42,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:42,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570497390] [2025-04-26 16:53:42,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570497390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:42,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:42,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:42,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32149374] [2025-04-26 16:53:42,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:42,501 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:42,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,502 INFO L85 PathProgramCache]: Analyzing trace with hash 39217065, now seen corresponding path program 2 times [2025-04-26 16:53:42,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287484565] [2025-04-26 16:53:42,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:42,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,505 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:42,508 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:42,508 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:42,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:42,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:42,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:42,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,512 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:42,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:42,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:42,563 INFO L87 Difference]: Start difference. First operand 49505 states and 65136 transitions. cyclomatic complexity: 16119 Second operand has 5 states, 5 states have (on average 3.0) internal successors, (in total 15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:42,995 INFO L93 Difference]: Finished difference Result 50125 states and 65864 transitions. [2025-04-26 16:53:42,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50125 states and 65864 transitions. [2025-04-26 16:53:43,202 INFO L131 ngComponentsAnalysis]: Automaton has 313 accepting balls. 10876 [2025-04-26 16:53:43,412 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50125 states to 50125 states and 65864 transitions. [2025-04-26 16:53:43,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17570 [2025-04-26 16:53:43,430 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17570 [2025-04-26 16:53:43,430 INFO L74 IsDeterministic]: Start isDeterministic. Operand 50125 states and 65864 transitions. [2025-04-26 16:53:43,430 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:43,430 INFO L218 hiAutomatonCegarLoop]: Abstraction has 50125 states and 65864 transitions. [2025-04-26 16:53:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50125 states and 65864 transitions. [2025-04-26 16:53:44,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50125 to 49503. [2025-04-26 16:53:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49503 states, 49503 states have (on average 1.3156576369108943) internal successors, (in total 65129), 49502 states have internal predecessors, (65129), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:44,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49503 states to 49503 states and 65129 transitions. [2025-04-26 16:53:44,289 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49503 states and 65129 transitions. [2025-04-26 16:53:44,290 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:44,290 INFO L438 stractBuchiCegarLoop]: Abstraction has 49503 states and 65129 transitions. [2025-04-26 16:53:44,290 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:44,290 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49503 states and 65129 transitions. [2025-04-26 16:53:44,417 INFO L131 ngComponentsAnalysis]: Automaton has 277 accepting balls. 10377 [2025-04-26 16:53:44,417 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:44,417 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:44,418 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:44,418 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:44,418 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork2_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork2_i#1]" [2025-04-26 16:53:44,418 INFO L754 eck$LassoCheckResult]: Loop: "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[139] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork2_log_msg#1_3|) v_stdout_5)) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[140] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[141] 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]" "[142] L25-2-->L25-3: Formula: (and (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11) (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork2_log_msg#1_9|))) InVars {sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[143] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" [2025-04-26 16:53:44,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1318734485, now seen corresponding path program 1 times [2025-04-26 16:53:44,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51284086] [2025-04-26 16:53:44,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:44,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:44,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:44,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:44,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,433 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,433 INFO L85 PathProgramCache]: Analyzing trace with hash 39217065, now seen corresponding path program 3 times [2025-04-26 16:53:44,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237274857] [2025-04-26 16:53:44,433 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,437 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:44,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:44,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:44,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,442 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:44,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:44,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,445 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash -165362795, now seen corresponding path program 1 times [2025-04-26 16:53:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089720195] [2025-04-26 16:53:44,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:44,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:44,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,454 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:44,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:44,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,466 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,627 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:44,627 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:44,627 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:44,627 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:44,627 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:44,627 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,627 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:44,627 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:44,627 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:53:44,627 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:44,627 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:44,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,638 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,665 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,667 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,669 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,671 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,673 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,675 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,677 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,800 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:44,801 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:44,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,803 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:44,804 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,818 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,818 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,820 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:44,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,828 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:44,830 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,843 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,845 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,853 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:44,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,871 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,879 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:44,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,890 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,890 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,890 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,890 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,891 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,891 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,895 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,900 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:44,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,902 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:44,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,914 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,914 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,914 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,914 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,916 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,916 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,920 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:44,924 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:53:44,924 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:44,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,925 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:53:44,927 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:44,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 16:53:44,942 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:44,942 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:44,942 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork2_i#1) = 1*N - 1*sumThread1of1ForFork2_i#1 Supporting invariants [] [2025-04-26 16:53:44,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 16:53:44,949 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:44,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:44,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:44,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:44,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:44,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:44,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:44,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:44,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:44,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:44,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:45,033 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:45,033 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49503 states and 65129 transitions. cyclomatic complexity: 16114 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:45,588 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49503 states and 65129 transitions. cyclomatic complexity: 16114. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 111091 states and 150318 transitions. Complement of second has 6 states. [2025-04-26 16:53:45,589 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:45,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:45,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-26 16:53:45,589 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 17 letters. Loop has 9 letters. [2025-04-26 16:53:45,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,590 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 26 letters. Loop has 9 letters. [2025-04-26 16:53:45,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,590 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 17 letters. Loop has 18 letters. [2025-04-26 16:53:45,590 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111091 states and 150318 transitions. [2025-04-26 16:53:46,330 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 7704 [2025-04-26 16:53:46,721 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111091 states to 89034 states and 120753 transitions. [2025-04-26 16:53:46,721 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16174 [2025-04-26 16:53:46,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16534 [2025-04-26 16:53:46,736 INFO L74 IsDeterministic]: Start isDeterministic. Operand 89034 states and 120753 transitions. [2025-04-26 16:53:46,736 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:46,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 89034 states and 120753 transitions. [2025-04-26 16:53:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89034 states and 120753 transitions. [2025-04-26 16:53:47,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89034 to 88439. [2025-04-26 16:53:47,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88439 states, 88439 states have (on average 1.3352141023756487) internal successors, (in total 118085), 88438 states have internal predecessors, (118085), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:47,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88439 states to 88439 states and 118085 transitions. [2025-04-26 16:53:47,893 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88439 states and 118085 transitions. [2025-04-26 16:53:47,893 INFO L438 stractBuchiCegarLoop]: Abstraction has 88439 states and 118085 transitions. [2025-04-26 16:53:47,893 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:47,894 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88439 states and 118085 transitions. [2025-04-26 16:53:48,374 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 7704 [2025-04-26 16:53:48,374 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:48,374 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:48,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:48,375 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:48,375 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[81] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[83] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[120] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[122] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[152] 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]" "[131] $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]" "[132] 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]" "[133] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork2_i#1_3|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[135] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" [2025-04-26 16:53:48,376 INFO L754 eck$LassoCheckResult]: Loop: "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[100] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork3_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[101] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[102] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork3_x#1_7| |v_sumThread1of1ForFork3_log_msg#1_7|) InVars {sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[103] L25-2-->L25-3: Formula: (and (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork3_log_msg#1_9|)) (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11)) InVars {stdout=v_stdout_10, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[104] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" [2025-04-26 16:53:48,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:48,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1543881285, now seen corresponding path program 1 times [2025-04-26 16:53:48,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:48,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200893687] [2025-04-26 16:53:48,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:48,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:48,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:48,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:48,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:48,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:48,380 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:48,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:48,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:48,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:48,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:48,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1153678082, now seen corresponding path program 1 times [2025-04-26 16:53:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:48,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194713806] [2025-04-26 16:53:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:48,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:48,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:48,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:48,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:48,388 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:48,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:48,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:48,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:48,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:48,399 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:48,400 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:48,400 INFO L85 PathProgramCache]: Analyzing trace with hash 697976126, now seen corresponding path program 1 times [2025-04-26 16:53:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:48,400 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602777652] [2025-04-26 16:53:48,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:48,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:48,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:48,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:48,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:48,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:48,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:48,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:48,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602777652] [2025-04-26 16:53:48,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602777652] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:48,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:48,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:48,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359856474] [2025-04-26 16:53:48,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:48,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:48,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:48,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:48,475 INFO L87 Difference]: Start difference. First operand 88439 states and 118085 transitions. cyclomatic complexity: 30545 Second operand has 5 states, 5 states have (on average 5.4) internal successors, (in total 27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:49,155 INFO L93 Difference]: Finished difference Result 88669 states and 118347 transitions. [2025-04-26 16:53:49,155 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88669 states and 118347 transitions. [2025-04-26 16:53:49,524 INFO L131 ngComponentsAnalysis]: Automaton has 350 accepting balls. 7898 [2025-04-26 16:53:50,036 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88669 states to 88669 states and 118347 transitions. [2025-04-26 16:53:50,036 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16401 [2025-04-26 16:53:50,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16401 [2025-04-26 16:53:50,055 INFO L74 IsDeterministic]: Start isDeterministic. Operand 88669 states and 118347 transitions. [2025-04-26 16:53:50,055 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:50,055 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88669 states and 118347 transitions. [2025-04-26 16:53:50,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88669 states and 118347 transitions. [2025-04-26 16:53:50,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88669 to 88445. [2025-04-26 16:53:50,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88445 states, 88445 states have (on average 1.335191361863305) internal successors, (in total 118091), 88444 states have internal predecessors, (118091), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:51,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88445 states to 88445 states and 118091 transitions. [2025-04-26 16:53:51,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88445 states and 118091 transitions. [2025-04-26 16:53:51,091 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:51,092 INFO L438 stractBuchiCegarLoop]: Abstraction has 88445 states and 118091 transitions. [2025-04-26 16:53:51,092 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:53:51,092 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88445 states and 118091 transitions. [2025-04-26 16:53:51,608 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 7704 [2025-04-26 16:53:51,609 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:51,609 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:51,609 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:51,609 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:51,610 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[133] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork2_i#1_3|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[135] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" [2025-04-26 16:53:51,610 INFO L754 eck$LassoCheckResult]: Loop: "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[100] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork3_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[101] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[102] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork3_x#1_7| |v_sumThread1of1ForFork3_log_msg#1_7|) InVars {sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[103] L25-2-->L25-3: Formula: (and (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork3_log_msg#1_9|)) (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11)) InVars {stdout=v_stdout_10, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[104] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" [2025-04-26 16:53:51,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,610 INFO L85 PathProgramCache]: Analyzing trace with hash 236449797, now seen corresponding path program 1 times [2025-04-26 16:53:51,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907060914] [2025-04-26 16:53:51,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:51,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:53:51,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:53:51,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:51,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:51,652 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907060914] [2025-04-26 16:53:51,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907060914] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:51,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:51,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:51,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581522045] [2025-04-26 16:53:51,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:51,653 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:51,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:51,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1153678082, now seen corresponding path program 2 times [2025-04-26 16:53:51,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:51,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298843699] [2025-04-26 16:53:51,653 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:51,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:51,655 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:51,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:51,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:51,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,657 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:51,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:51,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:51,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:51,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:51,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:51,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:51,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:51,694 INFO L87 Difference]: Start difference. First operand 88445 states and 118091 transitions. cyclomatic complexity: 30545 Second operand has 5 states, 5 states have (on average 4.4) internal successors, (in total 22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:52,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:52,139 INFO L93 Difference]: Finished difference Result 88667 states and 118320 transitions. [2025-04-26 16:53:52,139 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88667 states and 118320 transitions. [2025-04-26 16:53:52,773 INFO L131 ngComponentsAnalysis]: Automaton has 350 accepting balls. 7898 [2025-04-26 16:53:53,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88667 states to 88667 states and 118320 transitions. [2025-04-26 16:53:53,074 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16401 [2025-04-26 16:53:53,087 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16401 [2025-04-26 16:53:53,087 INFO L74 IsDeterministic]: Start isDeterministic. Operand 88667 states and 118320 transitions. [2025-04-26 16:53:53,087 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:53,087 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88667 states and 118320 transitions. [2025-04-26 16:53:53,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88667 states and 118320 transitions. [2025-04-26 16:53:54,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88667 to 88429. [2025-04-26 16:53:54,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88429 states, 88429 states have (on average 1.3349692974024359) internal successors, (in total 118050), 88428 states have internal predecessors, (118050), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:54,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88429 states to 88429 states and 118050 transitions. [2025-04-26 16:53:54,309 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88429 states and 118050 transitions. [2025-04-26 16:53:54,310 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:54,310 INFO L438 stractBuchiCegarLoop]: Abstraction has 88429 states and 118050 transitions. [2025-04-26 16:53:54,310 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:53:54,310 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88429 states and 118050 transitions. [2025-04-26 16:53:54,752 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 7704 [2025-04-26 16:53:54,753 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:54,753 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:54,753 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:54,753 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:54,754 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[81] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[83] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[120] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[122] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[152] 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]" "[131] $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]" "[132] 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]" "[133] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork2_i#1_3|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[135] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[94] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork3_i#1_3|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[96] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" [2025-04-26 16:53:54,754 INFO L754 eck$LassoCheckResult]: Loop: "[108] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork4_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} AuxVars[] AssignedVars[]" "[110] L40-->L41: Formula: (= |v_sumThread1of1ForFork4_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork4_i#1_7|) |v_sumThread1of1ForFork4_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_3|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_4|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[111] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork4_i#1_9| 1) |v_sumThread1of1ForFork4_i#1_10|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_9|} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[112] L44-->L25: Formula: (= |v_sumThread1of1ForFork4_log_msg#1_1| |v_sumThread1of1ForFork4_i#1_13|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_1|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[113] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork4_log_msg#1_3|))) InVars {stdout=v_stdout_6, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[114] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[115] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork4_x#1_7| |v_sumThread1of1ForFork4_log_msg#1_7|) InVars {sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[116] 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_sumThread1of1ForFork4_log_msg#1_9|))) InVars {stdout=v_stdout_10, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[117] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" [2025-04-26 16:53:54,755 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,755 INFO L85 PathProgramCache]: Analyzing trace with hash -430144488, now seen corresponding path program 1 times [2025-04-26 16:53:54,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,755 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152171287] [2025-04-26 16:53:54,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:54,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:54,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,763 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:54,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:54,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,770 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,771 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -649464689, now seen corresponding path program 1 times [2025-04-26 16:53:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,771 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149677861] [2025-04-26 16:53:54,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:54,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:54,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,776 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:54,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:54,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:54,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:54,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:54,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:54,781 INFO L85 PathProgramCache]: Analyzing trace with hash 727390808, now seen corresponding path program 1 times [2025-04-26 16:53:54,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:54,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147623219] [2025-04-26 16:53:54,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:54,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:54,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:53:54,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:53:54,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:54,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:54,830 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147623219] [2025-04-26 16:53:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147623219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:54,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736100230] [2025-04-26 16:53:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:54,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:54,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:54,864 INFO L87 Difference]: Start difference. First operand 88429 states and 118050 transitions. cyclomatic complexity: 30520 Second operand has 5 states, 5 states have (on average 6.4) internal successors, (in total 32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:55,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:55,333 INFO L93 Difference]: Finished difference Result 88494 states and 118120 transitions. [2025-04-26 16:53:55,333 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88494 states and 118120 transitions. [2025-04-26 16:53:55,966 INFO L131 ngComponentsAnalysis]: Automaton has 337 accepting balls. 7758 [2025-04-26 16:53:56,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88494 states to 88494 states and 118120 transitions. [2025-04-26 16:53:56,304 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16242 [2025-04-26 16:53:56,322 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16242 [2025-04-26 16:53:56,323 INFO L74 IsDeterministic]: Start isDeterministic. Operand 88494 states and 118120 transitions. [2025-04-26 16:53:56,323 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:56,323 INFO L218 hiAutomatonCegarLoop]: Abstraction has 88494 states and 118120 transitions. [2025-04-26 16:53:56,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88494 states and 118120 transitions. [2025-04-26 16:53:57,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88494 to 88434. [2025-04-26 16:53:57,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88434 states, 88434 states have (on average 1.334950358459416) internal successors, (in total 118055), 88433 states have internal predecessors, (118055), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88434 states to 88434 states and 118055 transitions. [2025-04-26 16:53:57,655 INFO L240 hiAutomatonCegarLoop]: Abstraction has 88434 states and 118055 transitions. [2025-04-26 16:53:57,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:57,655 INFO L438 stractBuchiCegarLoop]: Abstraction has 88434 states and 118055 transitions. [2025-04-26 16:53:57,655 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:53:57,656 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88434 states and 118055 transitions. [2025-04-26 16:53:57,883 INFO L131 ngComponentsAnalysis]: Automaton has 331 accepting balls. 7704 [2025-04-26 16:53:57,883 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:57,883 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:57,883 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:57,883 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:57,884 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" [2025-04-26 16:53:57,884 INFO L754 eck$LassoCheckResult]: Loop: "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[100] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork3_log_msg#1_3|) v_stdout_5)) InVars {stdout=v_stdout_6, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[101] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[102] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork3_x#1_7| |v_sumThread1of1ForFork3_log_msg#1_7|) InVars {sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_7|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[103] L25-2-->L25-3: Formula: (and (= v_stdout_9 (store v_stdout_10 v_stdout_ptr_12 |v_sumThread1of1ForFork3_log_msg#1_9|)) (= (+ v_stdout_ptr_12 1) v_stdout_ptr_11)) InVars {stdout=v_stdout_10, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[104] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" [2025-04-26 16:53:57,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,884 INFO L85 PathProgramCache]: Analyzing trace with hash 495930596, now seen corresponding path program 1 times [2025-04-26 16:53:57,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,885 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299251217] [2025-04-26 16:53:57,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:57,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:57,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,890 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:57,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:57,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1153678082, now seen corresponding path program 3 times [2025-04-26 16:53:57,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,905 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109953007] [2025-04-26 16:53:57,905 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:57,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:57,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:57,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,918 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:57,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:57,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,925 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:57,925 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:57,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1657355647, now seen corresponding path program 1 times [2025-04-26 16:53:57,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:57,925 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264676203] [2025-04-26 16:53:57,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:57,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:57,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:53:57,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:53:57,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,935 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:57,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:53:57,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:53:57,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:57,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:57,949 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:58,173 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:58,173 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:58,173 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:58,173 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:58,173 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:58,173 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,173 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:58,173 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:58,173 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:53:58,173 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:58,173 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:58,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,178 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,200 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,203 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,211 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,212 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,219 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,221 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,223 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,225 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,227 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:58,362 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:58,362 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:58,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,368 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:58,371 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,382 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,382 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,382 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,385 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,391 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:53:58,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,393 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:58,396 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,406 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:58,406 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,406 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,406 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,407 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:58,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:58,408 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:58,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,416 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:53:58,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:58,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:58,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:58,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:58,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:58,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:58,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:58,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:58,444 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:53:58,445 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:58,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:58,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:58,446 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:58,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:53:58,449 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:58,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:58,465 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:58,465 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:58,465 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork3_i#1, N) = -1*sumThread1of1ForFork3_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:58,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2025-04-26 16:53:58,472 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:58,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:58,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:58,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:58,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:58,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:58,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:58,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:58,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:58,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:58,567 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:58,567 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 88434 states and 118055 transitions. cyclomatic complexity: 30520 Second operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,821 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 88434 states and 118055 transitions. cyclomatic complexity: 30520. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 205667 states and 280546 transitions. Complement of second has 6 states. [2025-04-26 16:53:59,821 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:59,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2025-04-26 16:53:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 24 letters. Loop has 9 letters. [2025-04-26 16:53:59,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 33 letters. Loop has 9 letters. [2025-04-26 16:53:59,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,822 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 134 transitions. Stem has 24 letters. Loop has 18 letters. [2025-04-26 16:53:59,822 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:59,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 205667 states and 280546 transitions. [2025-04-26 16:54:01,049 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:01,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 205667 states to 159012 states and 217128 transitions. [2025-04-26 16:54:01,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15384 [2025-04-26 16:54:01,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15736 [2025-04-26 16:54:01,987 INFO L74 IsDeterministic]: Start isDeterministic. Operand 159012 states and 217128 transitions. [2025-04-26 16:54:01,987 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:01,987 INFO L218 hiAutomatonCegarLoop]: Abstraction has 159012 states and 217128 transitions. [2025-04-26 16:54:02,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159012 states and 217128 transitions. [2025-04-26 16:54:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159012 to 158085. [2025-04-26 16:54:03,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158085 states, 158085 states have (on average 1.3461808520732517) internal successors, (in total 212811), 158084 states have internal predecessors, (212811), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158085 states to 158085 states and 212811 transitions. [2025-04-26 16:54:04,170 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158085 states and 212811 transitions. [2025-04-26 16:54:04,170 INFO L438 stractBuchiCegarLoop]: Abstraction has 158085 states and 212811 transitions. [2025-04-26 16:54:04,170 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:54:04,171 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158085 states and 212811 transitions. [2025-04-26 16:54:04,920 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:04,920 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:04,920 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:04,921 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:04,921 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:04,921 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[81] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork0_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_3|} AuxVars[] AssignedVars[]" "[83] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[120] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork1_i#1_3|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[122] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[152] 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]" "[131] $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]" "[132] 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]" "[133] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork2_i#1_3|) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[135] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[94] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork3_i#1_3|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[96] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[107] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork4_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_3|} AuxVars[] AssignedVars[]" "[109] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[161] L58-->$Ultimate##0: Formula: (and (= 6 v_sumThread1of1ForFork5_thidvar3_2) (= 6 v_sumThread1of1ForFork5_thidvar1_2) (= 6 v_sumThread1of1ForFork5_thidvar4_2) (= 6 v_sumThread1of1ForFork5_thidvar5_2) (= 6 v_sumThread1of1ForFork5_thidvar0_2) (= 6 v_sumThread1of1ForFork5_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork5_thidvar4=v_sumThread1of1ForFork5_thidvar4_2, sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_14|, sumThread1of1ForFork5_thidvar3=v_sumThread1of1ForFork5_thidvar3_2, sumThread1of1ForFork5_thidvar5=v_sumThread1of1ForFork5_thidvar5_2, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_16|, sumThread1of1ForFork5_thidvar0=v_sumThread1of1ForFork5_thidvar0_2, sumThread1of1ForFork5_thidvar2=v_sumThread1of1ForFork5_thidvar2_2, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_10|, sumThread1of1ForFork5_thidvar1=v_sumThread1of1ForFork5_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork5_thidvar4, sumThread1of1ForFork5_log_msg#1, sumThread1of1ForFork5_thidvar3, sumThread1of1ForFork5_thidvar5, sumThread1of1ForFork5_i#1, sumThread1of1ForFork5_thidvar0, sumThread1of1ForFork5_thidvar2, sumThread1of1ForFork5_x#1, sumThread1of1ForFork5_thidvar1]" "[66] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork5_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[67] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork5_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" [2025-04-26 16:54:04,921 INFO L754 eck$LassoCheckResult]: Loop: "[69] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork5_i#1_5| v_N_2) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L40-->L41: Formula: (= (+ |v_sumThread1of1ForFork5_x#1_3| (select v_A_1 |v_sumThread1of1ForFork5_i#1_7|)) |v_sumThread1of1ForFork5_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[72] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork5_i#1_9| 1) |v_sumThread1of1ForFork5_i#1_10|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_9|} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" "[73] L44-->L25: Formula: (= |v_sumThread1of1ForFork5_i#1_13| |v_sumThread1of1ForFork5_log_msg#1_1|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_1|, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[74] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork5_log_msg#1_3|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[75] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[76] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork5_x#1_7| |v_sumThread1of1ForFork5_log_msg#1_7|) InVars {sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[77] 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_sumThread1of1ForFork5_log_msg#1_9|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[78] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" [2025-04-26 16:54:04,921 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash 568463080, now seen corresponding path program 1 times [2025-04-26 16:54:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082488119] [2025-04-26 16:54:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:54:04,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:54:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,926 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-26 16:54:04,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-26 16:54:04,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,930 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,930 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,930 INFO L85 PathProgramCache]: Analyzing trace with hash 464996328, now seen corresponding path program 1 times [2025-04-26 16:54:04,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,930 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702528417] [2025-04-26 16:54:04,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:04,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:04,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,933 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:04,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:04,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:04,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:04,935 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1787432161, now seen corresponding path program 1 times [2025-04-26 16:54:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:04,935 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337218058] [2025-04-26 16:54:04,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:04,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-26 16:54:04,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-26 16:54:04,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:04,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:05,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:05,001 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337218058] [2025-04-26 16:54:05,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337218058] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:05,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:05,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:54:05,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668513751] [2025-04-26 16:54:05,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:05,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:05,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:05,034 INFO L87 Difference]: Start difference. First operand 158085 states and 212811 transitions. cyclomatic complexity: 56369 Second operand has 5 states, 5 states have (on average 7.4) internal successors, (in total 37), 5 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:05,923 INFO L93 Difference]: Finished difference Result 158092 states and 212817 transitions. [2025-04-26 16:54:05,924 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158092 states and 212817 transitions. [2025-04-26 16:54:07,170 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:07,879 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158092 states to 158067 states and 212792 transitions. [2025-04-26 16:54:07,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15365 [2025-04-26 16:54:07,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15365 [2025-04-26 16:54:07,893 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158067 states and 212792 transitions. [2025-04-26 16:54:07,894 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:07,894 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158067 states and 212792 transitions. [2025-04-26 16:54:08,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158067 states and 212792 transitions. [2025-04-26 16:54:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158067 to 158065. [2025-04-26 16:54:09,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158065 states, 158065 states have (on average 1.346218327903078) internal successors, (in total 212790), 158064 states have internal predecessors, (212790), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:10,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158065 states to 158065 states and 212790 transitions. [2025-04-26 16:54:10,124 INFO L240 hiAutomatonCegarLoop]: Abstraction has 158065 states and 212790 transitions. [2025-04-26 16:54:10,125 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:54:10,126 INFO L438 stractBuchiCegarLoop]: Abstraction has 158065 states and 212790 transitions. [2025-04-26 16:54:10,126 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:54:10,126 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 158065 states and 212790 transitions. [2025-04-26 16:54:10,751 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:10,752 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:10,752 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:10,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:10,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:10,753 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[94] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork3_i#1_3|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_3|, N=v_N_1} AuxVars[] AssignedVars[]" "[96] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" [2025-04-26 16:54:10,753 INFO L754 eck$LassoCheckResult]: Loop: "[108] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork4_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} AuxVars[] AssignedVars[]" "[110] L40-->L41: Formula: (= |v_sumThread1of1ForFork4_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork4_i#1_7|) |v_sumThread1of1ForFork4_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_3|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_4|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[111] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork4_i#1_9| 1) |v_sumThread1of1ForFork4_i#1_10|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_9|} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[112] L44-->L25: Formula: (= |v_sumThread1of1ForFork4_log_msg#1_1| |v_sumThread1of1ForFork4_i#1_13|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_1|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[113] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork4_log_msg#1_3|))) InVars {stdout=v_stdout_6, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[114] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[115] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork4_x#1_7| |v_sumThread1of1ForFork4_log_msg#1_7|) InVars {sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[116] 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_sumThread1of1ForFork4_log_msg#1_9|))) InVars {stdout=v_stdout_10, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[117] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" [2025-04-26 16:54:10,753 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:10,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1049347289, now seen corresponding path program 1 times [2025-04-26 16:54:10,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:10,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596734347] [2025-04-26 16:54:10,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:10,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:10,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:54:10,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:54:10,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:10,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:10,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:10,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:10,781 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596734347] [2025-04-26 16:54:10,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596734347] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:10,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:10,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:54:10,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785576222] [2025-04-26 16:54:10,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:10,781 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:10,781 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:10,781 INFO L85 PathProgramCache]: Analyzing trace with hash -649464689, now seen corresponding path program 2 times [2025-04-26 16:54:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:10,781 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694120044] [2025-04-26 16:54:10,781 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:10,783 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:10,784 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:10,784 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:10,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:10,784 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:10,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:10,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:10,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:10,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:10,787 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:10,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:10,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:10,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:10,816 INFO L87 Difference]: Start difference. First operand 158065 states and 212790 transitions. cyclomatic complexity: 56368 Second operand has 5 states, 5 states have (on average 5.8) internal successors, (in total 29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:11,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:11,514 INFO L93 Difference]: Finished difference Result 158065 states and 212653 transitions. [2025-04-26 16:54:11,514 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 158065 states and 212653 transitions. [2025-04-26 16:54:12,560 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:13,358 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 158065 states to 158065 states and 212653 transitions. [2025-04-26 16:54:13,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15365 [2025-04-26 16:54:13,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15365 [2025-04-26 16:54:13,374 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158065 states and 212653 transitions. [2025-04-26 16:54:13,374 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:13,374 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158065 states and 212653 transitions. [2025-04-26 16:54:13,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158065 states and 212653 transitions. [2025-04-26 16:54:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158065 to 157955. [2025-04-26 16:54:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157955 states, 157955 states have (on average 1.3455920990155423) internal successors, (in total 212543), 157954 states have internal predecessors, (212543), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:15,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157955 states to 157955 states and 212543 transitions. [2025-04-26 16:54:15,640 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157955 states and 212543 transitions. [2025-04-26 16:54:15,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:15,641 INFO L438 stractBuchiCegarLoop]: Abstraction has 157955 states and 212543 transitions. [2025-04-26 16:54:15,641 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:54:15,641 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157955 states and 212543 transitions. [2025-04-26 16:54:16,254 INFO L131 ngComponentsAnalysis]: Automaton has 347 accepting balls. 4986 [2025-04-26 16:54:16,255 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:16,255 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:16,255 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,255 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:16,256 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" [2025-04-26 16:54:16,256 INFO L754 eck$LassoCheckResult]: Loop: "[108] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork4_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} AuxVars[] AssignedVars[]" "[110] L40-->L41: Formula: (= |v_sumThread1of1ForFork4_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork4_i#1_7|) |v_sumThread1of1ForFork4_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_3|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_4|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[111] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork4_i#1_9| 1) |v_sumThread1of1ForFork4_i#1_10|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_9|} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[112] L44-->L25: Formula: (= |v_sumThread1of1ForFork4_log_msg#1_1| |v_sumThread1of1ForFork4_i#1_13|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_1|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[113] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork4_log_msg#1_3|))) InVars {stdout=v_stdout_6, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_8} OutVars{stdout=v_stdout_5, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_3|, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[114] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[115] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork4_x#1_7| |v_sumThread1of1ForFork4_log_msg#1_7|) InVars {sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_7|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[116] 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_sumThread1of1ForFork4_log_msg#1_9|))) InVars {stdout=v_stdout_10, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_12} OutVars{stdout=v_stdout_9, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_9|, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[117] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" [2025-04-26 16:54:16,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,256 INFO L85 PathProgramCache]: Analyzing trace with hash -33973672, now seen corresponding path program 1 times [2025-04-26 16:54:16,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905540057] [2025-04-26 16:54:16,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:54:16,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:54:16,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,261 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:54:16,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:54:16,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,265 INFO L85 PathProgramCache]: Analyzing trace with hash -649464689, now seen corresponding path program 3 times [2025-04-26 16:54:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,265 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615647319] [2025-04-26 16:54:16,265 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:16,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,268 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1233974248, now seen corresponding path program 1 times [2025-04-26 16:54:16,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:16,270 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953764713] [2025-04-26 16:54:16,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:16,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:16,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:54:16,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:54:16,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,275 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:16,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:54:16,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:54:16,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:16,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:16,550 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:16,550 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:16,550 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:16,550 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:16,550 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:16,550 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,550 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:16,551 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:16,551 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration13_Lasso [2025-04-26 16:54:16,551 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:16,551 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:16,552 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,555 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,558 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,579 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,580 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,582 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,586 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,588 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,591 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,592 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,594 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,601 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,606 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:16,754 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:16,755 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:16,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,757 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:54:16,760 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,770 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,771 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:54:16,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,778 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:54:16,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,793 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:54:16,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,800 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:54:16,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,811 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,816 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2025-04-26 16:54:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,823 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:54:16,826 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,835 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,835 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,838 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,845 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:54:16,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:16,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:16,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:16,859 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:16,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,865 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:54:16,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:16,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:54:16,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,891 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:54:16,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:16,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:16,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:16,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:16,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:16,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:16,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:16,907 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:16,913 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:16,913 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:54:16,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:16,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:16,914 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:16,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:54:16,916 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:16,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:54:16,931 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:16,931 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:16,932 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork4_i#1) = 1*N - 1*sumThread1of1ForFork4_i#1 Supporting invariants [] [2025-04-26 16:54:16,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:54:16,938 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:16,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:16,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:54:16,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:54:16,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:16,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:16,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:16,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:16,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:16,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:16,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:17,015 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:54:17,015 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 157955 states and 212543 transitions. cyclomatic complexity: 56231 Second operand has 4 states, 4 states have (on average 10.0) internal successors, (in total 40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:18,544 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 157955 states and 212543 transitions. cyclomatic complexity: 56231. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (in total 40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 357908 states and 490702 transitions. Complement of second has 6 states. [2025-04-26 16:54:18,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:18,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (in total 40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2025-04-26 16:54:18,545 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 31 letters. Loop has 9 letters. [2025-04-26 16:54:18,545 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,545 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 40 letters. Loop has 9 letters. [2025-04-26 16:54:18,545 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,545 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 142 transitions. Stem has 31 letters. Loop has 18 letters. [2025-04-26 16:54:18,545 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:18,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357908 states and 490702 transitions. [2025-04-26 16:54:21,022 INFO L131 ngComponentsAnalysis]: Automaton has 253 accepting balls. 2277 [2025-04-26 16:54:22,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357908 states to 243722 states and 333093 transitions. [2025-04-26 16:54:22,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13437 [2025-04-26 16:54:22,339 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13761 [2025-04-26 16:54:22,339 INFO L74 IsDeterministic]: Start isDeterministic. Operand 243722 states and 333093 transitions. [2025-04-26 16:54:22,339 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:22,339 INFO L218 hiAutomatonCegarLoop]: Abstraction has 243722 states and 333093 transitions. [2025-04-26 16:54:22,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243722 states and 333093 transitions. [2025-04-26 16:54:24,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243722 to 242516. [2025-04-26 16:54:25,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242516 states, 242516 states have (on average 1.3496511570370615) internal successors, (in total 327312), 242515 states have internal predecessors, (327312), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242516 states to 242516 states and 327312 transitions. [2025-04-26 16:54:26,050 INFO L240 hiAutomatonCegarLoop]: Abstraction has 242516 states and 327312 transitions. [2025-04-26 16:54:26,050 INFO L438 stractBuchiCegarLoop]: Abstraction has 242516 states and 327312 transitions. [2025-04-26 16:54:26,050 INFO L340 stractBuchiCegarLoop]: ======== Iteration 14 ============ [2025-04-26 16:54:26,050 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 242516 states and 327312 transitions. [2025-04-26 16:54:27,080 INFO L131 ngComponentsAnalysis]: Automaton has 253 accepting balls. 2277 [2025-04-26 16:54:27,080 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:27,080 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:27,081 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:27,081 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:27,081 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[107] L39-1-->sumFINAL: Formula: (<= v_N_1 |v_sumThread1of1ForFork4_i#1_3|) InVars {N=v_N_1, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_3|} OutVars{N=v_N_1, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_3|} AuxVars[] AssignedVars[]" "[109] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[161] L58-->$Ultimate##0: Formula: (and (= 6 v_sumThread1of1ForFork5_thidvar3_2) (= 6 v_sumThread1of1ForFork5_thidvar1_2) (= 6 v_sumThread1of1ForFork5_thidvar4_2) (= 6 v_sumThread1of1ForFork5_thidvar5_2) (= 6 v_sumThread1of1ForFork5_thidvar0_2) (= 6 v_sumThread1of1ForFork5_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork5_thidvar4=v_sumThread1of1ForFork5_thidvar4_2, sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_14|, sumThread1of1ForFork5_thidvar3=v_sumThread1of1ForFork5_thidvar3_2, sumThread1of1ForFork5_thidvar5=v_sumThread1of1ForFork5_thidvar5_2, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_16|, sumThread1of1ForFork5_thidvar0=v_sumThread1of1ForFork5_thidvar0_2, sumThread1of1ForFork5_thidvar2=v_sumThread1of1ForFork5_thidvar2_2, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_10|, sumThread1of1ForFork5_thidvar1=v_sumThread1of1ForFork5_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork5_thidvar4, sumThread1of1ForFork5_log_msg#1, sumThread1of1ForFork5_thidvar3, sumThread1of1ForFork5_thidvar5, sumThread1of1ForFork5_i#1, sumThread1of1ForFork5_thidvar0, sumThread1of1ForFork5_thidvar2, sumThread1of1ForFork5_x#1, sumThread1of1ForFork5_thidvar1]" "[66] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork5_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[67] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork5_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" [2025-04-26 16:54:27,081 INFO L754 eck$LassoCheckResult]: Loop: "[69] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork5_i#1_5| v_N_2) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L40-->L41: Formula: (= (+ |v_sumThread1of1ForFork5_x#1_3| (select v_A_1 |v_sumThread1of1ForFork5_i#1_7|)) |v_sumThread1of1ForFork5_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[72] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork5_i#1_9| 1) |v_sumThread1of1ForFork5_i#1_10|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_9|} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" "[73] L44-->L25: Formula: (= |v_sumThread1of1ForFork5_i#1_13| |v_sumThread1of1ForFork5_log_msg#1_1|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_1|, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[74] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork5_log_msg#1_3|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[75] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[76] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork5_x#1_7| |v_sumThread1of1ForFork5_log_msg#1_7|) InVars {sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[77] 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_sumThread1of1ForFork5_log_msg#1_9|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[78] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" [2025-04-26 16:54:27,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1010360488, now seen corresponding path program 1 times [2025-04-26 16:54:27,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:27,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579492014] [2025-04-26 16:54:27,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:27,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:27,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-26 16:54:27,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-26 16:54:27,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:27,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:54:27,115 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579492014] [2025-04-26 16:54:27,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579492014] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:54:27,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:54:27,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:54:27,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393891841] [2025-04-26 16:54:27,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:54:27,116 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:54:27,116 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:27,116 INFO L85 PathProgramCache]: Analyzing trace with hash 464996328, now seen corresponding path program 2 times [2025-04-26 16:54:27,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:27,116 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714342596] [2025-04-26 16:54:27,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:54:27,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:27,118 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:27,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:27,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:54:27,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,120 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:27,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:27,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:27,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:27,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:27,122 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:27,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:54:27,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:54:27,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:54:27,166 INFO L87 Difference]: Start difference. First operand 242516 states and 327312 transitions. cyclomatic complexity: 87353 Second operand has 5 states, 5 states have (on average 7.2) internal successors, (in total 36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:54:28,238 INFO L93 Difference]: Finished difference Result 242516 states and 326531 transitions. [2025-04-26 16:54:28,238 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 242516 states and 326531 transitions. [2025-04-26 16:54:29,920 INFO L131 ngComponentsAnalysis]: Automaton has 253 accepting balls. 2277 [2025-04-26 16:54:31,324 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 242516 states to 242516 states and 326531 transitions. [2025-04-26 16:54:31,324 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13437 [2025-04-26 16:54:31,342 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13437 [2025-04-26 16:54:31,343 INFO L74 IsDeterministic]: Start isDeterministic. Operand 242516 states and 326531 transitions. [2025-04-26 16:54:31,343 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:54:31,343 INFO L218 hiAutomatonCegarLoop]: Abstraction has 242516 states and 326531 transitions. [2025-04-26 16:54:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242516 states and 326531 transitions. [2025-04-26 16:54:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242516 to 241816. [2025-04-26 16:54:34,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241816 states, 241816 states have (on average 1.3474335858669402) internal successors, (in total 325831), 241815 states have internal predecessors, (325831), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:35,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241816 states to 241816 states and 325831 transitions. [2025-04-26 16:54:35,416 INFO L240 hiAutomatonCegarLoop]: Abstraction has 241816 states and 325831 transitions. [2025-04-26 16:54:35,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:54:35,417 INFO L438 stractBuchiCegarLoop]: Abstraction has 241816 states and 325831 transitions. [2025-04-26 16:54:35,417 INFO L340 stractBuchiCegarLoop]: ======== Iteration 15 ============ [2025-04-26 16:54:35,417 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241816 states and 325831 transitions. [2025-04-26 16:54:36,283 INFO L131 ngComponentsAnalysis]: Automaton has 253 accepting balls. 2277 [2025-04-26 16:54:36,284 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:54:36,284 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:54:36,284 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:36,284 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:54:36,285 INFO L752 eck$LassoCheckResult]: Stem: "[146] $Ultimate##0-->$Ultimate##0: Formula: (= v_sumThread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_10|, sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_14|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_16|, sumThread1of1ForFork0_thidvar0=v_sumThread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1, sumThread1of1ForFork0_log_msg#1, sumThread1of1ForFork0_i#1, sumThread1of1ForFork0_thidvar0]" "[79] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork0_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[80] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork0_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[82] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork0_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_5|} AuxVars[] AssignedVars[]" "[84] L40-->L41: Formula: (= |v_sumThread1of1ForFork0_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork0_i#1_7|) |v_sumThread1of1ForFork0_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_3|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork0_x#1=|v_sumThread1of1ForFork0_x#1_4|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork0_x#1]" "[85] L41-->L44: Formula: (= |v_sumThread1of1ForFork0_i#1_10| (+ |v_sumThread1of1ForFork0_i#1_9| 1)) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_9|} OutVars{sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork0_i#1]" "[86] L44-->L25: Formula: (= |v_sumThread1of1ForFork0_log_msg#1_1| |v_sumThread1of1ForFork0_i#1_13|) InVars {sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_1|, sumThread1of1ForFork0_i#1=|v_sumThread1of1ForFork0_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[149] L54-->$Ultimate##0: Formula: (and (= 2 v_sumThread1of1ForFork1_thidvar1_2) (= 2 v_sumThread1of1ForFork1_thidvar0_2)) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_10|, sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_14|, sumThread1of1ForFork1_thidvar0=v_sumThread1of1ForFork1_thidvar0_2, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_16|, sumThread1of1ForFork1_thidvar1=v_sumThread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1, sumThread1of1ForFork1_log_msg#1, sumThread1of1ForFork1_thidvar0, sumThread1of1ForFork1_i#1, sumThread1of1ForFork1_thidvar1]" "[118] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork1_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[119] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork1_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[121] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork1_i#1_5| v_N_2) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[123] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork1_i#1_7|) |v_sumThread1of1ForFork1_x#1_3|) |v_sumThread1of1ForFork1_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_7|, sumThread1of1ForFork1_x#1=|v_sumThread1of1ForFork1_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork1_x#1]" "[124] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork1_i#1_9| 1) |v_sumThread1of1ForFork1_i#1_10|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_9|} OutVars{sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork1_i#1]" "[125] L44-->L25: Formula: (= |v_sumThread1of1ForFork1_i#1_13| |v_sumThread1of1ForFork1_log_msg#1_1|) InVars {sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_1|, sumThread1of1ForFork1_i#1=|v_sumThread1of1ForFork1_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[152] 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]" "[131] $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]" "[132] 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]" "[134] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork2_i#1_5| v_N_2) InVars {sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[136] L40-->L41: Formula: (= (+ (select v_A_1 |v_sumThread1of1ForFork2_i#1_7|) |v_sumThread1of1ForFork2_x#1_3|) |v_sumThread1of1ForFork2_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork2_i#1=|v_sumThread1of1ForFork2_i#1_7|, sumThread1of1ForFork2_x#1=|v_sumThread1of1ForFork2_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork2_x#1]" "[137] 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]" "[138] 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]" "[155] L56-->$Ultimate##0: Formula: (and (= v_sumThread1of1ForFork3_thidvar1_2 4) (= v_sumThread1of1ForFork3_thidvar2_2 4) (= v_sumThread1of1ForFork3_thidvar0_2 4) (= v_sumThread1of1ForFork3_thidvar3_2 4)) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_10|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_14|, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_16|, sumThread1of1ForFork3_thidvar0=v_sumThread1of1ForFork3_thidvar0_2, sumThread1of1ForFork3_thidvar3=v_sumThread1of1ForFork3_thidvar3_2, sumThread1of1ForFork3_thidvar2=v_sumThread1of1ForFork3_thidvar2_2, sumThread1of1ForFork3_thidvar1=v_sumThread1of1ForFork3_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1, sumThread1of1ForFork3_log_msg#1, sumThread1of1ForFork3_i#1, sumThread1of1ForFork3_thidvar0, sumThread1of1ForFork3_thidvar3, sumThread1of1ForFork3_thidvar2, sumThread1of1ForFork3_thidvar1]" "[92] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork3_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[93] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork3_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[95] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork3_i#1_5| v_N_2) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L40-->L41: Formula: (= |v_sumThread1of1ForFork3_x#1_4| (+ |v_sumThread1of1ForFork3_x#1_3| (select v_A_1 |v_sumThread1of1ForFork3_i#1_7|))) InVars {A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_7|, sumThread1of1ForFork3_x#1=|v_sumThread1of1ForFork3_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork3_x#1]" "[98] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork3_i#1_9| 1) |v_sumThread1of1ForFork3_i#1_10|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_9|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork3_i#1]" "[99] L44-->L25: Formula: (= |v_sumThread1of1ForFork3_i#1_13| |v_sumThread1of1ForFork3_log_msg#1_1|) InVars {sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|} OutVars{sumThread1of1ForFork3_i#1=|v_sumThread1of1ForFork3_i#1_13|, sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[158] L57-->$Ultimate##0: Formula: (and (= 5 v_sumThread1of1ForFork4_thidvar4_2) (= 5 v_sumThread1of1ForFork4_thidvar3_2) (= 5 v_sumThread1of1ForFork4_thidvar0_2) (= 5 v_sumThread1of1ForFork4_thidvar2_2) (= 5 v_sumThread1of1ForFork4_thidvar1_2)) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_10|, sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_14|, sumThread1of1ForFork4_thidvar4=v_sumThread1of1ForFork4_thidvar4_2, sumThread1of1ForFork4_thidvar2=v_sumThread1of1ForFork4_thidvar2_2, sumThread1of1ForFork4_thidvar3=v_sumThread1of1ForFork4_thidvar3_2, sumThread1of1ForFork4_thidvar0=v_sumThread1of1ForFork4_thidvar0_2, sumThread1of1ForFork4_thidvar1=v_sumThread1of1ForFork4_thidvar1_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_16|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1, sumThread1of1ForFork4_log_msg#1, sumThread1of1ForFork4_thidvar4, sumThread1of1ForFork4_thidvar2, sumThread1of1ForFork4_thidvar3, sumThread1of1ForFork4_thidvar0, sumThread1of1ForFork4_thidvar1, sumThread1of1ForFork4_i#1]" "[105] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork4_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[106] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork4_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[108] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork4_i#1_5| v_N_2) InVars {N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} OutVars{N=v_N_2, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_5|} AuxVars[] AssignedVars[]" "[110] L40-->L41: Formula: (= |v_sumThread1of1ForFork4_x#1_4| (+ (select v_A_1 |v_sumThread1of1ForFork4_i#1_7|) |v_sumThread1of1ForFork4_x#1_3|)) InVars {A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_3|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} OutVars{A=v_A_1, sumThread1of1ForFork4_x#1=|v_sumThread1of1ForFork4_x#1_4|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork4_x#1]" "[111] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork4_i#1_9| 1) |v_sumThread1of1ForFork4_i#1_10|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_9|} OutVars{sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork4_i#1]" "[112] L44-->L25: Formula: (= |v_sumThread1of1ForFork4_log_msg#1_1| |v_sumThread1of1ForFork4_i#1_13|) InVars {sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_1|, sumThread1of1ForFork4_i#1=|v_sumThread1of1ForFork4_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[161] L58-->$Ultimate##0: Formula: (and (= 6 v_sumThread1of1ForFork5_thidvar3_2) (= 6 v_sumThread1of1ForFork5_thidvar1_2) (= 6 v_sumThread1of1ForFork5_thidvar4_2) (= 6 v_sumThread1of1ForFork5_thidvar5_2) (= 6 v_sumThread1of1ForFork5_thidvar0_2) (= 6 v_sumThread1of1ForFork5_thidvar2_2)) InVars {} OutVars{sumThread1of1ForFork5_thidvar4=v_sumThread1of1ForFork5_thidvar4_2, sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_14|, sumThread1of1ForFork5_thidvar3=v_sumThread1of1ForFork5_thidvar3_2, sumThread1of1ForFork5_thidvar5=v_sumThread1of1ForFork5_thidvar5_2, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_16|, sumThread1of1ForFork5_thidvar0=v_sumThread1of1ForFork5_thidvar0_2, sumThread1of1ForFork5_thidvar2=v_sumThread1of1ForFork5_thidvar2_2, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_10|, sumThread1of1ForFork5_thidvar1=v_sumThread1of1ForFork5_thidvar1_2} AuxVars[] AssignedVars[sumThread1of1ForFork5_thidvar4, sumThread1of1ForFork5_log_msg#1, sumThread1of1ForFork5_thidvar3, sumThread1of1ForFork5_thidvar5, sumThread1of1ForFork5_i#1, sumThread1of1ForFork5_thidvar0, sumThread1of1ForFork5_thidvar2, sumThread1of1ForFork5_x#1, sumThread1of1ForFork5_thidvar1]" "[66] $Ultimate##0-->L38: Formula: (= |v_sumThread1of1ForFork5_x#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[67] L38-->L39-1: Formula: (= |v_sumThread1of1ForFork5_i#1_1| 0) InVars {} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_1|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" [2025-04-26 16:54:36,285 INFO L754 eck$LassoCheckResult]: Loop: "[69] L39-1-->L40: Formula: (< |v_sumThread1of1ForFork5_i#1_5| v_N_2) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_5|, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L40-->L41: Formula: (= (+ |v_sumThread1of1ForFork5_x#1_3| (select v_A_1 |v_sumThread1of1ForFork5_i#1_7|)) |v_sumThread1of1ForFork5_x#1_4|) InVars {A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_3|} OutVars{A=v_A_1, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_4|} AuxVars[] AssignedVars[sumThread1of1ForFork5_x#1]" "[72] L41-->L44: Formula: (= (+ |v_sumThread1of1ForFork5_i#1_9| 1) |v_sumThread1of1ForFork5_i#1_10|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_9|} OutVars{sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_10|} AuxVars[] AssignedVars[sumThread1of1ForFork5_i#1]" "[73] L44-->L25: Formula: (= |v_sumThread1of1ForFork5_i#1_13| |v_sumThread1of1ForFork5_log_msg#1_1|) InVars {sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_1|, sumThread1of1ForFork5_i#1=|v_sumThread1of1ForFork5_i#1_13|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[74] L25-->L25-1: Formula: (and (= (+ v_stdout_ptr_8 1) v_stdout_ptr_7) (= v_stdout_5 (store v_stdout_6 v_stdout_ptr_8 |v_sumThread1of1ForFork5_log_msg#1_3|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_6, stdout_ptr=v_stdout_ptr_8} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_3|, stdout=v_stdout_5, stdout_ptr=v_stdout_ptr_7} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[75] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[76] L45-->L25-2: Formula: (= |v_sumThread1of1ForFork5_x#1_7| |v_sumThread1of1ForFork5_log_msg#1_7|) InVars {sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_7|, sumThread1of1ForFork5_x#1=|v_sumThread1of1ForFork5_x#1_7|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" "[77] 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_sumThread1of1ForFork5_log_msg#1_9|))) InVars {sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_10, stdout_ptr=v_stdout_ptr_12} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_9|, stdout=v_stdout_9, stdout_ptr=v_stdout_ptr_11} AuxVars[] AssignedVars[stdout, stdout_ptr]" "[78] L25-3-->L39-1: Formula: true InVars {} OutVars{sumThread1of1ForFork5_log_msg#1=|v_sumThread1of1ForFork5_log_msg#1_11|} AuxVars[] AssignedVars[sumThread1of1ForFork5_log_msg#1]" [2025-04-26 16:54:36,285 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1165239687, now seen corresponding path program 1 times [2025-04-26 16:54:36,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,285 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058778665] [2025-04-26 16:54:36,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:36,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-26 16:54:36,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-26 16:54:36,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,293 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:36,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-26 16:54:36,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-26 16:54:36,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:36,301 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 464996328, now seen corresponding path program 3 times [2025-04-26 16:54:36,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872477283] [2025-04-26 16:54:36,302 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:54:36,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,303 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:36,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:36,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:54:36,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,308 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:36,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:36,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:36,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,311 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:36,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:36,311 INFO L85 PathProgramCache]: Analyzing trace with hash 881719586, now seen corresponding path program 1 times [2025-04-26 16:54:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:54:36,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49734250] [2025-04-26 16:54:36,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:54:36,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:54:36,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-26 16:54:36,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-26 16:54:36,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,319 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:54:36,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-26 16:54:36,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-26 16:54:36,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:36,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:54:36,332 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:54:36,740 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:54:36,741 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:54:36,741 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:54:36,741 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:54:36,741 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:54:36,741 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:36,741 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:54:36,741 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:54:36,741 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-6threads.bpl_petrified1_Iteration15_Lasso [2025-04-26 16:54:36,741 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:54:36,741 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:54:36,742 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,744 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,745 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,746 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,748 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,768 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,770 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,771 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,773 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,774 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,775 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,777 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,778 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,782 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,783 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,786 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,788 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,789 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,795 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,796 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,798 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,799 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,802 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,805 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,806 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,808 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,809 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,810 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:54:36,999 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:54:36,999 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:54:36,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:36,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,001 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:54:37,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,015 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,015 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,015 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,015 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,018 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Ended with exit code 0 [2025-04-26 16:54:37,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,027 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:54:37,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,039 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,040 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,040 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,042 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,049 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2025-04-26 16:54:37,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,060 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:54:37,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,060 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,060 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,061 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:54:37,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:54:37,062 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2025-04-26 16:54:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,071 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2025-04-26 16:54:37,073 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,082 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,083 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,083 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,083 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,084 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,084 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,086 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:54:37,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2025-04-26 16:54:37,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,093 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2025-04-26 16:54:37,095 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:54:37,104 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:54:37,105 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:54:37,105 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:54:37,105 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:54:37,107 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:54:37,107 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:54:37,111 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:54:37,118 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:54:37,118 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:54:37,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:54:37,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:54:37,120 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:54:37,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2025-04-26 16:54:37,121 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:54:37,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2025-04-26 16:54:37,137 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:54:37,137 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:54:37,137 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork5_i#1, N) = -1*sumThread1of1ForFork5_i#1 + 1*N Supporting invariants [] [2025-04-26 16:54:37,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2025-04-26 16:54:37,145 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:54:37,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:54:37,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-26 16:54:37,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-26 16:54:37,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:37,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:54:37,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:54:37,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:54:37,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:54:37,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:54:37,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:54:37,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:54:37,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:54:37,241 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:54:37,241 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 241816 states and 325831 transitions. cyclomatic complexity: 86572 Second operand has 4 states, 4 states have (on average 11.75) internal successors, (in total 47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:39,627 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 241816 states and 325831 transitions. cyclomatic complexity: 86572. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (in total 47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 455378 states and 623308 transitions. Complement of second has 6 states. [2025-04-26 16:54:39,627 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:54:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 11.75) internal successors, (in total 47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:54:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2025-04-26 16:54:39,628 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 146 transitions. Stem has 38 letters. Loop has 9 letters. [2025-04-26 16:54:39,628 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,628 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 146 transitions. Stem has 47 letters. Loop has 9 letters. [2025-04-26 16:54:39,628 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,628 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 146 transitions. Stem has 38 letters. Loop has 18 letters. [2025-04-26 16:54:39,628 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:54:39,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 455378 states and 623308 transitions. [2025-04-26 16:54:42,722 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:42,722 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 455378 states to 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:54:42,723 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:54:42,723 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:54:42,723 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L340 stractBuchiCegarLoop]: ======== Iteration 16 ============ [2025-04-26 16:54:42,723 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:54:42,723 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:54:42,723 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:54:42,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:54:42,735 INFO L201 PluginConnector]: Adding new model array-sum-with-log-6threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:54:42 BoogieIcfgContainer [2025-04-26 16:54:42,735 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:54:42,735 INFO L158 Benchmark]: Toolchain (without parser) took 73458.56ms. Allocated memory was 159.4MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 85.4MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-04-26 16:54:42,736 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:42,736 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.66ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 82.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:54:42,736 INFO L158 Benchmark]: Boogie Preprocessor took 20.74ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 81.2MB in the end (delta: 914.2kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:54:42,736 INFO L158 Benchmark]: RCFGBuilder took 183.37ms. Allocated memory is still 159.4MB. Free memory was 81.2MB in the beginning and 71.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:54:42,736 INFO L158 Benchmark]: BuchiAutomizer took 73184.86ms. Allocated memory was 159.4MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 71.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. [2025-04-26 16:54:42,737 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.22ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.66ms. Allocated memory is still 159.4MB. Free memory was 85.4MB in the beginning and 82.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.74ms. Allocated memory is still 159.4MB. Free memory was 82.2MB in the beginning and 81.2MB in the end (delta: 914.2kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 183.37ms. Allocated memory is still 159.4MB. Free memory was 81.2MB in the beginning and 71.7MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 73184.86ms. Allocated memory was 159.4MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 71.7MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 5.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 73.0s and 16 iterations. TraceHistogramMax:1. Analysis of lassos took 4.9s. Construction of modules took 1.2s. Büchi inclusion checks took 37.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 14. Automata minimization 23.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 7883 StatesRemovedByMinimization, 14 NontrivialMinimizations. Non-live state removal took 22.3s Buchi closure took 0.2s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [6, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2253 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2247 mSDsluCounter, 2927 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1827 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2028 IncrementalHoareTripleChecker+Invalid, 2053 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1100 mSDtfsCounter, 2028 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc5 concLT0 SILN0 SILU4 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital99 mio100 ax100 hnf100 lsp63 ukn73 mio100 lsp51 div100 bol100 ite100 ukn100 eq207 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 39ms VariablesStem: 1 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 3.0s InitialAbstraction: Time to compute Ample Reduction [ms]: 3007, Number of transitions in reduction automaton: 24575, Number of states in reduction automaton: 19089, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 15 terminating modules (9 trivial, 6 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. One deterministic module has affine ranking function -1 * i + N and consists of 4 locations. 9 modules have a trivial ranking function, the largest among these consists of 5 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 16:54:42,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...