/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 16:53:28,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:53:28,524 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:53:28,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:53:28,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:53:28,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:53:28,528 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:53:28,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:53:28,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:53:28,545 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:53:28,546 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:53:28,546 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:53:28,546 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:53:28,546 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:53:28,547 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:53:28,547 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:53:28,548 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:28,548 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:53:28,548 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:53:28,548 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:53:28,784 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:53:28,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:53:28,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:53:28,798 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:53:28,799 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:53:28,800 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 16:53:28,800 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 16:53:28,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:53:28,824 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:53:28,826 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:28,826 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:53:28,826 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:53:28,834 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,859 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,886 INFO L138 Inliner]: procedures = 3, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 13 [2025-04-26 16:53:28,887 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:53:28,892 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:53:28,892 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:53:28,892 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:53:28,899 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,899 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,901 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,901 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,902 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,903 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,907 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,908 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,908 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,917 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:53:28,918 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:53:28,918 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:53:28,918 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:53:28,921 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 04:53:28" (1/1) ... [2025-04-26 16:53:28,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:53:28,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:28,949 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:28,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 16:53:28,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:53:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:53:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:53:28,976 INFO L124 BoogieDeclarations]: Specification and implementation of procedure sum given in one single declaration [2025-04-26 16:53:28,976 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-04-26 16:53:28,976 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-04-26 16:53:28,977 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 16:53:29,018 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:53:29,019 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:53:29,114 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:53:29,114 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:53:29,128 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:53:29,128 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:53:29,129 INFO L201 PluginConnector]: Adding new model array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:53:29 BoogieIcfgContainer [2025-04-26 16:53:29,129 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:53:29,130 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:53:29,130 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:53:29,136 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:53:29,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:29,137 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 04:53:28" (1/2) ... [2025-04-26 16:53:29,138 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a623484 and model type array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:53:29, skipping insertion in model container [2025-04-26 16:53:29,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:53:29,138 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 04:53:29" (2/2) ... [2025-04-26 16:53:29,139 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-sum-with-log-5threads.bpl [2025-04-26 16:53:29,224 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2025-04-26 16:53:29,266 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:53:29,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:53:29,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:29,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:29,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 16:53:29,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 16:53:29,386 INFO L116 PetriNetUnfolderBase]: 5/78 cut-off events. [2025-04-26 16:53:29,389 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-26 16:53:29,396 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 16:53:29,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 88 transitions, 211 flow [2025-04-26 16:53:29,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 78 transitions, 186 flow [2025-04-26 16:53:29,404 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 89 places, 78 transitions, 186 flow [2025-04-26 16:53:29,411 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:53:30,637 WARN L140 AmpleReduction]: Number of pruned transitions: 13518 [2025-04-26 16:53:30,638 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:53:30,638 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 36 [2025-04-26 16:53:30,638 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:411 [2025-04-26 16:53:30,638 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:5076 [2025-04-26 16:53:30,638 WARN L145 AmpleReduction]: Times succ was already a loop node:524 [2025-04-26 16:53:30,638 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:82 [2025-04-26 16:53:30,638 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:53:30,655 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 16:53:30,663 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:53:30,663 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:53:30,665 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:53:30,665 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:53:30,666 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:53:30,666 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:53:30,666 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:53:30,666 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:53:30,677 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 16:53:30,766 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 4511 [2025-04-26 16:53:30,766 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:30,766 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:30,771 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:30,771 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:30,771 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:53:30,779 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 16:53:30,824 INFO L131 ngComponentsAnalysis]: Automaton has 93 accepting balls. 4511 [2025-04-26 16:53:30,824 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:30,824 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:30,825 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:53:30,825 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:30,829 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 16:53:30,830 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 16:53:30,833 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:30,834 INFO L85 PathProgramCache]: Analyzing trace with hash 155745, now seen corresponding path program 1 times [2025-04-26 16:53:30,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:30,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623688498] [2025-04-26 16:53:30,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:30,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:30,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:30,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:30,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:30,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:30,888 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:30,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:30,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:30,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:30,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:30,905 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:30,908 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1350191588, now seen corresponding path program 1 times [2025-04-26 16:53:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:30,909 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415202362] [2025-04-26 16:53:30,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:30,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:30,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:30,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:30,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:30,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:30,964 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:30,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:30,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:30,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:30,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:30,983 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:30,990 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:30,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1487820164, now seen corresponding path program 1 times [2025-04-26 16:53:30,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:30,990 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790151098] [2025-04-26 16:53:30,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:30,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:30,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:31,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:31,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:31,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:31,029 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:31,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-26 16:53:31,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-26 16:53:31,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:31,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:31,047 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:31,153 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:31,153 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:31,153 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:31,153 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:31,154 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:31,154 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,154 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:31,154 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:31,154 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:53:31,154 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:31,154 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:31,168 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:31,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:31,206 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:31,274 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:31,277 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:31,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:31,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 16:53:31,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:31,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:31,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:31,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:31,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:31,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:31,303 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:31,307 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:31,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2025-04-26 16:53:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:31,316 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:31,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 16:53:31,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:31,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:31,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:31,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:31,330 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:31,330 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:31,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:31,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:31,332 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:31,338 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 16:53:31,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:31,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:31,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 16:53:31,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:31,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:31,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:31,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:31,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:31,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:31,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:31,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:31,355 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:31,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:31,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:31,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:31,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 16:53:31,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:31,377 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:31,377 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:31,377 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:31,377 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:31,381 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:31,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:31,387 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:31,397 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:31,397 INFO L437 ModelExtractionUtils]: 4 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2025-04-26 16:53:31,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:31,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:31,402 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:31,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 16:53:31,403 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:31,422 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 16:53:31,423 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:31,423 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:31,423 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork0_i#1, N) = -1*sumThread1of1ForFork0_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:31,429 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 16:53:31,437 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:31,456 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:31,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:53:31,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:53:31,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:31,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:31,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:31,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:31,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:31,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:31,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:31,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:31,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:31,579 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:31,589 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 16:53:31,805 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 16:53:31,806 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:31,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (in total 12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2025-04-26 16:53:31,816 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 9 letters. [2025-04-26 16:53:31,816 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:31,816 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 12 letters. Loop has 9 letters. [2025-04-26 16:53:31,817 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:31,817 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 85 transitions. Stem has 3 letters. Loop has 18 letters. [2025-04-26 16:53:31,817 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:31,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11049 states and 14379 transitions. [2025-04-26 16:53:31,885 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 16:53:31,954 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11049 states to 8704 states and 11402 transitions. [2025-04-26 16:53:31,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5079 [2025-04-26 16:53:31,965 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5200 [2025-04-26 16:53:31,966 INFO L74 IsDeterministic]: Start isDeterministic. Operand 8704 states and 11402 transitions. [2025-04-26 16:53:31,968 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:31,968 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8704 states and 11402 transitions. [2025-04-26 16:53:32,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states and 11402 transitions. [2025-04-26 16:53:32,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 8584. [2025-04-26 16:53:32,199 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 16:53:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8584 states to 8584 states and 10959 transitions. [2025-04-26 16:53:32,223 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8584 states and 10959 transitions. [2025-04-26 16:53:32,224 INFO L438 stractBuchiCegarLoop]: Abstraction has 8584 states and 10959 transitions. [2025-04-26 16:53:32,224 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:53:32,224 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8584 states and 10959 transitions. [2025-04-26 16:53:32,255 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 16:53:32,255 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:32,255 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:32,256 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:32,256 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:32,256 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 16:53:32,256 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 16:53:32,257 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:32,257 INFO L85 PathProgramCache]: Analyzing trace with hash 732270882, now seen corresponding path program 1 times [2025-04-26 16:53:32,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:32,257 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272291291] [2025-04-26 16:53:32,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:32,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:32,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:32,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:32,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:32,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:32,262 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:32,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:53:32,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:53:32,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:32,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:32,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:32,265 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash 235730571, now seen corresponding path program 1 times [2025-04-26 16:53:32,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:32,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339815424] [2025-04-26 16:53:32,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:32,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:32,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:32,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:32,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:32,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:32,272 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:32,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:32,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:32,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:32,277 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:32,277 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1116871306, now seen corresponding path program 1 times [2025-04-26 16:53:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:32,277 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825138702] [2025-04-26 16:53:32,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:32,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:32,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:32,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:32,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:32,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:32,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:32,355 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825138702] [2025-04-26 16:53:32,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825138702] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:32,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:32,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445935435] [2025-04-26 16:53:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:32,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:32,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:32,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:32,407 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 16:53:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:32,661 INFO L93 Difference]: Finished difference Result 9154 states and 11635 transitions. [2025-04-26 16:53:32,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9154 states and 11635 transitions. [2025-04-26 16:53:32,703 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 4072 [2025-04-26 16:53:32,751 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9154 states to 9154 states and 11635 transitions. [2025-04-26 16:53:32,751 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5648 [2025-04-26 16:53:32,757 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5648 [2025-04-26 16:53:32,758 INFO L74 IsDeterministic]: Start isDeterministic. Operand 9154 states and 11635 transitions. [2025-04-26 16:53:32,758 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:32,758 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9154 states and 11635 transitions. [2025-04-26 16:53:32,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9154 states and 11635 transitions. [2025-04-26 16:53:32,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9154 to 8589. [2025-04-26 16:53:32,896 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 16:53:32,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8589 states to 8589 states and 10964 transitions. [2025-04-26 16:53:32,986 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8589 states and 10964 transitions. [2025-04-26 16:53:32,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:32,987 INFO L438 stractBuchiCegarLoop]: Abstraction has 8589 states and 10964 transitions. [2025-04-26 16:53:32,987 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:53:32,987 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8589 states and 10964 transitions. [2025-04-26 16:53:33,014 INFO L131 ngComponentsAnalysis]: Automaton has 110 accepting balls. 3618 [2025-04-26 16:53:33,014 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:33,014 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:33,014 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:33,014 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:33,015 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 16:53:33,015 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 16:53:33,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 193787297, now seen corresponding path program 1 times [2025-04-26 16:53:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910497260] [2025-04-26 16:53:33,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:33,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:33,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:33,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:33,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,037 INFO L85 PathProgramCache]: Analyzing trace with hash 235730571, now seen corresponding path program 2 times [2025-04-26 16:53:33,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034772505] [2025-04-26 16:53:33,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:33,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,042 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:33,046 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:33,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:33,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:33,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:33,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,059 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,060 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,060 INFO L85 PathProgramCache]: Analyzing trace with hash 925521131, now seen corresponding path program 1 times [2025-04-26 16:53:33,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:33,060 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7155284] [2025-04-26 16:53:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:33,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:33,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:33,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,080 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:33,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-26 16:53:33,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-26 16:53:33,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:33,096 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:33,209 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:33,209 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:33,209 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:33,209 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:33,209 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:33,209 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,209 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:33,209 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:33,209 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:53:33,209 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:33,209 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:33,210 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,214 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,218 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,246 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,249 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,251 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:33,353 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:33,353 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:33,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,357 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 16:53:33,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,369 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,369 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,369 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,373 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,378 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-04-26 16:53:33,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,386 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 16:53:33,389 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,400 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:33,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,400 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:33,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:33,401 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,409 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 16:53:33,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,428 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,428 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,428 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,428 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,436 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,448 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 16:53:33,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,461 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,462 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,462 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,462 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,467 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,473 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,479 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 16:53:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,481 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,484 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 16:53:33,485 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:33,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:33,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:33,497 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:33,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,506 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 16:53:33,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:33,520 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:33,521 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:33,521 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:33,521 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:33,524 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:33,525 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:33,530 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:33,541 INFO L436 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2025-04-26 16:53:33,541 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:33,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:33,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:33,543 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:33,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 16:53:33,546 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:33,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 16:53:33,563 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:33,563 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:33,563 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork1_i#1, N) = -1*sumThread1of1ForFork1_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:33,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:33,572 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:33,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:33,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-26 16:53:33,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-26 16:53:33,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:33,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:33,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:33,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:33,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:33,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:33,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:33,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:33,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:33,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:33,681 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:33,682 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 16:53:33,850 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 16:53:33,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (in total 19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-26 16:53:33,852 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 9 letters. [2025-04-26 16:53:33,852 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:33,852 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 19 letters. Loop has 9 letters. [2025-04-26 16:53:33,853 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:33,853 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 87 transitions. Stem has 10 letters. Loop has 18 letters. [2025-04-26 16:53:33,854 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:33,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17190 states and 22596 transitions. [2025-04-26 16:53:33,935 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 16:53:34,071 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17190 states to 13843 states and 18261 transitions. [2025-04-26 16:53:34,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4714 [2025-04-26 16:53:34,076 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4834 [2025-04-26 16:53:34,077 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13843 states and 18261 transitions. [2025-04-26 16:53:34,077 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:34,077 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13843 states and 18261 transitions. [2025-04-26 16:53:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13843 states and 18261 transitions. [2025-04-26 16:53:34,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13843 to 13722. [2025-04-26 16:53:34,300 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 16:53:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13722 states to 13722 states and 17819 transitions. [2025-04-26 16:53:34,342 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13722 states and 17819 transitions. [2025-04-26 16:53:34,342 INFO L438 stractBuchiCegarLoop]: Abstraction has 13722 states and 17819 transitions. [2025-04-26 16:53:34,342 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:53:34,343 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13722 states and 17819 transitions. [2025-04-26 16:53:34,386 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 16:53:34,386 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:34,386 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:34,387 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:34,387 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:34,387 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 16:53:34,388 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 16:53:34,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:34,388 INFO L85 PathProgramCache]: Analyzing trace with hash 34540804, now seen corresponding path program 1 times [2025-04-26 16:53:34,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:34,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928150169] [2025-04-26 16:53:34,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:34,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:34,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:34,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:34,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:34,394 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 16:53:34,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 16:53:34,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:34,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:34,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:34,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 1 times [2025-04-26 16:53:34,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:34,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467592549] [2025-04-26 16:53:34,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:34,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:34,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:34,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:34,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:34,411 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:34,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:34,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:34,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:34,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:34,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:34,420 INFO L85 PathProgramCache]: Analyzing trace with hash 419370613, now seen corresponding path program 1 times [2025-04-26 16:53:34,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:34,420 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203348896] [2025-04-26 16:53:34,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:34,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:53:34,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:53:34,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:34,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:34,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:34,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:34,498 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203348896] [2025-04-26 16:53:34,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203348896] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:34,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:34,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:34,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709572265] [2025-04-26 16:53:34,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:34,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:34,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:34,539 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 16:53:34,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:34,754 INFO L93 Difference]: Finished difference Result 13923 states and 18048 transitions. [2025-04-26 16:53:34,755 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13923 states and 18048 transitions. [2025-04-26 16:53:34,801 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 2867 [2025-04-26 16:53:34,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13923 states to 13923 states and 18048 transitions. [2025-04-26 16:53:34,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4912 [2025-04-26 16:53:34,864 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4912 [2025-04-26 16:53:34,864 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13923 states and 18048 transitions. [2025-04-26 16:53:34,864 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:34,864 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13923 states and 18048 transitions. [2025-04-26 16:53:34,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13923 states and 18048 transitions. [2025-04-26 16:53:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13923 to 13728. [2025-04-26 16:53:35,166 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 16:53:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13728 states to 13728 states and 17825 transitions. [2025-04-26 16:53:35,187 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13728 states and 17825 transitions. [2025-04-26 16:53:35,187 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:35,189 INFO L438 stractBuchiCegarLoop]: Abstraction has 13728 states and 17825 transitions. [2025-04-26 16:53:35,189 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:53:35,189 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13728 states and 17825 transitions. [2025-04-26 16:53:35,218 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 16:53:35,218 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:35,218 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:35,219 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:35,219 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:35,219 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 16:53:35,219 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 16:53:35,220 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:35,220 INFO L85 PathProgramCache]: Analyzing trace with hash 2011013093, now seen corresponding path program 1 times [2025-04-26 16:53:35,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:35,220 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306339029] [2025-04-26 16:53:35,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:35,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-26 16:53:35,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-26 16:53:35,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:35,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:35,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:35,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:35,248 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306339029] [2025-04-26 16:53:35,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306339029] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:35,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:35,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:35,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575560096] [2025-04-26 16:53:35,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:35,249 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:35,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 2 times [2025-04-26 16:53:35,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:35,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070789359] [2025-04-26 16:53:35,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:35,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:35,251 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:35,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:35,253 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:35,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:35,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:35,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:35,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:35,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:35,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:35,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:35,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:35,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:35,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:35,304 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 16:53:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:35,444 INFO L93 Difference]: Finished difference Result 13921 states and 18041 transitions. [2025-04-26 16:53:35,444 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13921 states and 18041 transitions. [2025-04-26 16:53:35,567 INFO L131 ngComponentsAnalysis]: Automaton has 141 accepting balls. 2867 [2025-04-26 16:53:35,623 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13921 states to 13921 states and 18041 transitions. [2025-04-26 16:53:35,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4912 [2025-04-26 16:53:35,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4912 [2025-04-26 16:53:35,629 INFO L74 IsDeterministic]: Start isDeterministic. Operand 13921 states and 18041 transitions. [2025-04-26 16:53:35,629 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:35,629 INFO L218 hiAutomatonCegarLoop]: Abstraction has 13921 states and 18041 transitions. [2025-04-26 16:53:35,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13921 states and 18041 transitions. [2025-04-26 16:53:35,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13921 to 13726. [2025-04-26 16:53:35,889 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 16:53:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13726 states to 13726 states and 17818 transitions. [2025-04-26 16:53:35,926 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13726 states and 17818 transitions. [2025-04-26 16:53:35,926 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:35,929 INFO L438 stractBuchiCegarLoop]: Abstraction has 13726 states and 17818 transitions. [2025-04-26 16:53:35,929 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 16:53:35,929 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13726 states and 17818 transitions. [2025-04-26 16:53:35,985 INFO L131 ngComponentsAnalysis]: Automaton has 125 accepting balls. 2700 [2025-04-26 16:53:35,985 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:35,985 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:35,986 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:35,986 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:35,987 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 16:53:35,988 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 16:53:35,988 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash 738417540, now seen corresponding path program 1 times [2025-04-26 16:53:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:35,988 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670121935] [2025-04-26 16:53:35,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:35,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:35,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:35,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:35,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:35,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:35,999 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:36,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:36,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:36,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:36,017 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1567412200, now seen corresponding path program 3 times [2025-04-26 16:53:36,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:36,017 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730382071] [2025-04-26 16:53:36,017 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:36,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:36,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:36,030 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:36,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:36,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:36,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:36,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:36,039 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1723537397, now seen corresponding path program 1 times [2025-04-26 16:53:36,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:36,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218111976] [2025-04-26 16:53:36,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:36,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:36,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:36,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:36,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,060 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:36,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-26 16:53:36,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-26 16:53:36,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:36,077 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:36,404 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:36,405 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:36,405 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:36,405 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:36,405 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:36,405 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,405 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:36,405 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:36,405 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration6_Lasso [2025-04-26 16:53:36,405 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:36,405 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:36,407 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,416 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,418 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,420 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,450 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,452 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,455 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,457 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,459 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,461 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:36,584 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:36,584 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:36,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,588 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 16:53:36,590 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:36,601 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:36,601 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:36,601 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:36,601 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:36,603 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:36,603 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:36,606 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:36,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 16:53:36,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,614 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 16:53:36,617 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:36,627 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:36,627 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:36,627 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:36,627 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:36,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:36,630 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:36,632 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:36,639 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:36,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,641 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 16:53:36,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:36,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:36,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:36,655 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:36,655 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:36,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:36,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:36,660 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:36,666 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 16:53:36,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,669 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 16:53:36,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:36,681 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:36,681 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:36,681 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:36,681 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:36,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:36,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:36,687 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:36,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 16:53:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,696 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 16:53:36,698 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:36,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:36,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:36,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:36,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:36,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:36,712 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:36,717 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:36,725 INFO L436 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2025-04-26 16:53:36,725 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:53:36,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:36,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:36,727 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:36,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 16:53:36,730 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:36,748 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 16:53:36,748 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:36,748 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:36,748 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork2_i#1) = 1*N - 1*sumThread1of1ForFork2_i#1 Supporting invariants [] [2025-04-26 16:53:36,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:36,757 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:36,769 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:36,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-26 16:53:36,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-26 16:53:36,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:36,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:36,782 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:36,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:36,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:36,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:36,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:36,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:36,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:36,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:36,861 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:36,861 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 16:53:37,035 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 16:53:37,036 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:37,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (in total 26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2025-04-26 16:53:37,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 17 letters. Loop has 9 letters. [2025-04-26 16:53:37,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:37,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 26 letters. Loop has 9 letters. [2025-04-26 16:53:37,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:37,037 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 107 transitions. Stem has 17 letters. Loop has 18 letters. [2025-04-26 16:53:37,037 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:37,038 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30626 states and 40922 transitions. [2025-04-26 16:53:37,165 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:37,351 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30626 states to 23703 states and 31704 transitions. [2025-04-26 16:53:37,352 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4319 [2025-04-26 16:53:37,355 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4436 [2025-04-26 16:53:37,355 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23703 states and 31704 transitions. [2025-04-26 16:53:37,355 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:37,355 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23703 states and 31704 transitions. [2025-04-26 16:53:37,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23703 states and 31704 transitions. [2025-04-26 16:53:37,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23703 to 23513. [2025-04-26 16:53:37,565 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 16:53:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23513 states to 23513 states and 30980 transitions. [2025-04-26 16:53:37,602 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23513 states and 30980 transitions. [2025-04-26 16:53:37,602 INFO L438 stractBuchiCegarLoop]: Abstraction has 23513 states and 30980 transitions. [2025-04-26 16:53:37,602 INFO L340 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2025-04-26 16:53:37,602 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23513 states and 30980 transitions. [2025-04-26 16:53:37,653 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:37,653 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:37,653 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:37,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] [2025-04-26 16:53:37,654 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:37,654 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 16:53:37,654 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 16:53:37,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,655 INFO L85 PathProgramCache]: Analyzing trace with hash 733925157, now seen corresponding path program 1 times [2025-04-26 16:53:37,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685530701] [2025-04-26 16:53:37,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:37,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:37,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:37,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:37,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-26 16:53:37,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-26 16:53:37,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:37,662 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 1 times [2025-04-26 16:53:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,662 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639240069] [2025-04-26 16:53:37,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:37,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:37,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,665 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:37,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:37,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:37,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:37,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:37,668 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:37,668 INFO L85 PathProgramCache]: Analyzing trace with hash -875660083, now seen corresponding path program 1 times [2025-04-26 16:53:37,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:37,668 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993655349] [2025-04-26 16:53:37,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:37,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:37,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-26 16:53:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-26 16:53:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:37,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:37,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993655349] [2025-04-26 16:53:37,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993655349] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:37,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:37,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:37,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414886036] [2025-04-26 16:53:37,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:37,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:37,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:37,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:37,873 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 16:53:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:38,031 INFO L93 Difference]: Finished difference Result 23570 states and 31041 transitions. [2025-04-26 16:53:38,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23570 states and 31041 transitions. [2025-04-26 16:53:38,122 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 1800 [2025-04-26 16:53:38,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23570 states to 23570 states and 31041 transitions. [2025-04-26 16:53:38,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2025-04-26 16:53:38,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2025-04-26 16:53:38,205 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23570 states and 31041 transitions. [2025-04-26 16:53:38,205 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:38,205 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23570 states and 31041 transitions. [2025-04-26 16:53:38,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23570 states and 31041 transitions. [2025-04-26 16:53:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23570 to 23519. [2025-04-26 16:53:38,574 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 16:53:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23519 states to 23519 states and 30986 transitions. [2025-04-26 16:53:38,624 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23519 states and 30986 transitions. [2025-04-26 16:53:38,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:38,625 INFO L438 stractBuchiCegarLoop]: Abstraction has 23519 states and 30986 transitions. [2025-04-26 16:53:38,625 INFO L340 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2025-04-26 16:53:38,625 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23519 states and 30986 transitions. [2025-04-26 16:53:38,700 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:38,700 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:38,701 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:38,701 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:38,701 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:38,702 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 16:53:38,702 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 16:53:38,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash 246911141, now seen corresponding path program 1 times [2025-04-26 16:53:38,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:38,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239025958] [2025-04-26 16:53:38,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:38,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-26 16:53:38,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-26 16:53:38,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:38,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:38,799 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239025958] [2025-04-26 16:53:38,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239025958] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:38,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:38,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301287138] [2025-04-26 16:53:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:38,799 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:38,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:38,800 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 2 times [2025-04-26 16:53:38,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:38,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265547814] [2025-04-26 16:53:38,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:38,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:38,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:38,816 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:38,816 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:38,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,816 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:38,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:38,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:38,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:38,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:38,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:38,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:38,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:38,884 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 16:53:39,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:39,196 INFO L93 Difference]: Finished difference Result 23568 states and 31014 transitions. [2025-04-26 16:53:39,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23568 states and 31014 transitions. [2025-04-26 16:53:39,273 INFO L131 ngComponentsAnalysis]: Automaton has 131 accepting balls. 1800 [2025-04-26 16:53:39,343 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23568 states to 23568 states and 31014 transitions. [2025-04-26 16:53:39,343 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2025-04-26 16:53:39,347 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2025-04-26 16:53:39,347 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23568 states and 31014 transitions. [2025-04-26 16:53:39,347 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:39,347 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23568 states and 31014 transitions. [2025-04-26 16:53:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23568 states and 31014 transitions. [2025-04-26 16:53:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23568 to 23503. [2025-04-26 16:53:39,544 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 16:53:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23503 states to 23503 states and 30945 transitions. [2025-04-26 16:53:39,699 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23503 states and 30945 transitions. [2025-04-26 16:53:39,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:39,700 INFO L438 stractBuchiCegarLoop]: Abstraction has 23503 states and 30945 transitions. [2025-04-26 16:53:39,700 INFO L340 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2025-04-26 16:53:39,700 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23503 states and 30945 transitions. [2025-04-26 16:53:39,756 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:39,756 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:39,756 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:39,757 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:39,757 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:39,757 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 16:53:39,757 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 16:53:39,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,758 INFO L85 PathProgramCache]: Analyzing trace with hash -105842841, now seen corresponding path program 1 times [2025-04-26 16:53:39,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982255061] [2025-04-26 16:53:39,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,762 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-26 16:53:39,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-26 16:53:39,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 1 times [2025-04-26 16:53:39,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910332200] [2025-04-26 16:53:39,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:39,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:39,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,772 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:39,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:39,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:39,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:39,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:39,779 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:39,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1757497256, now seen corresponding path program 1 times [2025-04-26 16:53:39,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:39,779 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526565079] [2025-04-26 16:53:39,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:39,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:39,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-26 16:53:39,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-26 16:53:39,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:39,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:39,831 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526565079] [2025-04-26 16:53:39,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526565079] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:39,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:39,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:39,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31906662] [2025-04-26 16:53:39,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:39,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:39,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:39,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:39,869 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 16:53:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:40,061 INFO L93 Difference]: Finished difference Result 23510 states and 30951 transitions. [2025-04-26 16:53:40,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23510 states and 30951 transitions. [2025-04-26 16:53:40,151 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:40,230 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23510 states to 23490 states and 30931 transitions. [2025-04-26 16:53:40,230 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4309 [2025-04-26 16:53:40,235 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4309 [2025-04-26 16:53:40,235 INFO L74 IsDeterministic]: Start isDeterministic. Operand 23490 states and 30931 transitions. [2025-04-26 16:53:40,235 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:40,235 INFO L218 hiAutomatonCegarLoop]: Abstraction has 23490 states and 30931 transitions. [2025-04-26 16:53:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23490 states and 30931 transitions. [2025-04-26 16:53:40,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23490 to 23488. [2025-04-26 16:53:40,608 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 16:53:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23488 states to 23488 states and 30929 transitions. [2025-04-26 16:53:40,639 INFO L240 hiAutomatonCegarLoop]: Abstraction has 23488 states and 30929 transitions. [2025-04-26 16:53:40,639 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-26 16:53:40,640 INFO L438 stractBuchiCegarLoop]: Abstraction has 23488 states and 30929 transitions. [2025-04-26 16:53:40,640 INFO L340 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2025-04-26 16:53:40,640 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23488 states and 30929 transitions. [2025-04-26 16:53:40,684 INFO L131 ngComponentsAnalysis]: Automaton has 126 accepting balls. 1755 [2025-04-26 16:53:40,685 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:40,685 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:40,685 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,685 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:40,686 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 16:53:40,686 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 16:53:40,686 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1959347044, now seen corresponding path program 1 times [2025-04-26 16:53:40,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,686 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306943116] [2025-04-26 16:53:40,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:40,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:40,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,691 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:40,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:40,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,695 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,695 INFO L85 PathProgramCache]: Analyzing trace with hash -452951183, now seen corresponding path program 3 times [2025-04-26 16:53:40,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,695 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077035386] [2025-04-26 16:53:40,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:40,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,697 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:40,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:40,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:40,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,699 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:40,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:40,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,701 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:40,701 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:40,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1935236974, now seen corresponding path program 1 times [2025-04-26 16:53:40,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:40,701 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373644933] [2025-04-26 16:53:40,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:40,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:40,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:53:40,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:53:40,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,707 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:40,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-26 16:53:40,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-26 16:53:40,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:40,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:40,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:41,073 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:41,073 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:41,073 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:41,073 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:41,073 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:41,073 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,073 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:41,073 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:41,073 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration10_Lasso [2025-04-26 16:53:41,073 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:41,073 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:41,075 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,110 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,112 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,114 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,116 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,118 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,120 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,122 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,124 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,127 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,129 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,130 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,132 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,134 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,136 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,138 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,140 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:41,313 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:41,313 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:41,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,315 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2025-04-26 16:53:41,318 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:41,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:41,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:41,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:41,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:41,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:41,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:41,333 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:41,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2025-04-26 16:53:41,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,341 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2025-04-26 16:53:41,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:41,354 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:41,355 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:41,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:41,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:41,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:41,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:41,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:41,357 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:41,363 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:41,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,365 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2025-04-26 16:53:41,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:41,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:41,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:41,379 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:41,379 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:41,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:41,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:41,386 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:41,396 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 16:53:41,397 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:41,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:41,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:41,400 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:41,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2025-04-26 16:53:41,401 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:41,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Ended with exit code 0 [2025-04-26 16:53:41,418 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:41,418 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:41,418 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(sumThread1of1ForFork3_i#1, N) = -1*sumThread1of1ForFork3_i#1 + 1*N Supporting invariants [] [2025-04-26 16:53:41,424 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 16:53:41,426 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:41,435 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:41,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-26 16:53:41,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-26 16:53:41,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:41,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:41,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:41,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:41,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:41,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:41,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:41,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:41,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:41,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:41,534 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 16:53:41,835 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 16:53:41,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (in total 33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 113 transitions. [2025-04-26 16:53:41,836 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 24 letters. Loop has 9 letters. [2025-04-26 16:53:41,836 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,836 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 33 letters. Loop has 9 letters. [2025-04-26 16:53:41,836 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,836 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 113 transitions. Stem has 24 letters. Loop has 18 letters. [2025-04-26 16:53:41,836 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:41,836 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53084 states and 71686 transitions. [2025-04-26 16:53:42,060 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 16:53:42,182 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53084 states to 36134 states and 48610 transitions. [2025-04-26 16:53:42,182 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3598 [2025-04-26 16:53:42,186 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3706 [2025-04-26 16:53:42,186 INFO L74 IsDeterministic]: Start isDeterministic. Operand 36134 states and 48610 transitions. [2025-04-26 16:53:42,186 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:42,186 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36134 states and 48610 transitions. [2025-04-26 16:53:42,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36134 states and 48610 transitions. [2025-04-26 16:53:42,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36134 to 35882. [2025-04-26 16:53:42,647 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 16:53:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35882 states to 35882 states and 47623 transitions. [2025-04-26 16:53:42,710 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35882 states and 47623 transitions. [2025-04-26 16:53:42,710 INFO L438 stractBuchiCegarLoop]: Abstraction has 35882 states and 47623 transitions. [2025-04-26 16:53:42,710 INFO L340 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2025-04-26 16:53:42,711 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35882 states and 47623 transitions. [2025-04-26 16:53:42,812 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 16:53:42,812 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:42,812 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:42,813 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,813 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:42,813 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 16:53:42,813 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 16:53:42,814 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,814 INFO L85 PathProgramCache]: Analyzing trace with hash 613438088, now seen corresponding path program 1 times [2025-04-26 16:53:42,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,814 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089981204] [2025-04-26 16:53:42,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:42,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-26 16:53:42,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-26 16:53:42,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:42,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:53:42,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089981204] [2025-04-26 16:53:42,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089981204] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:53:42,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:53:42,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-26 16:53:42,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660266848] [2025-04-26 16:53:42,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:53:42,854 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 16:53:42,854 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:42,854 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 2 times [2025-04-26 16:53:42,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:42,854 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24775474] [2025-04-26 16:53:42,854 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:53:42,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:42,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:42,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:42,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:53:42,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:42,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:42,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:42,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:42,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:42,862 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:53:42,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 16:53:42,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-26 16:53:42,896 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 16:53:43,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:53:43,176 INFO L93 Difference]: Finished difference Result 35882 states and 47486 transitions. [2025-04-26 16:53:43,177 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35882 states and 47486 transitions. [2025-04-26 16:53:43,299 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 16:53:43,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35882 states to 35882 states and 47486 transitions. [2025-04-26 16:53:43,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3598 [2025-04-26 16:53:43,421 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3598 [2025-04-26 16:53:43,421 INFO L74 IsDeterministic]: Start isDeterministic. Operand 35882 states and 47486 transitions. [2025-04-26 16:53:43,421 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:53:43,421 INFO L218 hiAutomatonCegarLoop]: Abstraction has 35882 states and 47486 transitions. [2025-04-26 16:53:43,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35882 states and 47486 transitions. [2025-04-26 16:53:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35882 to 35772. [2025-04-26 16:53:43,851 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 16:53:43,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35772 states to 35772 states and 47376 transitions. [2025-04-26 16:53:43,909 INFO L240 hiAutomatonCegarLoop]: Abstraction has 35772 states and 47376 transitions. [2025-04-26 16:53:43,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:53:43,910 INFO L438 stractBuchiCegarLoop]: Abstraction has 35772 states and 47376 transitions. [2025-04-26 16:53:43,910 INFO L340 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2025-04-26 16:53:43,910 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35772 states and 47376 transitions. [2025-04-26 16:53:43,988 INFO L131 ngComponentsAnalysis]: Automaton has 89 accepting balls. 801 [2025-04-26 16:53:43,988 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:53:43,988 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:53:43,988 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:43,988 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:53:43,989 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 16:53:43,989 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 16:53:43,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:43,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1964078631, now seen corresponding path program 1 times [2025-04-26 16:53:43,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:43,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025463082] [2025-04-26 16:53:43,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:43,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:43,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:53:43,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:53:43,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:43,994 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:43,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:53:43,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:53:43,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,000 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,000 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2038873342, now seen corresponding path program 3 times [2025-04-26 16:53:44,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,000 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325433165] [2025-04-26 16:53:44,000 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 16:53:44,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:44,004 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:44,004 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 16:53:44,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,004 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:44,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:44,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,007 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1151390104, now seen corresponding path program 1 times [2025-04-26 16:53:44,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:53:44,007 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648656069] [2025-04-26 16:53:44,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:53:44,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:53:44,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:53:44,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:53:44,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,013 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:53:44,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-26 16:53:44,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-26 16:53:44,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:44,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:53:44,020 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:53:44,548 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:53:44,548 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:53:44,548 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:53:44,548 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:53:44,548 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:53:44,548 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,548 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:53:44,548 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:53:44,548 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-sum-with-log-5threads.bpl_petrified1_Iteration12_Lasso [2025-04-26 16:53:44,548 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:53:44,549 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:53:44,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,554 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,556 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,559 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,560 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,563 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,566 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,590 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,595 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,597 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,599 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,600 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,602 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,604 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,605 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,607 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,608 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,609 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,611 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,612 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,614 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,618 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,619 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,623 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,631 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:53:44,813 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:53:44,813 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:53:44,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,815 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2025-04-26 16:53:44,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:44,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,832 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:44,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:44,834 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Ended with exit code 0 [2025-04-26 16:53:44,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,843 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2025-04-26 16:53:44,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,855 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,855 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,855 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,859 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,864 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2025-04-26 16:53:44,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,866 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2025-04-26 16:53:44,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,879 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,883 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,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 16:53:44,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,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 16:53:44,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2025-04-26 16:53:44,892 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,902 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,902 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,902 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,902 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,903 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,904 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,906 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,913 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 16:53:44,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,915 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2025-04-26 16:53:44,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,929 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,929 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,929 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,930 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,932 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:44,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,940 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2025-04-26 16:53:44,941 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,953 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:44,953 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:44,955 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,960 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Ended with exit code 0 [2025-04-26 16:53:44,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,962 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2025-04-26 16:53:44,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-04-26 16:53:44,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-04-26 16:53:44,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-04-26 16:53:44,977 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:44,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2025-04-26 16:53:44,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:44,984 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:44,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2025-04-26 16:53:44,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:44,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:44,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:44,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:44,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:44,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,000 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,006 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:53:45,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Ended with exit code 0 [2025-04-26 16:53:45,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,015 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2025-04-26 16:53:45,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:53:45,028 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:53:45,029 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:53:45,029 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:53:45,029 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:53:45,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:53:45,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:53:45,034 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:53:45,042 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:53:45,042 INFO L437 ModelExtractionUtils]: 2 out of 10 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:53:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:53:45,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:53:45,044 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 16:53:45,047 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:53:45,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2025-04-26 16:53:45,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2025-04-26 16:53:45,066 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:53:45,066 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:53:45,066 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, sumThread1of1ForFork4_i#1) = 1*N - 1*sumThread1of1ForFork4_i#1 Supporting invariants [] [2025-04-26 16:53:45,072 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 16:53:45,074 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 16:53:45,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:53:45,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-26 16:53:45,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-26 16:53:45,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:53:45,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:53:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:53:45,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:53:45,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:53:45,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:53:45,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 16:53:45,178 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2025-04-26 16:53:45,178 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 16:53:45,581 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 16:53:45,581 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:53:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 10.0) internal successors, (in total 40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 16:53:45,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2025-04-26 16:53:45,582 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 31 letters. Loop has 9 letters. [2025-04-26 16:53:45,582 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,582 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 40 letters. Loop has 9 letters. [2025-04-26 16:53:45,582 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,583 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 121 transitions. Stem has 31 letters. Loop has 18 letters. [2025-04-26 16:53:45,583 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:53:45,583 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68171 states and 92070 transitions. [2025-04-26 16:53:45,946 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:45,947 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68171 states to 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 16:53:45,947 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 16:53:45,947 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 16:53:45,947 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L340 stractBuchiCegarLoop]: ======== Iteration 13 ============ [2025-04-26 16:53:45,947 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 16:53:45,947 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 16:53:45,947 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 16:53:45,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 16:53:45,964 INFO L201 PluginConnector]: Adding new model array-sum-with-log-5threads.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:53:45 BoogieIcfgContainer [2025-04-26 16:53:45,964 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:53:45,965 INFO L158 Benchmark]: Toolchain (without parser) took 17141.17ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 95.0MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 859.7MB. Max. memory is 8.0GB. [2025-04-26 16:53:45,965 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:45,965 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.40ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 92.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:53:45,965 INFO L158 Benchmark]: Boogie Preprocessor took 25.27ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.6MB in the end (delta: 990.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 16:53:45,966 INFO L158 Benchmark]: RCFGBuilder took 211.57ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 81.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 16:53:45,966 INFO L158 Benchmark]: BuchiAutomizer took 16834.62ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 81.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 847.1MB. Max. memory is 8.0GB. [2025-04-26 16:53:45,967 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.18ms. Allocated memory is still 167.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.40ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 92.5MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 25.27ms. Allocated memory is still 167.8MB. Free memory was 92.5MB in the beginning and 91.6MB in the end (delta: 990.9kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 211.57ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 81.9MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 16834.62ms. Allocated memory was 167.8MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 81.8MB in the beginning and 3.4GB in the end (delta: -3.4GB). Peak memory consumption was 847.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 16.6s and 13 iterations. TraceHistogramMax:1. Analysis of lassos took 4.7s. Construction of modules took 0.7s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 11. Automata minimization 3.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 1866 StatesRemovedByMinimization, 11 NontrivialMinimizations. Non-live state removal took 2.4s 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, 1440 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1435 mSDsluCounter, 1934 SdHoareTripleChecker+Invalid, 0.7s 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: 29ms 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: 1.3s InitialAbstraction: Time to compute Ample Reduction [ms]: 1378, 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 16:53:45,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...