/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-5threads.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:38:56,206 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:38:56,268 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:38:56,273 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:38:56,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:38:56,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:38:56,274 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:38:56,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:38:56,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:38:56,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:38:56,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:38:56,299 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:38:56,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:38:56,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:38:56,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:56,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:38:56,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:38:56,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:38:56,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:38:56,301 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:38:56,301 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:38:56,301 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:38:56,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:38:56,542 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:38:56,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:38:56,549 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:38:56,549 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:38:56,550 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-5threads.bpl [2025-04-26 18:38:56,550 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/POPL2023/array-sum-with-log-5threads.bpl' [2025-04-26 18:38:56,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:38:56,568 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:38:56,569 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:56,569 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:38:56,569 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:38:56,576 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,597 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,612 INFO L138 Inliner]: procedures = 3, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 18:38:56,613 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:38:56,614 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:38:56,614 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:38:56,614 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:38:56,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,624 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,626 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,629 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:38:56,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:38:56,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:38:56,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:38:56,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/1) ... [2025-04-26 18:38:56,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:38:56,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,662 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 18:38:56,664 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 18:38:56,682 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:38:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:38:56,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:38:56,683 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 18:38:56,683 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 18:38:56,683 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 18:38:56,684 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 18:38:56,720 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:38:56,721 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:38:56,798 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:38:56,798 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:38:56,810 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:38:56,810 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:38:56,811 INFO L201 PluginConnector]: Adding new model array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:56 BoogieIcfgContainer [2025-04-26 18:38:56,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:38:56,812 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:38:56,812 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:38:56,816 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:38:56,817 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:56,817 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:38:56" (1/2) ... [2025-04-26 18:38:56,818 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f3bce94 and model type array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:38:56, skipping insertion in model container [2025-04-26 18:38:56,818 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:38:56,818 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:38:56" (2/2) ... [2025-04-26 18:38:56,819 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-5threads.bpl [2025-04-26 18:38:56,911 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 18:38:56,949 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:38:56,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:38:56,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:38:56,953 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 18:38:56,954 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 18:38:57,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 18:38:57,036 INFO L116 PetriNetUnfolderBase]: 5/78 cut-off events. [2025-04-26 18:38:57,038 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 18:38:57,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 78 events. 5/78 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 276 event pairs, 0 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2025-04-26 18:38:57,042 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 18:38:57,046 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 78 transitions, 186 flow [2025-04-26 18:38:57,047 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 89 places, 78 transitions, 186 flow [2025-04-26 18:38:57,047 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 89 places, 78 transitions, 186 flow [2025-04-26 18:39:08,459 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 433178 states, 433176 states have (on average 4.988092599774688) internal successors, (in total 2160722), 433177 states have internal predecessors, (2160722), 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 18:39:09,277 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 433178 states, 433176 states have (on average 4.988092599774688) internal successors, (in total 2160722), 433177 states have internal predecessors, (2160722), 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 18:39:09,279 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:39:10,376 WARN L140 AmpleReduction]: Number of pruned transitions: 13518 [2025-04-26 18:39:10,377 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:39:10,377 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 36 [2025-04-26 18:39:10,377 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:411 [2025-04-26 18:39:10,377 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5076 [2025-04-26 18:39:10,377 WARN L145 AmpleReduction]: Times succ was already a loop node:524 [2025-04-26 18:39:10,377 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:82 [2025-04-26 18:39:10,377 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:39:10,389 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 5524 states, 5522 states have (on average 1.272365085114089) internal successors, (in total 7026), 5523 states have internal predecessors, (7026), 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 18:39:10,413 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:39:10,413 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:39:10,413 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:39:10,413 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:39:10,413 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:39:10,413 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:39:10,413 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:39:10,413 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:39:10,432 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5524 states, 5522 states have (on average 1.272365085114089) internal successors, (in total 7026), 5523 states have internal predecessors, (7026), 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 18:39:10,623 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 4511 [2025-04-26 18:39:10,623 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,623 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:10,632 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:10,632 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:39:10,638 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5524 states, 5522 states have (on average 1.272365085114089) internal successors, (in total 7026), 5523 states have internal predecessors, (7026), 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 18:39:10,735 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 4511 [2025-04-26 18:39:10,735 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:10,736 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:10,736 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:39:10,736 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:10,740 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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 18:39:10,741 INFO L754 eck$LassoCheckResult]: Loop: "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[70] 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]" "[71] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork0_log_msg#1=|v_sumThread1of1ForFork0_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork0_log_msg#1]" "[72] 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]" "[73] 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]" "[74] 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 18:39:10,745 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,745 INFO L85 PathProgramCache]: Analyzing trace with hash 155745, now seen corresponding path program 1 times [2025-04-26 18:39:10,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439419566] [2025-04-26 18:39:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,804 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:10,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:10,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,825 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1350191588, now seen corresponding path program 1 times [2025-04-26 18:39:10,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023241741] [2025-04-26 18:39:10,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:10,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:10,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,857 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:10,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:10,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:10,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1487820164, now seen corresponding path program 1 times [2025-04-26 18:39:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:10,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234958516] [2025-04-26 18:39:10,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:10,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:10,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:10,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,899 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:10,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 18:39:10,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 18:39:10,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:10,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:10,913 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:11,372 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:11,373 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:11,374 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:11,374 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:11,374 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:11,374 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,374 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:11,374 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:11,374 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:39:11,374 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:11,374 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:11,385 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,432 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:11,508 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:11,515 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:11,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,523 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 18:39:11,524 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 18:39:11,529 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 18:39:11,552 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,552 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,552 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,553 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:11,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:11,570 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,576 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 18:39:11,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,582 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 18:39:11,584 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 18:39:11,588 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 18:39:11,604 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,604 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:11,604 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,605 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,605 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:11,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:11,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:11,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,629 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 18:39:11,630 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 18:39:11,631 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 18:39:11,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,645 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:11,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,645 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:11,645 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:11,648 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:11,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:39:11,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,656 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 18:39:11,658 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 18:39:11,663 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 18:39:11,680 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:11,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:11,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:11,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:11,683 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:11,683 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:11,697 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:11,709 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:11,709 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 18:39:11,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:11,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:11,719 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 18:39:11,720 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 18:39:11,720 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:11,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:39:11,758 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:11,758 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:11,759 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 18:39:11,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:11,771 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:11,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:11,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:39:11,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:39:11,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:11,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:11,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:11,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:11,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:11,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:11,928 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 18:39:11,962 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 18:39:11,979 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 5524 states, 5522 states have (on average 1.272365085114089) internal successors, (in total 7026), 5523 states have internal predecessors, (7026), 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 18:39:12,374 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 5524 states, 5522 states have (on average 1.272365085114089) internal successors, (in total 7026), 5523 states have internal predecessors, (7026), 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 11049 states and 14379 transitions. Complement of second has 6 states. [2025-04-26 18:39:12,378 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 18:39:12,385 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 18:39:12,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 18:39:12,393 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 9 letters. [2025-04-26 18:39:12,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 12 letters. Loop has 9 letters. [2025-04-26 18:39:12,395 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,395 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 18 letters. [2025-04-26 18:39:12,399 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:12,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11049 states and 14379 transitions. [2025-04-26 18:39:12,535 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 18:39:12,667 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11049 states to 8704 states and 11402 transitions. [2025-04-26 18:39:12,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5079 [2025-04-26 18:39:12,685 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5200 [2025-04-26 18:39:12,686 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8704 states and 11402 transitions. [2025-04-26 18:39:12,693 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:12,693 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8704 states and 11402 transitions. [2025-04-26 18:39:12,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states and 11402 transitions. [2025-04-26 18:39:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 8584. [2025-04-26 18:39:13,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8584 states, 8584 states have (on average 1.276677539608574) internal successors, (in total 10959), 8583 states have internal predecessors, (10959), 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 18:39:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8584 states to 8584 states and 10959 transitions. [2025-04-26 18:39:13,091 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8584 states and 10959 transitions. [2025-04-26 18:39:13,092 INFO L438 stractBuchiCegarLoop]: Abstraction has 8584 states and 10959 transitions. [2025-04-26 18:39:13,092 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:39:13,092 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8584 states and 10959 transitions. [2025-04-26 18:39:13,166 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 18:39:13,167 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:13,167 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:13,167 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:13,167 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:13,168 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[64] 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[]" "[66] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] 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]" "[101] $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]" "[102] 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 18:39:13,168 INFO L754 eck$LassoCheckResult]: Loop: "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[109] 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]" "[110] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[111] 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]" "[112] 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]" "[113] 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 18:39:13,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,168 INFO L85 PathProgramCache]: Analyzing trace with hash 732270882, now seen corresponding path program 1 times [2025-04-26 18:39:13,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92543375] [2025-04-26 18:39:13,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:13,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:13,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,182 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:39:13,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:39:13,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,186 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,186 INFO L85 PathProgramCache]: Analyzing trace with hash 235730571, now seen corresponding path program 1 times [2025-04-26 18:39:13,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208265393] [2025-04-26 18:39:13,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:13,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:13,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,204 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:13,205 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:13,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:13,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:13,214 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:13,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1116871306, now seen corresponding path program 1 times [2025-04-26 18:39:13,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:13,214 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140492244] [2025-04-26 18:39:13,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:13,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:13,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:13,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:13,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:13,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:13,354 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 18:39:13,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:13,354 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140492244] [2025-04-26 18:39:13,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140492244] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:13,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:13,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:13,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207062864] [2025-04-26 18:39:13,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:13,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:13,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:13,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:13,424 INFO L87 Difference]: Start difference. First operand 8584 states and 10959 transitions. cyclomatic complexity: 2515 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 18:39:13,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:13,834 INFO L93 Difference]: Finished difference Result 9154 states and 11635 transitions. [2025-04-26 18:39:13,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9154 states and 11635 transitions. [2025-04-26 18:39:13,897 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 4072 [2025-04-26 18:39:13,961 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9154 states to 9154 states and 11635 transitions. [2025-04-26 18:39:13,961 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5648 [2025-04-26 18:39:13,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5648 [2025-04-26 18:39:13,972 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9154 states and 11635 transitions. [2025-04-26 18:39:13,972 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:13,972 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9154 states and 11635 transitions. [2025-04-26 18:39:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9154 states and 11635 transitions. [2025-04-26 18:39:14,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9154 to 8589. [2025-04-26 18:39:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8589 states, 8589 states have (on average 1.2765164745604844) internal successors, (in total 10964), 8588 states have internal predecessors, (10964), 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 18:39:14,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 10964 transitions. [2025-04-26 18:39:14,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8589 states and 10964 transitions. [2025-04-26 18:39:14,210 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:14,211 INFO L438 stractBuchiCegarLoop]: Abstraction has 8589 states and 10964 transitions. [2025-04-26 18:39:14,211 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:39:14,211 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8589 states and 10964 transitions. [2025-04-26 18:39:14,237 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 18:39:14,237 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:14,237 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:14,238 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:14,238 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:14,238 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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 18:39:14,239 INFO L754 eck$LassoCheckResult]: Loop: "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[109] 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]" "[110] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork1_log_msg#1=|v_sumThread1of1ForFork1_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork1_log_msg#1]" "[111] 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]" "[112] 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]" "[113] 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 18:39:14,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,239 INFO L85 PathProgramCache]: Analyzing trace with hash 193787297, now seen corresponding path program 1 times [2025-04-26 18:39:14,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164386483] [2025-04-26 18:39:14,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,245 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:14,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:14,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,249 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,250 INFO L85 PathProgramCache]: Analyzing trace with hash 235730571, now seen corresponding path program 2 times [2025-04-26 18:39:14,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816730812] [2025-04-26 18:39:14,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:14,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:14,260 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:14,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:14,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:14,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:14,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,270 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,271 INFO L85 PathProgramCache]: Analyzing trace with hash 925521131, now seen corresponding path program 1 times [2025-04-26 18:39:14,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:14,271 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493047034] [2025-04-26 18:39:14,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:14,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:39:14,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:39:14,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,288 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:14,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 18:39:14,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 18:39:14,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:14,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:14,416 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:14,417 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:14,417 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:14,417 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:14,417 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:14,417 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,417 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:14,417 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:14,417 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:39:14,417 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:14,417 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:14,419 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,423 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,426 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,428 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,480 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,483 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:14,595 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:14,596 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:14,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,603 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 18:39:14,608 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 18:39:14,612 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 18:39:14,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,637 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,642 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 18:39:14,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,645 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 18:39:14,645 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 18:39:14,650 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 18:39:14,672 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,672 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:14,672 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,672 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,672 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,673 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:14,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:14,676 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,682 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 18:39:14,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,684 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 18:39:14,685 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 18:39:14,691 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 18:39:14,713 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,713 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,713 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,713 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,715 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,721 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:39:14,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,731 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 18:39:14,733 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 18:39:14,737 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 18:39:14,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,758 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,758 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,758 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,766 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,772 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 18:39:14,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,774 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 18:39:14,776 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 18:39:14,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 18:39:14,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:14,799 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,799 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,799 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:14,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:14,801 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:14,807 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 18:39:14,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,809 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 18:39:14,810 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 18:39:14,816 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 18:39:14,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:14,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:14,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:14,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:14,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:14,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:14,844 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:14,854 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 18:39:14,854 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:14,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:14,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:14,856 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 18:39:14,858 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 18:39:14,862 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:14,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:14,882 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:14,882 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:14,882 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 18:39:14,888 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 18:39:14,894 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:14,904 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:14,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 18:39:14,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 18:39:14,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:14,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:14,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:14,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:14,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:14,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:14,981 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 18:39:14,982 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 18:39:14,982 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8589 states and 10964 transitions. cyclomatic complexity: 2515 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 18:39:15,145 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8589 states and 10964 transitions. cyclomatic complexity: 2515. 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 17190 states and 22596 transitions. Complement of second has 6 states. [2025-04-26 18:39:15,146 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 18:39:15,146 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 18:39:15,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-26 18:39:15,147 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 9 letters. [2025-04-26 18:39:15,147 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,147 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 19 letters. Loop has 9 letters. [2025-04-26 18:39:15,147 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,147 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 18 letters. [2025-04-26 18:39:15,147 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:15,147 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17190 states and 22596 transitions. [2025-04-26 18:39:15,219 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 18:39:15,286 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17190 states to 13843 states and 18261 transitions. [2025-04-26 18:39:15,286 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4714 [2025-04-26 18:39:15,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4834 [2025-04-26 18:39:15,292 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13843 states and 18261 transitions. [2025-04-26 18:39:15,293 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:15,294 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13843 states and 18261 transitions. [2025-04-26 18:39:15,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13843 states and 18261 transitions. [2025-04-26 18:39:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13843 to 13722. [2025-04-26 18:39:15,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13722 states, 13722 states have (on average 1.2985716367876403) internal successors, (in total 17819), 13721 states have internal predecessors, (17819), 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 18:39:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13722 states to 13722 states and 17819 transitions. [2025-04-26 18:39:15,554 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13722 states and 17819 transitions. [2025-04-26 18:39:15,554 INFO L438 stractBuchiCegarLoop]: Abstraction has 13722 states and 17819 transitions. [2025-04-26 18:39:15,554 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:39:15,554 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13722 states and 17819 transitions. [2025-04-26 18:39:15,582 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 18:39:15,582 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:15,582 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:15,582 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:15,582 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:15,583 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[64] 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[]" "[66] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] 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]" "[101] $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]" "[102] 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]" "[103] 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[]" "[105] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] 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]" "[114] $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]" "[115] 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 18:39:15,583 INFO L754 eck$LassoCheckResult]: Loop: "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[122] 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]" "[123] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[124] 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]" "[125] 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]" "[126] 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 18:39:15,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 34540804, now seen corresponding path program 1 times [2025-04-26 18:39:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204069128] [2025-04-26 18:39:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:15,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,587 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:15,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:39:15,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:39:15,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,590 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 1 times [2025-04-26 18:39:15,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267538359] [2025-04-26 18:39:15,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:15,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:15,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:15,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,601 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:15,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:15,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:15,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:15,606 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:15,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:15,607 INFO L85 PathProgramCache]: Analyzing trace with hash 419370613, now seen corresponding path program 1 times [2025-04-26 18:39:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:15,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456965310] [2025-04-26 18:39:15,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:15,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:39:15,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:39:15,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:15,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:15,668 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 18:39:15,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:15,669 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456965310] [2025-04-26 18:39:15,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456965310] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:15,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:15,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:15,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234134093] [2025-04-26 18:39:15,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:15,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:15,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:15,714 INFO L87 Difference]: Start difference. First operand 13722 states and 17819 transitions. cyclomatic complexity: 4321 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 18:39:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:15,885 INFO L93 Difference]: Finished difference Result 13923 states and 18048 transitions. [2025-04-26 18:39:15,885 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13923 states and 18048 transitions. [2025-04-26 18:39:15,931 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 2867 [2025-04-26 18:39:15,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13923 states to 13923 states and 18048 transitions. [2025-04-26 18:39:15,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4912 [2025-04-26 18:39:15,988 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4912 [2025-04-26 18:39:15,989 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13923 states and 18048 transitions. [2025-04-26 18:39:15,989 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:15,989 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13923 states and 18048 transitions. [2025-04-26 18:39:16,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states and 18048 transitions. [2025-04-26 18:39:16,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13728. [2025-04-26 18:39:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13728 states, 13728 states have (on average 1.2984411421911422) internal successors, (in total 17825), 13727 states have internal predecessors, (17825), 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 18:39:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13728 states to 13728 states and 17825 transitions. [2025-04-26 18:39:16,154 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13728 states and 17825 transitions. [2025-04-26 18:39:16,154 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:16,157 INFO L438 stractBuchiCegarLoop]: Abstraction has 13728 states and 17825 transitions. [2025-04-26 18:39:16,157 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:39:16,157 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13728 states and 17825 transitions. [2025-04-26 18:39:16,191 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 18:39:16,191 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:16,191 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:16,192 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:16,192 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:16,192 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[103] 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[]" "[105] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] 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]" "[114] $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]" "[115] 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 18:39:16,192 INFO L754 eck$LassoCheckResult]: Loop: "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[122] 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]" "[123] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[124] 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]" "[125] 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]" "[126] 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 18:39:16,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,193 INFO L85 PathProgramCache]: Analyzing trace with hash 2011013093, now seen corresponding path program 1 times [2025-04-26 18:39:16,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182697309] [2025-04-26 18:39:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 18:39:16,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 18:39:16,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:16,232 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 18:39:16,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:16,232 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182697309] [2025-04-26 18:39:16,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182697309] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:16,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:16,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:16,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26764425] [2025-04-26 18:39:16,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:16,233 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:16,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 2 times [2025-04-26 18:39:16,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841202985] [2025-04-26 18:39:16,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:16,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:16,239 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:16,239 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:16,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,239 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:16,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:16,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:16,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:16,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:16,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:16,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:16,284 INFO L87 Difference]: Start difference. First operand 13728 states and 17825 transitions. cyclomatic complexity: 4321 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 18:39:16,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:16,422 INFO L93 Difference]: Finished difference Result 13921 states and 18041 transitions. [2025-04-26 18:39:16,422 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13921 states and 18041 transitions. [2025-04-26 18:39:16,464 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 2867 [2025-04-26 18:39:16,509 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13921 states to 13921 states and 18041 transitions. [2025-04-26 18:39:16,510 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4912 [2025-04-26 18:39:16,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4912 [2025-04-26 18:39:16,515 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13921 states and 18041 transitions. [2025-04-26 18:39:16,516 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:16,516 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13921 states and 18041 transitions. [2025-04-26 18:39:16,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13921 states and 18041 transitions. [2025-04-26 18:39:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13921 to 13726. [2025-04-26 18:39:16,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13726 states, 13726 states have (on average 1.2981203555296517) internal successors, (in total 17818), 13725 states have internal predecessors, (17818), 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 18:39:16,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 17818 transitions. [2025-04-26 18:39:16,689 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13726 states and 17818 transitions. [2025-04-26 18:39:16,689 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:16,691 INFO L438 stractBuchiCegarLoop]: Abstraction has 13726 states and 17818 transitions. [2025-04-26 18:39:16,692 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:39:16,692 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13726 states and 17818 transitions. [2025-04-26 18:39:16,722 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 18:39:16,723 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:16,723 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:16,724 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 18:39:16,724 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:16,724 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[135] 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]" "[114] $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]" "[115] 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 18:39:16,724 INFO L754 eck$LassoCheckResult]: Loop: "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[122] 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]" "[123] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork2_log_msg#1=|v_sumThread1of1ForFork2_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork2_log_msg#1]" "[124] 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]" "[125] 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]" "[126] 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 18:39:16,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash 738417540, now seen corresponding path program 1 times [2025-04-26 18:39:16,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058649661] [2025-04-26 18:39:16,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:16,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:16,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:16,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,732 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:16,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:16,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:16,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:16,744 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 3 times [2025-04-26 18:39:16,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017991433] [2025-04-26 18:39:16,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:16,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:16,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:16,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:16,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,749 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:16,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:16,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:16,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:16,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1723537397, now seen corresponding path program 1 times [2025-04-26 18:39:16,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:16,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312905289] [2025-04-26 18:39:16,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:16,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:16,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:16,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:16,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,767 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:16,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 18:39:16,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 18:39:16,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:16,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:16,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:16,954 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:16,954 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:16,954 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:16,954 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:16,954 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:16,955 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:16,955 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:16,955 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:16,955 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration6_Lasso [2025-04-26 18:39:16,955 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:16,955 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:16,956 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:16,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:16,963 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:16,965 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:16,968 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:16,999 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,001 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,003 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,006 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,008 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,010 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,011 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:17,135 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:17,135 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:17,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,137 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 18:39:17,139 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 18:39:17,140 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 18:39:17,150 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:17,150 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:17,150 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:17,150 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:17,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:17,151 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:17,154 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:17,159 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 18:39:17,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,161 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 18:39:17,166 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 18:39:17,167 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 18:39:17,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:17,177 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:17,177 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:17,177 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:17,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:17,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:17,181 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:17,186 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 18:39:17,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,189 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 18:39:17,190 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 18:39:17,191 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 18:39:17,201 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:17,201 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:17,201 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:17,201 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:17,202 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:17,202 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:17,205 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:17,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:39:17,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,212 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 18:39:17,213 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 18:39:17,215 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 18:39:17,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:17,225 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:17,225 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:17,225 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:17,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:17,226 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:17,228 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:17,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:17,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,236 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 18:39:17,236 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 18:39:17,239 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 18:39:17,249 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:17,249 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:17,249 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:17,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:17,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:17,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:17,257 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:17,262 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 18:39:17,262 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:39:17,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:17,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:17,264 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 18:39:17,266 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 18:39:17,267 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:17,282 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:17,282 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:17,282 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:17,282 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 18:39:17,288 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 18:39:17,289 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:17,299 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 18:39:17,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 18:39:17,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:17,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:17,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:17,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:17,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:17,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:17,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:17,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:17,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:17,385 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 18:39:17,386 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 18:39:17,386 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13726 states and 17818 transitions. cyclomatic complexity: 4316 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 18:39:17,566 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13726 states and 17818 transitions. cyclomatic complexity: 4316. 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 30626 states and 40922 transitions. Complement of second has 6 states. [2025-04-26 18:39:17,566 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 18:39:17,567 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 18:39:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 18:39:17,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 17 letters. Loop has 9 letters. [2025-04-26 18:39:17,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:17,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 26 letters. Loop has 9 letters. [2025-04-26 18:39:17,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:17,568 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 17 letters. Loop has 18 letters. [2025-04-26 18:39:17,568 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:17,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30626 states and 40922 transitions. [2025-04-26 18:39:17,680 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:17,776 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30626 states to 23703 states and 31704 transitions. [2025-04-26 18:39:17,776 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4319 [2025-04-26 18:39:17,782 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4436 [2025-04-26 18:39:17,782 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23703 states and 31704 transitions. [2025-04-26 18:39:17,783 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:17,783 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23703 states and 31704 transitions. [2025-04-26 18:39:17,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23703 states and 31704 transitions. [2025-04-26 18:39:17,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23703 to 23513. [2025-04-26 18:39:17,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23513 states, 23513 states have (on average 1.3175690043805555) internal successors, (in total 30980), 23512 states have internal predecessors, (30980), 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 18:39:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23513 states to 23513 states and 30980 transitions. [2025-04-26 18:39:18,038 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23513 states and 30980 transitions. [2025-04-26 18:39:18,038 INFO L438 stractBuchiCegarLoop]: Abstraction has 23513 states and 30980 transitions. [2025-04-26 18:39:18,038 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 18:39:18,038 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23513 states and 30980 transitions. [2025-04-26 18:39:18,090 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:18,091 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:18,091 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:18,091 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 18:39:18,091 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:18,091 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[64] 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[]" "[66] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] 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]" "[101] $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]" "[102] 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]" "[103] 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[]" "[105] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] 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]" "[114] $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]" "[115] 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]" "[116] 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[]" "[118] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] 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]" "[75] $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]" "[76] 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 18:39:18,092 INFO L754 eck$LassoCheckResult]: Loop: "[78] 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[]" "[80] 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]" "[81] 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]" "[82] 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]" "[83] 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]" "[84] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[85] 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]" "[86] 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]" "[87] 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 18:39:18,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash 733925157, now seen corresponding path program 1 times [2025-04-26 18:39:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26314448] [2025-04-26 18:39:18,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:18,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:18,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,097 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:18,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 18:39:18,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 18:39:18,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,100 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:18,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,100 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 1 times [2025-04-26 18:39:18,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,102 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761000165] [2025-04-26 18:39:18,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:18,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:18,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:18,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:18,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:18,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:18,112 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:18,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,112 INFO L85 PathProgramCache]: Analyzing trace with hash -875660083, now seen corresponding path program 1 times [2025-04-26 18:39:18,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825983548] [2025-04-26 18:39:18,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 18:39:18,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 18:39:18,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:18,161 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 18:39:18,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:18,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825983548] [2025-04-26 18:39:18,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825983548] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:18,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:18,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:18,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931884823] [2025-04-26 18:39:18,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:18,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:18,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:18,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:18,197 INFO L87 Difference]: Start difference. First operand 23513 states and 30980 transitions. cyclomatic complexity: 7841 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 18:39:18,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:18,357 INFO L93 Difference]: Finished difference Result 23570 states and 31041 transitions. [2025-04-26 18:39:18,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23570 states and 31041 transitions. [2025-04-26 18:39:18,439 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 1800 [2025-04-26 18:39:18,531 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23570 states to 23570 states and 31041 transitions. [2025-04-26 18:39:18,531 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2025-04-26 18:39:18,537 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2025-04-26 18:39:18,537 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23570 states and 31041 transitions. [2025-04-26 18:39:18,537 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:18,537 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23570 states and 31041 transitions. [2025-04-26 18:39:18,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23570 states and 31041 transitions. [2025-04-26 18:39:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23570 to 23519. [2025-04-26 18:39:18,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23519 states, 23519 states have (on average 1.3174879884348825) internal successors, (in total 30986), 23518 states have internal predecessors, (30986), 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 18:39:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23519 states to 23519 states and 30986 transitions. [2025-04-26 18:39:18,847 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23519 states and 30986 transitions. [2025-04-26 18:39:18,848 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:18,848 INFO L438 stractBuchiCegarLoop]: Abstraction has 23519 states and 30986 transitions. [2025-04-26 18:39:18,848 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 18:39:18,848 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23519 states and 30986 transitions. [2025-04-26 18:39:18,979 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:18,979 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:18,979 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:18,980 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 18:39:18,980 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:18,980 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[135] 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]" "[114] $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]" "[115] 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]" "[116] 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[]" "[118] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] 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]" "[75] $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]" "[76] 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 18:39:18,980 INFO L754 eck$LassoCheckResult]: Loop: "[78] 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[]" "[80] 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]" "[81] 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]" "[82] 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]" "[83] 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]" "[84] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[85] 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]" "[86] 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]" "[87] 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 18:39:18,980 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 246911141, now seen corresponding path program 1 times [2025-04-26 18:39:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:18,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841421436] [2025-04-26 18:39:18,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:18,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:18,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 18:39:18,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 18:39:18,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:18,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:19,016 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 18:39:19,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:19,017 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841421436] [2025-04-26 18:39:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841421436] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:19,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470105618] [2025-04-26 18:39:19,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:19,017 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:19,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,017 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 2 times [2025-04-26 18:39:19,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,018 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266343761] [2025-04-26 18:39:19,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:19,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,020 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:19,021 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:19,021 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:19,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,021 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:19,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:19,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,026 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:19,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:19,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:19,060 INFO L87 Difference]: Start difference. First operand 23519 states and 30986 transitions. cyclomatic complexity: 7841 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 18:39:19,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:19,204 INFO L93 Difference]: Finished difference Result 23568 states and 31014 transitions. [2025-04-26 18:39:19,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23568 states and 31014 transitions. [2025-04-26 18:39:19,290 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 1800 [2025-04-26 18:39:19,375 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23568 states to 23568 states and 31014 transitions. [2025-04-26 18:39:19,375 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2025-04-26 18:39:19,379 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2025-04-26 18:39:19,379 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23568 states and 31014 transitions. [2025-04-26 18:39:19,379 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:19,379 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23568 states and 31014 transitions. [2025-04-26 18:39:19,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23568 states and 31014 transitions. [2025-04-26 18:39:19,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23568 to 23503. [2025-04-26 18:39:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23503 states, 23503 states have (on average 1.3166404288814193) internal successors, (in total 30945), 23502 states have internal predecessors, (30945), 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 18:39:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23503 states to 23503 states and 30945 transitions. [2025-04-26 18:39:19,607 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23503 states and 30945 transitions. [2025-04-26 18:39:19,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:19,607 INFO L438 stractBuchiCegarLoop]: Abstraction has 23503 states and 30945 transitions. [2025-04-26 18:39:19,607 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 18:39:19,608 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23503 states and 30945 transitions. [2025-04-26 18:39:19,654 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:19,654 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:19,654 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:19,654 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 18:39:19,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:19,655 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[64] 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[]" "[66] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[132] 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]" "[101] $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]" "[102] 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]" "[103] 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[]" "[105] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[135] 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]" "[114] $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]" "[115] 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]" "[116] 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[]" "[118] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[138] 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]" "[75] $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]" "[76] 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]" "[77] 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[]" "[79] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] 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]" "[88] $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]" "[89] 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 18:39:19,655 INFO L754 eck$LassoCheckResult]: Loop: "[91] 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[]" "[93] 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]" "[94] 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]" "[95] 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]" "[96] 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]" "[97] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[98] 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]" "[99] 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]" "[100] 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 18:39:19,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,655 INFO L85 PathProgramCache]: Analyzing trace with hash -105842841, now seen corresponding path program 1 times [2025-04-26 18:39:19,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916392919] [2025-04-26 18:39:19,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:19,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:19,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:19,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,659 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 18:39:19,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 18:39:19,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,663 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 1 times [2025-04-26 18:39:19,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794105067] [2025-04-26 18:39:19,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:19,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:19,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:19,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:19,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:19,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:19,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:19,669 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:19,670 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:19,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1757497256, now seen corresponding path program 1 times [2025-04-26 18:39:19,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:19,670 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654075498] [2025-04-26 18:39:19,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:19,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:19,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 18:39:19,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 18:39:19,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:19,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:19,705 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 18:39:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:19,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654075498] [2025-04-26 18:39:19,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654075498] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:19,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:19,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:19,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105721927] [2025-04-26 18:39:19,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:19,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:19,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:19,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:19,736 INFO L87 Difference]: Start difference. First operand 23503 states and 30945 transitions. cyclomatic complexity: 7816 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 18:39:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:19,896 INFO L93 Difference]: Finished difference Result 23510 states and 30951 transitions. [2025-04-26 18:39:19,896 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23510 states and 30951 transitions. [2025-04-26 18:39:19,974 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:20,058 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23510 states to 23490 states and 30931 transitions. [2025-04-26 18:39:20,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4309 [2025-04-26 18:39:20,062 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4309 [2025-04-26 18:39:20,062 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23490 states and 30931 transitions. [2025-04-26 18:39:20,063 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:20,063 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23490 states and 30931 transitions. [2025-04-26 18:39:20,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states and 30931 transitions. [2025-04-26 18:39:20,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 23488. [2025-04-26 18:39:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23488 states, 23488 states have (on average 1.316800068119891) internal successors, (in total 30929), 23487 states have internal predecessors, (30929), 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 18:39:20,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23488 states to 23488 states and 30929 transitions. [2025-04-26 18:39:20,323 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23488 states and 30929 transitions. [2025-04-26 18:39:20,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 18:39:20,323 INFO L438 stractBuchiCegarLoop]: Abstraction has 23488 states and 30929 transitions. [2025-04-26 18:39:20,323 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 18:39:20,324 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23488 states and 30929 transitions. [2025-04-26 18:39:20,372 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 18:39:20,372 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:20,372 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:20,373 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 18:39:20,373 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:20,373 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[135] 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]" "[114] $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]" "[115] 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]" "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[138] 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]" "[75] $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]" "[76] 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 18:39:20,373 INFO L754 eck$LassoCheckResult]: Loop: "[78] 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[]" "[80] 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]" "[81] 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]" "[82] 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]" "[83] 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]" "[84] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork3_log_msg#1=|v_sumThread1of1ForFork3_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork3_log_msg#1]" "[85] 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]" "[86] 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]" "[87] 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 18:39:20,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1959347044, now seen corresponding path program 1 times [2025-04-26 18:39:20,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,374 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038445186] [2025-04-26 18:39:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:20,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:20,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:20,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,378 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:20,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:20,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,383 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,383 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 3 times [2025-04-26 18:39:20,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580681236] [2025-04-26 18:39:20,383 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:20,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:20,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:20,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:20,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,386 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:20,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,392 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:20,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1935236974, now seen corresponding path program 1 times [2025-04-26 18:39:20,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:20,393 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239025958] [2025-04-26 18:39:20,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:20,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:20,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:39:20,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:39:20,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,403 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:20,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 18:39:20,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 18:39:20,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:20,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:20,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:20,648 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:20,648 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:20,648 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:20,648 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:20,648 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:20,648 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,648 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:20,648 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:20,648 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration10_Lasso [2025-04-26 18:39:20,648 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:20,649 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:20,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,653 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,682 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,684 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,686 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,687 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,689 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,691 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,693 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,695 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,697 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,698 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,700 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,702 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,704 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,706 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,708 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,710 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:20,860 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:20,861 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:20,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,863 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 18:39:20,864 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 18:39:20,866 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 18:39:20,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,876 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,877 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,879 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:20,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,888 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 18:39:20,890 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 18:39:20,890 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 18:39:20,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,900 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:20,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,900 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:20,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:20,902 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:20,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2025-04-26 18:39:20,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,910 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 18:39:20,912 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 18:39:20,913 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 18:39:20,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:20,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:20,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:20,923 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:20,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:20,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:20,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:20,940 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:39:20,940 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:20,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:20,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:20,942 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 18:39:21,000 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 18:39:21,001 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:21,016 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 18:39:21,017 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:21,017 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:21,017 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 18:39:21,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:21,025 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:21,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:21,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 18:39:21,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 18:39:21,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:21,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:21,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:21,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:21,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:21,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:21,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:21,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:21,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:21,117 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 18:39:21,118 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 18:39:21,118 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23488 states and 30929 transitions. cyclomatic complexity: 7815 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 18:39:21,303 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23488 states and 30929 transitions. cyclomatic complexity: 7815. 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 53084 states and 71686 transitions. Complement of second has 6 states. [2025-04-26 18:39:21,303 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 18:39:21,304 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 18:39:21,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-26 18:39:21,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 24 letters. Loop has 9 letters. [2025-04-26 18:39:21,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 33 letters. Loop has 9 letters. [2025-04-26 18:39:21,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,304 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 24 letters. Loop has 18 letters. [2025-04-26 18:39:21,304 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:21,304 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53084 states and 71686 transitions. [2025-04-26 18:39:21,501 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 18:39:21,628 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53084 states to 36134 states and 48610 transitions. [2025-04-26 18:39:21,628 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3598 [2025-04-26 18:39:21,633 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3706 [2025-04-26 18:39:21,633 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36134 states and 48610 transitions. [2025-04-26 18:39:21,633 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:21,633 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36134 states and 48610 transitions. [2025-04-26 18:39:21,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36134 states and 48610 transitions. [2025-04-26 18:39:21,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36134 to 35882. [2025-04-26 18:39:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35882 states, 35882 states have (on average 1.3272114151942478) internal successors, (in total 47623), 35881 states have internal predecessors, (47623), 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 18:39:21,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35882 states to 35882 states and 47623 transitions. [2025-04-26 18:39:21,975 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35882 states and 47623 transitions. [2025-04-26 18:39:21,975 INFO L438 stractBuchiCegarLoop]: Abstraction has 35882 states and 47623 transitions. [2025-04-26 18:39:21,975 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 18:39:21,975 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35882 states and 47623 transitions. [2025-04-26 18:39:22,045 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 18:39:22,046 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:22,046 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:22,046 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 18:39:22,046 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:22,047 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[135] 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]" "[114] $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]" "[115] 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]" "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[138] 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]" "[75] $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]" "[76] 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]" "[77] 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[]" "[79] sumFINAL-->sumEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[141] 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]" "[88] $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]" "[89] 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 18:39:22,047 INFO L754 eck$LassoCheckResult]: Loop: "[91] 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[]" "[93] 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]" "[94] 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]" "[95] 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]" "[96] 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]" "[97] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[98] 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]" "[99] 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]" "[100] 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 18:39:22,047 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash 613438088, now seen corresponding path program 1 times [2025-04-26 18:39:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962700850] [2025-04-26 18:39:22,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:22,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 18:39:22,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 18:39:22,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:22,079 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 18:39:22,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:39:22,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962700850] [2025-04-26 18:39:22,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962700850] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:39:22,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:39:22,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 18:39:22,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055402493] [2025-04-26 18:39:22,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:39:22,080 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:39:22,080 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:22,080 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 2 times [2025-04-26 18:39:22,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:22,080 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514692780] [2025-04-26 18:39:22,080 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:39:22,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:22,083 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:22,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:22,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:39:22,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,085 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:22,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:22,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:22,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:22,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:22,088 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:22,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:39:22,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:39:22,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:39:22,117 INFO L87 Difference]: Start difference. First operand 35882 states and 47623 transitions. cyclomatic complexity: 12294 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 18:39:22,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:39:22,266 INFO L93 Difference]: Finished difference Result 35882 states and 47486 transitions. [2025-04-26 18:39:22,266 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35882 states and 47486 transitions. [2025-04-26 18:39:22,394 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 18:39:22,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35882 states to 35882 states and 47486 transitions. [2025-04-26 18:39:22,485 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3598 [2025-04-26 18:39:22,488 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3598 [2025-04-26 18:39:22,488 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35882 states and 47486 transitions. [2025-04-26 18:39:22,488 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:39:22,488 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35882 states and 47486 transitions. [2025-04-26 18:39:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35882 states and 47486 transitions. [2025-04-26 18:39:22,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35882 to 35772. [2025-04-26 18:39:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35772 states, 35772 states have (on average 1.3243877893324387) internal successors, (in total 47376), 35771 states have internal predecessors, (47376), 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 18:39:23,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35772 states to 35772 states and 47376 transitions. [2025-04-26 18:39:23,028 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35772 states and 47376 transitions. [2025-04-26 18:39:23,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:39:23,029 INFO L438 stractBuchiCegarLoop]: Abstraction has 35772 states and 47376 transitions. [2025-04-26 18:39:23,029 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 18:39:23,029 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35772 states and 47376 transitions. [2025-04-26 18:39:23,102 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 18:39:23,103 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:39:23,103 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:39:23,103 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 18:39:23,103 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:39:23,104 INFO L752 eck$LassoCheckResult]: Stem: "[129] $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]" "[62] $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]" "[63] 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]" "[65] 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[]" "[67] 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]" "[68] 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]" "[69] 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]" "[132] 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]" "[101] $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]" "[102] 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]" "[104] 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[]" "[106] 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]" "[107] 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]" "[108] 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]" "[135] 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]" "[114] $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]" "[115] 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]" "[117] 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[]" "[119] 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]" "[120] 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]" "[121] 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]" "[138] 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]" "[75] $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]" "[76] 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]" "[78] 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[]" "[80] 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]" "[81] 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]" "[82] 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]" "[141] 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]" "[88] $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]" "[89] 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 18:39:23,104 INFO L754 eck$LassoCheckResult]: Loop: "[91] 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[]" "[93] 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]" "[94] 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]" "[95] 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]" "[96] 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]" "[97] L25-1-->L45: Formula: true InVars {} OutVars{sumThread1of1ForFork4_log_msg#1=|v_sumThread1of1ForFork4_log_msg#1_5|} AuxVars[] AssignedVars[sumThread1of1ForFork4_log_msg#1]" "[98] 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]" "[99] 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]" "[100] 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 18:39:23,104 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1964078631, now seen corresponding path program 1 times [2025-04-26 18:39:23,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:23,104 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242798873] [2025-04-26 18:39:23,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:23,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:23,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:39:23,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:39:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,109 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:23,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:39:23,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:39:23,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:23,119 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 3 times [2025-04-26 18:39:23,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:23,120 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45583587] [2025-04-26 18:39:23,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:39:23,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:23,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:23,122 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:23,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:39:23,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,122 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:23,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:23,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:23,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,125 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:23,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:23,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1151390104, now seen corresponding path program 1 times [2025-04-26 18:39:23,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:39:23,125 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747590822] [2025-04-26 18:39:23,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:39:23,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:39:23,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:39:23,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:39:23,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,131 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:39:23,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 18:39:23,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 18:39:23,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:23,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:39:23,141 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:39:23,581 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:39:23,581 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:39:23,581 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:39:23,581 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:39:23,581 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:39:23,581 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,581 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:39:23,581 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:39:23,581 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration12_Lasso [2025-04-26 18:39:23,582 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:39:23,582 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:39:23,583 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,585 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,587 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,593 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,596 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,598 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,621 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,626 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,627 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,629 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,634 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,636 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,639 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,641 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,643 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,645 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,646 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,648 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,650 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,652 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,654 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,656 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,659 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:39:23,823 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:39:23,823 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:39:23,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,827 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 18:39:23,828 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 18:39:23,829 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 18:39:23,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:23,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:23,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:23,840 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:23,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,847 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 18:39:23,848 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 18:39:23,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 18:39:23,859 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,859 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,859 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,859 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,860 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,860 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,863 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,868 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 18:39:23,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,869 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 18:39:23,870 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 18:39:23,871 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 18:39:23,881 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,881 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,881 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,881 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,882 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,882 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,884 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,889 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 18:39:23,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,891 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 18:39:23,892 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 18:39:23,893 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 18:39:23,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,905 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,907 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Ended with exit code 0 [2025-04-26 18:39:23,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,914 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 18:39:23,915 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 18:39:23,916 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 18:39:23,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,925 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,925 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,925 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,926 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,926 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,929 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Ended with exit code 0 [2025-04-26 18:39:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,936 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 18:39:23,936 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 18:39:23,937 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 18:39:23,947 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,947 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,947 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,947 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,948 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,948 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,950 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,955 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 18:39:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,957 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 18:39:23,958 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 18:39:23,959 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 18:39:23,969 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,969 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 18:39:23,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,969 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 18:39:23,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 18:39:23,971 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:23,976 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 18:39:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:23,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:23,977 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 18:39:23,978 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 18:39:23,979 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 18:39:23,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:23,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:23,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:23,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:23,992 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:23,992 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:23,998 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:39:24,004 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 18:39:24,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:24,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,006 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 18:39:24,008 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 18:39:24,009 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 18:39:24,019 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:39:24,019 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:39:24,019 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:39:24,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:39:24,022 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:39:24,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:39:24,030 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:39:24,036 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:39:24,036 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:39:24,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:39:24,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:39:24,038 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 18:39:24,039 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 18:39:24,039 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:39:24,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Ended with exit code 0 [2025-04-26 18:39:24,057 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:39:24,057 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:39:24,057 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 18:39:24,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:24,065 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:39:24,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:39:24,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 18:39:24,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 18:39:24,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:24,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:39:24,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:24,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:39:24,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:39:24,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:39:24,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:39:24,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:39:24,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:39:24,162 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 18:39:24,163 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 18:39:24,163 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35772 states and 47376 transitions. cyclomatic complexity: 12157 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 18:39:24,488 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35772 states and 47376 transitions. cyclomatic complexity: 12157. 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 68171 states and 92070 transitions. Complement of second has 6 states. [2025-04-26 18:39:24,488 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 18:39:24,489 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 18:39:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-04-26 18:39:24,489 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 31 letters. Loop has 9 letters. [2025-04-26 18:39:24,489 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,489 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 40 letters. Loop has 9 letters. [2025-04-26 18:39:24,489 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,489 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 31 letters. Loop has 18 letters. [2025-04-26 18:39:24,489 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:39:24,490 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68171 states and 92070 transitions. [2025-04-26 18:39:24,901 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:24,901 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68171 states to 0 states and 0 transitions. [2025-04-26 18:39:24,901 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:39:24,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:39:24,901 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:39:24,901 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:39:24,901 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:24,901 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:24,901 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:39:24,901 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 18:39:24,902 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:39:24,902 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:39:24,902 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:39:24,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:39:24,961 INFO L201 PluginConnector]: Adding new model array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:39:24 BoogieIcfgContainer [2025-04-26 18:39:24,961 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:39:24,961 INFO L158 Benchmark]: Toolchain (without parser) took 28393.28ms. Allocated memory was 167.8MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 93.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2025-04-26 18:39:24,961 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.24ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.48ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 90.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,962 INFO L158 Benchmark]: Boogie Preprocessor took 22.21ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:39:24,962 INFO L158 Benchmark]: RCFGBuilder took 174.39ms. Allocated memory is still 167.8MB. Free memory was 89.8MB in the beginning and 80.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:39:24,962 INFO L158 Benchmark]: BuchiAutomizer took 28148.91ms. Allocated memory was 167.8MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 80.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2025-04-26 18:39:24,963 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.24ms. Allocated memory is still 167.8MB. Free memory is still 94.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.48ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 90.9MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.21ms. Allocated memory is still 167.8MB. Free memory was 90.9MB in the beginning and 89.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 174.39ms. Allocated memory is still 167.8MB. Free memory was 89.8MB in the beginning and 80.4MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 28148.91ms. Allocated memory was 167.8MB in the beginning and 5.3GB in the end (delta: 5.2GB). Free memory was 80.2MB in the beginning and 3.6GB in the end (delta: -3.5GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 27.9s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 4.6s. Construction of modules took 0.8s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 3.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 2.3s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [5, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1444 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1439 mSDsluCounter, 1934 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1206 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1372 IncrementalHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 728 mSDtfsCounter, 1372 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc4 concLT0 SILN0 SILU3 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital86 mio100 ax100 hnf100 lsp67 ukn73 mio100 lsp50 div100 bol100 ite100 ukn100 eq204 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 54ms 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: 13.4s InitialAbstraction: Time to compute Ample Reduction [ms]: 13432, Number of transitions in reduction automaton: 7026, Number of states in reduction automaton: 5524, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (7 trivial, 5 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. 7 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 18:39:24,976 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...