/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/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 16:56:17,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 16:56:17,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 16:56:17,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 16:56:17,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 16:56:17,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 16:56:17,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 16:56:17,158 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 16:56:17,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 16:56:17,159 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 16:56:17,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 16:56:17,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 16:56:17,159 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 16:56:17,159 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 16:56:17,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 16:56:17,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 16:56:17,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 16:56:17,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:17,162 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 16:56:17,163 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 16:56:17,163 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 16:56:17,163 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 16:56:17,163 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 16:56:17,163 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 16:56:17,163 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 16:56:17,399 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 16:56:17,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 16:56:17,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 16:56:17,410 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 16:56:17,410 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 16:56:17,412 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl [2025-04-26 16:56:17,413 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20/three-array-sum.wvr.bpl' [2025-04-26 16:56:17,431 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 16:56:17,432 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 16:56:17,434 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:17,434 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 16:56:17,434 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 16:56:17,441 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,461 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,468 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 16:56:17,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 16:56:17,471 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 16:56:17,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 16:56:17,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 16:56:17,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,475 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,480 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,481 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,486 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,487 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 16:56:17,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 16:56:17,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 16:56:17,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 16:56:17,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/1) ... [2025-04-26 16:56:17,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 16:56:17,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,526 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:56:17,528 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:56:17,549 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 16:56:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 16:56:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 16:56:17,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 16:56:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 16:56:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 16:56:17,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 16:56:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 16:56:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 16:56:17,550 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 16:56:17,550 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 16:56:17,550 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 16:56:17,552 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:56:17,590 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 16:56:17,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 16:56:17,695 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 16:56:17,695 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 16:56:17,722 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 16:56:17,722 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 16:56:17,723 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:17 BoogieIcfgContainer [2025-04-26 16:56:17,723 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 16:56:17,723 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 16:56:17,723 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 16:56:17,729 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 16:56:17,730 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:17,730 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 04:56:17" (1/2) ... [2025-04-26 16:56:17,732 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1d4f3dda and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 04:56:17, skipping insertion in model container [2025-04-26 16:56:17,732 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 16:56:17,732 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 04:56:17" (2/2) ... [2025-04-26 16:56:17,733 INFO L376 chiAutomizerObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2025-04-26 16:56:17,781 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 16:56:17,813 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 16:56:17,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 16:56:17,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:17,815 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:56:17,816 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:56:17,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:56:17,892 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 16:56:17,893 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 16:56:17,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 4/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 20. Up to 3 conditions per place. [2025-04-26 16:56:17,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 16:56:17,901 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2025-04-26 16:56:17,901 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 26 transitions, 70 flow [2025-04-26 16:56:17,908 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 16:56:18,013 WARN L140 AmpleReduction]: Number of pruned transitions: 117 [2025-04-26 16:56:18,013 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 16:56:18,013 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 16:56:18,013 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 16:56:18,013 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:66 [2025-04-26 16:56:18,013 WARN L145 AmpleReduction]: Times succ was already a loop node:76 [2025-04-26 16:56:18,013 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:22 [2025-04-26 16:56:18,013 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 16:56:18,015 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 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:56:18,020 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 16:56:18,021 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 16:56:18,021 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 16:56:18,021 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 16:56:18,021 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 16:56:18,021 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 16:56:18,021 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 16:56:18,021 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 16:56:18,023 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 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:56:18,036 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:18,036 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:18,036 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:18,040 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:18,041 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:18,041 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 16:56:18,041 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 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:56:18,050 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 16:56:18,050 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:18,050 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:18,051 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 16:56:18,051 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:18,055 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 v_bsum_3) (= v_i_7 v_csum_1) (= v_i_7 v_k_7) (= v_i_7 0) (= v_i_7 v_p_2) (= v_i_7 v_asum_3)) InVars {csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} OutVars{csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} AuxVars[] AssignedVars[]" "[52] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 16:56:18,055 INFO L754 eck$LassoCheckResult]: Loop: "[76] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[78] L25-->L25-1: Formula: (and (= (+ (select v_A_3 v_i_13) v_asum_6) v_asum_5) (= (+ v_bsum_10 (select v_B_5 v_i_13)) v_bsum_9) (= (+ v_i_13 1) v_i_12)) InVars {A=v_A_3, i=v_i_13, bsum=v_bsum_10, asum=v_asum_6, B=v_B_5} OutVars{A=v_A_3, i=v_i_12, bsum=v_bsum_9, asum=v_asum_5, B=v_B_5} AuxVars[] AssignedVars[bsum, i, asum]" [2025-04-26 16:56:18,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 99725, now seen corresponding path program 1 times [2025-04-26 16:56:18,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,065 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611187209] [2025-04-26 16:56:18,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:18,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:18,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,111 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:18,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:18,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,129 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,132 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 16:56:18,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952562884] [2025-04-26 16:56:18,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,145 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,155 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,155 INFO L85 PathProgramCache]: Analyzing trace with hash 95838159, now seen corresponding path program 1 times [2025-04-26 16:56:18,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:18,155 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797433349] [2025-04-26 16:56:18,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:18,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:18,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:18,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:18,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,169 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:18,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 16:56:18,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 16:56:18,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:18,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:18,385 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:18,386 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:18,386 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:18,386 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:18,387 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:18,387 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,387 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:18,387 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:18,387 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 16:56:18,387 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:18,387 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:18,398 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,427 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,484 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,487 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,492 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,496 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:18,609 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:18,612 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:18,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,615 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:56:18,617 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:56:18,618 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:56:18,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,636 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,645 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,651 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:56:18,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,653 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:56:18,655 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:56:18,655 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:56:18,665 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,665 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,665 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,665 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,670 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,674 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:18,682 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 16:56:18,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,684 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:56:18,685 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:56:18,687 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:56:18,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:18,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:18,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:18,697 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:18,700 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:18,700 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:18,705 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:18,715 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 16:56:18,715 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 16:56:18,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:18,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:18,718 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:56:18,720 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:56:18,721 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:18,739 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:56:18,739 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:18,739 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:18,740 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 16:56:18,745 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:56:18,747 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:18,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:18,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 16:56:18,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 16:56:18,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:18,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:18,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:18,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:18,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:18,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:18,807 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:56:18,825 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:18,826 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:56:18,938 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 130 states, 128 states have (on average 2.0703125) internal successors, (in total 265), 129 states have internal predecessors, (265), 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 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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 312 states and 655 transitions. Complement of second has 7 states. [2025-04-26 16:56:18,940 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 16:56:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (in total 5), 3 states have internal predecessors, (5), 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:56:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-26 16:56:18,947 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 16:56:18,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 16:56:18,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,948 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 16:56:18,948 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:18,951 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 655 transitions. [2025-04-26 16:56:18,959 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:18,965 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 152 states and 314 transitions. [2025-04-26 16:56:18,966 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-04-26 16:56:18,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 16:56:18,969 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 314 transitions. [2025-04-26 16:56:18,969 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:18,970 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 314 transitions. [2025-04-26 16:56:18,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 314 transitions. [2025-04-26 16:56:18,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2025-04-26 16:56:18,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 128 states have (on average 2.125) internal successors, (in total 272), 127 states have internal predecessors, (272), 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:56:18,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 272 transitions. [2025-04-26 16:56:18,997 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 16:56:18,997 INFO L438 stractBuchiCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 16:56:18,999 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 16:56:18,999 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 272 transitions. [2025-04-26 16:56:19,002 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:19,002 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:19,002 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:19,002 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 16:56:19,002 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:19,002 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 v_bsum_3) (= v_i_7 v_csum_1) (= v_i_7 v_k_7) (= v_i_7 0) (= v_i_7 v_p_2) (= v_i_7 v_asum_3)) InVars {csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} OutVars{csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} AuxVars[] AssignedVars[]" "[52] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[75] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[77] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" [2025-04-26 16:56:19,003 INFO L754 eck$LassoCheckResult]: Loop: "[80] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[82] L37-->L37-1: Formula: (and (= v_C_4 (store v_C_5 v_k_13 (+ (select v_A_5 v_k_13) (select v_B_7 v_k_13)))) (= v_k_12 (+ v_k_13 1)) (= v_k_12 v_p_7)) InVars {A=v_A_5, k=v_k_13, C=v_C_5, B=v_B_7} OutVars{A=v_A_5, p=v_p_7, k=v_k_12, C=v_C_4, B=v_B_7} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:56:19,003 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1323985265, now seen corresponding path program 1 times [2025-04-26 16:56:19,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,003 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522129784] [2025-04-26 16:56:19,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:19,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:19,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,011 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 16:56:19,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 16:56:19,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,019 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,019 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 16:56:19,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083679842] [2025-04-26 16:56:19,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,026 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,033 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,033 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1039517487, now seen corresponding path program 1 times [2025-04-26 16:56:19,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622002533] [2025-04-26 16:56:19,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 16:56:19,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 16:56:19,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:19,100 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:56:19,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:19,101 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622002533] [2025-04-26 16:56:19,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622002533] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:19,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:19,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:19,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147837828] [2025-04-26 16:56:19,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:19,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:19,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:19,132 INFO L87 Difference]: Start difference. First operand 128 states and 272 transitions. cyclomatic complexity: 171 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (in total 8), 3 states have internal predecessors, (8), 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:56:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:19,196 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2025-04-26 16:56:19,196 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 294 transitions. [2025-04-26 16:56:19,197 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 57 [2025-04-26 16:56:19,198 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 294 transitions. [2025-04-26 16:56:19,200 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 16:56:19,200 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-04-26 16:56:19,201 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144 states and 294 transitions. [2025-04-26 16:56:19,201 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:19,201 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 294 transitions. [2025-04-26 16:56:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 294 transitions. [2025-04-26 16:56:19,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2025-04-26 16:56:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 2.099236641221374) internal successors, (in total 275), 130 states have internal predecessors, (275), 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:56:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 275 transitions. [2025-04-26 16:56:19,210 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:19,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 16:56:19,211 INFO L438 stractBuchiCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 16:56:19,211 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 16:56:19,211 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 275 transitions. [2025-04-26 16:56:19,212 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 16:56:19,212 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:19,212 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:19,212 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:19,213 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:19,213 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 v_bsum_3) (= v_i_7 v_csum_1) (= v_i_7 v_k_7) (= v_i_7 0) (= v_i_7 v_p_2) (= v_i_7 v_asum_3)) InVars {csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} OutVars{csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} AuxVars[] AssignedVars[]" "[52] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[78] L25-->L25-1: Formula: (and (= (+ (select v_A_3 v_i_13) v_asum_6) v_asum_5) (= (+ v_bsum_10 (select v_B_5 v_i_13)) v_bsum_9) (= (+ v_i_13 1) v_i_12)) InVars {A=v_A_3, i=v_i_13, bsum=v_bsum_10, asum=v_asum_6, B=v_B_5} OutVars{A=v_A_3, i=v_i_12, bsum=v_bsum_9, asum=v_asum_5, B=v_B_5} AuxVars[] AssignedVars[bsum, i, asum]" "[75] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 16:56:19,214 INFO L754 eck$LassoCheckResult]: Loop: "[80] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[82] L37-->L37-1: Formula: (and (= v_C_4 (store v_C_5 v_k_13 (+ (select v_A_5 v_k_13) (select v_B_7 v_k_13)))) (= v_k_12 (+ v_k_13 1)) (= v_k_12 v_p_7)) InVars {A=v_A_5, k=v_k_13, C=v_C_5, B=v_B_7} OutVars{A=v_A_5, p=v_p_7, k=v_k_12, C=v_C_4, B=v_B_7} AuxVars[] AssignedVars[p, k, C]" [2025-04-26 16:56:19,214 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1906175452, now seen corresponding path program 1 times [2025-04-26 16:56:19,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682663362] [2025-04-26 16:56:19,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:19,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:19,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,224 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:19,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:19,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,235 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,236 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,236 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 2 times [2025-04-26 16:56:19,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,236 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942140476] [2025-04-26 16:56:19,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:19,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,241 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,243 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,243 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:19,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,243 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash -2116423458, now seen corresponding path program 1 times [2025-04-26 16:56:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233286526] [2025-04-26 16:56:19,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:19,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:19,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,260 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:19,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:19,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,278 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,437 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 16:56:19,438 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 16:56:19,438 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 16:56:19,438 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 16:56:19,438 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 16:56:19,438 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,438 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 16:56:19,438 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 16:56:19,438 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 16:56:19,438 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 16:56:19,438 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 16:56:19,439 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,442 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,444 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,446 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,468 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,472 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,474 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 16:56:19,605 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 16:56:19,606 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 16:56:19,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,608 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:56:19,613 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:56:19,613 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:56:19,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:19,630 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:19,631 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:19,631 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:19,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:19,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:19,638 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:19,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,647 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:56:19,649 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:56:19,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:19,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:19,661 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:19,661 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:19,661 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:19,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:19,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:19,666 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:19,672 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:56:19,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,675 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:56:19,676 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:56:19,678 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:56:19,688 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:19,688 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:19,688 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:19,688 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:19,690 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:19,690 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:19,692 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:19,698 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2025-04-26 16:56:19,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,703 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:56:19,707 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:56:19,709 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:56:19,719 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:19,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:19,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:19,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:19,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:19,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:19,728 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 16:56:19,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 16:56:19,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,736 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:56:19,737 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:56:19,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 16:56:19,748 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 16:56:19,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 16:56:19,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 16:56:19,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 16:56:19,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 16:56:19,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 16:56:19,757 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 16:56:19,766 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 16:56:19,766 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 16:56:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 16:56:19,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 16:56:19,768 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:56:19,769 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:56:19,770 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 16:56:19,787 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:56:19,787 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 16:56:19,787 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 16:56:19,787 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 16:56:19,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 16:56:19,794 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 16:56:19,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 16:56:19,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 16:56:19,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:19,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 16:56:19,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:19,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:19,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 16:56:19,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 16:56:19,840 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:56:19,840 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-04-26 16:56:19,840 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 275 transitions. cyclomatic complexity: 171 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:56:19,906 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 275 transitions. cyclomatic complexity: 171. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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 286 states and 607 transitions. Complement of second has 6 states. [2025-04-26 16:56:19,906 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:56:19,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (in total 9), 3 states have internal predecessors, (9), 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:56:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 16:56:19,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 16:56:19,907 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:19,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 16:56:19,907 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:19,907 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 16:56:19,907 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 16:56:19,907 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 607 transitions. [2025-04-26 16:56:19,910 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:19,911 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 192 states and 397 transitions. [2025-04-26 16:56:19,911 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2025-04-26 16:56:19,912 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 16:56:19,912 INFO L74 IsDeterministic]: Start isDeterministic. Operand 192 states and 397 transitions. [2025-04-26 16:56:19,912 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:19,912 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 397 transitions. [2025-04-26 16:56:19,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 397 transitions. [2025-04-26 16:56:19,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-04-26 16:56:19,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 157 states have (on average 2.1146496815286624) internal successors, (in total 332), 156 states have internal predecessors, (332), 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:56:19,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 332 transitions. [2025-04-26 16:56:19,917 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 16:56:19,917 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 16:56:19,917 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 16:56:19,917 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 332 transitions. [2025-04-26 16:56:19,918 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:19,918 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:19,918 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:19,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:19,918 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:19,919 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 v_bsum_3) (= v_i_7 v_csum_1) (= v_i_7 v_k_7) (= v_i_7 0) (= v_i_7 v_p_2) (= v_i_7 v_asum_3)) InVars {csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} OutVars{csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} AuxVars[] AssignedVars[]" "[52] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[75] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[77] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[79] L37-1-->thread2FINAL: Formula: (<= v_N_3 v_k_1) InVars {k=v_k_1, N=v_N_3} OutVars{k=v_k_1, N=v_N_3} AuxVars[] AssignedVars[]" "[81] thread2FINAL-->thread2EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:19,919 INFO L754 eck$LassoCheckResult]: Loop: "[84] L49-1-->L49: Formula: (< v_l_2 v_N_6) InVars {l=v_l_2, N=v_N_6} OutVars{l=v_l_2, N=v_N_6} AuxVars[] AssignedVars[]" "[87] L49-->L49-1: Formula: (<= v_p_4 v_l_7) InVars {p=v_p_4, l=v_l_7} OutVars{p=v_p_4, l=v_l_7} AuxVars[] AssignedVars[]" [2025-04-26 16:56:19,919 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2134695376, now seen corresponding path program 1 times [2025-04-26 16:56:19,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,919 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781907076] [2025-04-26 16:56:19,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:19,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:19,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,923 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:19,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:19,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,927 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,927 INFO L85 PathProgramCache]: Analyzing trace with hash 3652, now seen corresponding path program 1 times [2025-04-26 16:56:19,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,928 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293435011] [2025-04-26 16:56:19,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,929 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:19,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:19,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:19,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:19,931 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:19,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:19,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1552108461, now seen corresponding path program 1 times [2025-04-26 16:56:19,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:19,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553464781] [2025-04-26 16:56:19,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:19,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:19,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:19,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 16:56:19,966 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:56:19,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 16:56:19,966 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553464781] [2025-04-26 16:56:19,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553464781] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 16:56:19,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 16:56:19,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 16:56:19,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128634989] [2025-04-26 16:56:19,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 16:56:19,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 16:56:19,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 16:56:19,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 16:56:19,977 INFO L87 Difference]: Start difference. First operand 157 states and 332 transitions. cyclomatic complexity: 203 Second operand has 4 states, 4 states have (on average 2.75) internal successors, (in total 11), 3 states have internal predecessors, (11), 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:56:20,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 16:56:20,022 INFO L93 Difference]: Finished difference Result 162 states and 337 transitions. [2025-04-26 16:56:20,022 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 337 transitions. [2025-04-26 16:56:20,023 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:20,024 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 156 states and 331 transitions. [2025-04-26 16:56:20,024 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-04-26 16:56:20,025 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-04-26 16:56:20,025 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156 states and 331 transitions. [2025-04-26 16:56:20,025 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 16:56:20,025 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 331 transitions. [2025-04-26 16:56:20,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 331 transitions. [2025-04-26 16:56:20,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-04-26 16:56:20,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 154 states have (on average 2.1298701298701297) internal successors, (in total 328), 153 states have internal predecessors, (328), 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:56:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 328 transitions. [2025-04-26 16:56:20,029 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 16:56:20,030 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 16:56:20,030 INFO L438 stractBuchiCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 16:56:20,030 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 16:56:20,030 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 328 transitions. [2025-04-26 16:56:20,031 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 16:56:20,031 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 16:56:20,031 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 16:56:20,031 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 16:56:20,031 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 16:56:20,031 INFO L752 eck$LassoCheckResult]: Stem: "[71] $Ultimate##0-->L63: Formula: (and (= v_i_7 v_l_1) (= v_i_7 v_bsum_3) (= v_i_7 v_csum_1) (= v_i_7 v_k_7) (= v_i_7 0) (= v_i_7 v_p_2) (= v_i_7 v_asum_3)) InVars {csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} OutVars{csum=v_csum_1, p=v_p_2, bsum=v_bsum_3, l=v_l_1, k=v_k_7, i=v_i_7, asum=v_asum_3} AuxVars[] AssignedVars[]" "[52] L63-->L64: Formula: (<= 0 v_N_5) InVars {N=v_N_5} OutVars{N=v_N_5} AuxVars[] AssignedVars[]" "[91] L64-->L25-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[76] L25-1-->L25: Formula: (< v_i_1 v_N_1) InVars {i=v_i_1, N=v_N_1} OutVars{i=v_i_1, N=v_N_1} AuxVars[] AssignedVars[]" "[94] L64-1-->L37-1: Formula: (and (= 2 v_thread2Thread1of1ForFork1_thidvar1_2) (= 2 v_thread2Thread1of1ForFork1_thidvar0_2)) InVars {} OutVars{thread2Thread1of1ForFork1_thidvar0=v_thread2Thread1of1ForFork1_thidvar0_2, thread2Thread1of1ForFork1_thidvar1=v_thread2Thread1of1ForFork1_thidvar1_2} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_thidvar0, thread2Thread1of1ForFork1_thidvar1]" "[78] L25-->L25-1: Formula: (and (= (+ (select v_A_3 v_i_13) v_asum_6) v_asum_5) (= (+ v_bsum_10 (select v_B_5 v_i_13)) v_bsum_9) (= (+ v_i_13 1) v_i_12)) InVars {A=v_A_3, i=v_i_13, bsum=v_bsum_10, asum=v_asum_6, B=v_B_5} OutVars{A=v_A_3, i=v_i_12, bsum=v_bsum_9, asum=v_asum_5, B=v_B_5} AuxVars[] AssignedVars[bsum, i, asum]" "[80] L37-1-->L37: Formula: (< v_k_2 v_N_4) InVars {k=v_k_2, N=v_N_4} OutVars{k=v_k_2, N=v_N_4} AuxVars[] AssignedVars[]" "[75] L25-1-->thread1FINAL: Formula: (<= v_N_2 v_i_6) InVars {i=v_i_6, N=v_N_2} OutVars{i=v_i_6, N=v_N_2} AuxVars[] AssignedVars[]" "[97] L65-->L49-1: Formula: (and (= 3 v_thread3Thread1of1ForFork2_thidvar0_2) (= 3 v_thread3Thread1of1ForFork2_thidvar1_2) (= 3 v_thread3Thread1of1ForFork2_thidvar2_2)) InVars {} OutVars{thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_2, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_2, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_2} AuxVars[] AssignedVars[thread3Thread1of1ForFork2_thidvar2, thread3Thread1of1ForFork2_thidvar1, thread3Thread1of1ForFork2_thidvar0]" [2025-04-26 16:56:20,032 INFO L754 eck$LassoCheckResult]: Loop: "[84] L49-1-->L49: Formula: (< v_l_2 v_N_6) InVars {l=v_l_2, N=v_N_6} OutVars{l=v_l_2, N=v_N_6} AuxVars[] AssignedVars[]" "[87] L49-->L49-1: Formula: (<= v_p_4 v_l_7) InVars {p=v_p_4, l=v_l_7} OutVars{p=v_p_4, l=v_l_7} AuxVars[] AssignedVars[]" [2025-04-26 16:56:20,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:20,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2116418793, now seen corresponding path program 1 times [2025-04-26 16:56:20,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:20,032 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505607496] [2025-04-26 16:56:20,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:20,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:20,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:20,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:20,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,037 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:20,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:20,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:20,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:20,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:20,042 INFO L85 PathProgramCache]: Analyzing trace with hash 3652, now seen corresponding path program 2 times [2025-04-26 16:56:20,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:20,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845183991] [2025-04-26 16:56:20,042 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 16:56:20,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:20,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:20,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:20,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 16:56:20,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:20,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 16:56:20,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 16:56:20,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,045 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:20,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 16:56:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1936040922, now seen corresponding path program 1 times [2025-04-26 16:56:20,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 16:56:20,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611910941] [2025-04-26 16:56:20,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 16:56:20,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 16:56:20,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:20,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:20,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:20,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 16:56:20,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 16:56:20,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 16:56:20,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:20,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:20,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,209 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 16:56:20,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 16:56:20,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 16:56:20,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 16:56:20,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 16:56:20,232 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:56:20,245 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 04:56:20 BoogieIcfgContainer [2025-04-26 16:56:20,249 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 16:56:20,250 INFO L158 Benchmark]: Toolchain (without parser) took 2817.80ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 87.4MB in the beginning and 25.2MB in the end (delta: 62.2MB). Peak memory consumption was 31.9MB. Max. memory is 8.0GB. [2025-04-26 16:56:20,251 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.91ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:20,251 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.09ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:20,251 INFO L158 Benchmark]: Boogie Preprocessor took 26.03ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.5MB in the end (delta: 982.9kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 16:56:20,251 INFO L158 Benchmark]: RCFGBuilder took 225.13ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 74.2MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 16:56:20,251 INFO L158 Benchmark]: BuchiAutomizer took 2526.15ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 74.1MB in the beginning and 25.2MB in the end (delta: 48.9MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2025-04-26 16:56:20,253 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.91ms. Allocated memory is still 159.4MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.09ms. Allocated memory is still 159.4MB. Free memory was 87.4MB in the beginning and 85.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.03ms. Allocated memory is still 159.4MB. Free memory was 85.5MB in the beginning and 84.5MB in the end (delta: 982.9kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 225.13ms. Allocated memory is still 159.4MB. Free memory was 84.5MB in the beginning and 74.2MB in the end (delta: 10.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2526.15ms. Allocated memory was 159.4MB in the beginning and 125.8MB in the end (delta: -33.6MB). Free memory was 74.1MB in the beginning and 25.2MB in the end (delta: 48.9MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 74 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 104 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 52 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 189 IncrementalHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 52 mSDtfsCounter, 189 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital63 mio100 ax100 hnf100 lsp71 ukn85 mio100 lsp55 div100 bol100 ite100 ukn100 eq173 hnf90 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.2s InitialAbstraction: Time to compute Ample Reduction [ms]: 204, Number of transitions in reduction automaton: 265, Number of states in reduction automaton: 130, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function -1 * k + N and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 154 locations. - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 48]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L62] 0 assume i == k && i == l && i == p && i == asum && i == bsum && i == csum && i == 0; VAL [asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L24] COND TRUE 1 i < N VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L26] 1 asum := asum + A[i]; [L27] 1 bsum := bsum + B[i]; [L28] 1 i := i + 1; VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L36] COND TRUE 2 k < N VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L24] COND FALSE 1 !(i < N) VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 48]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L62] 0 assume i == k && i == l && i == p && i == asum && i == bsum && i == csum && i == 0; VAL [asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L63] 0 assume 0 <= N; VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L64] FORK 0 fork 1 thread1(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L24] COND TRUE 1 i < N VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L65] FORK 0 fork 2, 2 thread2(); VAL [N=1, asum=0, bsum=0, csum=0, i=0, k=0, l=0, p=0] [L26] 1 asum := asum + A[i]; [L27] 1 bsum := bsum + B[i]; [L28] 1 i := i + 1; VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L36] COND TRUE 2 k < N VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L24] COND FALSE 1 !(i < N) VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] [L66] FORK 0 fork 3, 3, 3 thread3(); VAL [N=1, asum=0, bsum=0, csum=0, i=1, k=0, l=0, p=0] Loop: [L48] COND TRUE l < N [L49] COND FALSE !(l < p) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-04-26 16:56:20,270 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...