/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 18:41:49,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:49,144 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:49,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:49,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:49,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:41:49,149 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:49,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:49,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:49,169 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:49,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:49,170 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:49,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:49,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:49,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:49,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:49,171 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:49,171 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:49,172 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:49,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:49,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:49,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:49,386 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:49,387 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:49,388 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 18:41:49,388 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 18:41:49,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:49,407 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:49,408 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:49,408 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:49,408 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:49,415 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,436 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,441 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:49,442 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:49,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:49,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:49,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:49,447 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,447 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,448 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,449 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,452 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,453 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,455 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,455 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,455 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:49,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:49,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:49,467 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:49,468 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 06:41:49" (1/1) ... [2025-04-26 18:41:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:49,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,491 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:49,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-26 18:41:49,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:49,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:49,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:49,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:49,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:49,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:49,515 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:49,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:49,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:49,516 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-26 18:41:49,555 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:49,556 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:49,643 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:49,643 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:49,662 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:49,662 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:49,662 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:49 BoogieIcfgContainer [2025-04-26 18:41:49,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:49,663 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:49,663 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:49,667 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:49,667 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:49,667 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 06:41:49" (1/2) ... [2025-04-26 18:41:49,668 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3a2fcffe and model type three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:49, skipping insertion in model container [2025-04-26 18:41:49,668 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:49,668 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 06:41:49" (2/2) ... [2025-04-26 18:41:49,669 INFO L376 chiAutomizerObserver]: Analyzing ICFG three-array-sum.wvr.bpl [2025-04-26 18:41:49,706 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:49,740 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:49,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:49,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:49,742 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:49,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-26 18:41:49,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 18:41:49,804 INFO L116 PetriNetUnfolderBase]: 4/26 cut-off events. [2025-04-26 18:41:49,808 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:49,812 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 18:41:49,812 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-26 18:41:49,816 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 32 places, 26 transitions, 70 flow [2025-04-26 18:41:49,816 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 32 places, 26 transitions, 70 flow [2025-04-26 18:41:49,817 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 26 transitions, 70 flow [2025-04-26 18:41:49,835 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 133 states, 131 states have (on average 3.015267175572519) internal successors, (in total 395), 132 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:49,837 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 133 states, 131 states have (on average 3.015267175572519) internal successors, (in total 395), 132 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:41:49,839 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:49,907 WARN L140 AmpleReduction]: Number of pruned transitions: 117 [2025-04-26 18:41:49,907 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:49,907 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 40 [2025-04-26 18:41:49,907 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:41:49,907 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:66 [2025-04-26 18:41:49,907 WARN L145 AmpleReduction]: Times succ was already a loop node:76 [2025-04-26 18:41:49,907 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:22 [2025-04-26 18:41:49,907 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:49,908 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 18:41:49,914 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:49,914 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:49,914 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:49,914 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:49,914 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:49,914 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:49,914 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:49,914 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:49,916 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 18:41:49,926 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 18:41:49,926 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,926 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,929 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:49,929 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:49,929 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:49,930 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 18:41:49,933 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 98 [2025-04-26 18:41:49,933 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:49,933 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:49,933 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-04-26 18:41:49,933 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:49,936 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 18:41:49,937 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 18:41:49,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:49,940 INFO L85 PathProgramCache]: Analyzing trace with hash 99725, now seen corresponding path program 1 times [2025-04-26 18:41:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:49,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844399388] [2025-04-26 18:41:49,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:49,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:50,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:50,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,015 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:50,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:50,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,035 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,041 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:41:50,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,041 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290439421] [2025-04-26 18:41:50,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,054 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,062 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,065 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,065 INFO L85 PathProgramCache]: Analyzing trace with hash 95838159, now seen corresponding path program 1 times [2025-04-26 18:41:50,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819913478] [2025-04-26 18:41:50,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:50,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:50,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,077 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:50,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:50,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,090 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,237 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:50,238 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:50,238 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:50,238 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:50,238 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:50,238 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,238 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:50,238 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:50,239 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:50,239 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:50,239 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:50,277 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,285 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,306 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,309 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,312 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,318 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:50,460 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:50,463 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:50,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,466 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:50,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-04-26 18:41:50,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:50,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,486 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,486 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,490 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:50,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,499 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:50,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-04-26 18:41:50,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:50,511 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,520 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:50,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:50,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,529 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:50,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-04-26 18:41:50,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:50,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:50,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:50,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:50,541 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:50,546 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:50,546 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:50,553 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:50,562 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:41:50,562 INFO L437 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2025-04-26 18:41:50,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:50,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:50,566 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:50,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-04-26 18:41:50,569 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:50,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-04-26 18:41:50,586 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:50,586 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:50,586 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(N, i) = 1*N - 1*i Supporting invariants [] [2025-04-26 18:41:50,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-04-26 18:41:50,595 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:50,614 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:41:50,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:41:50,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,626 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:50,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:50,672 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 18:41:50,673 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 18:41:50,765 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 18:41:50,766 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 18:41:50,770 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 18:41:50,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-04-26 18:41:50,773 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 2 letters. [2025-04-26 18:41:50,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:50,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,774 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 3 letters. Loop has 4 letters. [2025-04-26 18:41:50,774 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:50,775 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 655 transitions. [2025-04-26 18:41:50,786 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:50,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 152 states and 314 transitions. [2025-04-26 18:41:50,794 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2025-04-26 18:41:50,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 98 [2025-04-26 18:41:50,795 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 314 transitions. [2025-04-26 18:41:50,795 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:50,795 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 314 transitions. [2025-04-26 18:41:50,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 314 transitions. [2025-04-26 18:41:50,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 128. [2025-04-26 18:41:50,814 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 18:41:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 272 transitions. [2025-04-26 18:41:50,816 INFO L240 hiAutomatonCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 18:41:50,816 INFO L438 stractBuchiCegarLoop]: Abstraction has 128 states and 272 transitions. [2025-04-26 18:41:50,816 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:50,816 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 272 transitions. [2025-04-26 18:41:50,817 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:50,817 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:50,817 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:50,817 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:41:50,817 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:50,818 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 18:41:50,818 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 18:41:50,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1323985265, now seen corresponding path program 1 times [2025-04-26 18:41:50,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143111931] [2025-04-26 18:41:50,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:50,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:50,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,822 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:41:50,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:41:50,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,826 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,826 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 1 times [2025-04-26 18:41:50,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,826 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244077644] [2025-04-26 18:41:50,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,832 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:50,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:50,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:50,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:50,842 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:50,842 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:50,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1039517487, now seen corresponding path program 1 times [2025-04-26 18:41:50,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:50,842 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114335130] [2025-04-26 18:41:50,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:50,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:50,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:50,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:50,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:50,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:50,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:50,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:50,907 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114335130] [2025-04-26 18:41:50,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114335130] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:50,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:50,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:50,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642851334] [2025-04-26 18:41:50,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:50,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:50,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:50,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:50,936 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 18:41:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:50,990 INFO L93 Difference]: Finished difference Result 144 states and 294 transitions. [2025-04-26 18:41:50,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 144 states and 294 transitions. [2025-04-26 18:41:50,992 INFO L131 ngComponentsAnalysis]: Automaton has 21 accepting balls. 57 [2025-04-26 18:41:50,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 144 states to 144 states and 294 transitions. [2025-04-26 18:41:50,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2025-04-26 18:41:50,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2025-04-26 18:41:50,993 INFO L74 IsDeterministic]: Start isDeterministic. Operand 144 states and 294 transitions. [2025-04-26 18:41:50,995 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:50,995 INFO L218 hiAutomatonCegarLoop]: Abstraction has 144 states and 294 transitions. [2025-04-26 18:41:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states and 294 transitions. [2025-04-26 18:41:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 131. [2025-04-26 18:41:51,000 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 18:41:51,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 275 transitions. [2025-04-26 18:41:51,001 INFO L240 hiAutomatonCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 18:41:51,001 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:51,002 INFO L438 stractBuchiCegarLoop]: Abstraction has 131 states and 275 transitions. [2025-04-26 18:41:51,002 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:51,002 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 275 transitions. [2025-04-26 18:41:51,003 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 48 [2025-04-26 18:41:51,003 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:51,003 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:51,003 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:51,003 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:51,003 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 18:41:51,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 18:41:51,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1906175452, now seen corresponding path program 1 times [2025-04-26 18:41:51,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349172165] [2025-04-26 18:41:51,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:51,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:51,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,010 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:51,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:51,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,016 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,016 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 3523, now seen corresponding path program 2 times [2025-04-26 18:41:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,016 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824891364] [2025-04-26 18:41:51,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:51,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,019 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,020 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,020 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,020 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2116423458, now seen corresponding path program 1 times [2025-04-26 18:41:51,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023545120] [2025-04-26 18:41:51,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,030 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,173 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:51,174 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:51,174 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:51,174 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:51,174 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:51,174 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,174 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:51,174 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:51,174 INFO L132 ssoRankerPreferences]: Filename of dumped script: three-array-sum.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:41:51,174 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:51,174 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:51,175 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,177 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,179 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,181 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,209 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,216 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:51,331 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:51,331 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:51,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,333 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-04-26 18:41:51,336 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,348 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,350 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-04-26 18:41:51,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,358 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-04-26 18:41:51,360 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,375 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,380 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 18:41:51,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,382 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-04-26 18:41:51,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,393 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,393 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,393 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,393 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,398 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,406 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 18:41:51,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,410 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2025-04-26 18:41:51,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,423 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,424 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,424 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,429 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:51,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:51,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,437 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-04-26 18:41:51,440 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:51,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:51,450 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:51,450 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:51,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:51,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:51,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:51,459 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:51,472 INFO L436 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2025-04-26 18:41:51,472 INFO L437 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 5 variables to zero. [2025-04-26 18:41:51,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:51,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:51,475 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:51,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-04-26 18:41:51,477 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:51,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2025-04-26 18:41:51,494 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:51,495 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:51,495 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:51,502 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 18:41:51,503 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:51,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:51,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:51,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:51,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:51,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:51,573 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 18:41:51,573 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 18:41:51,618 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 18:41:51,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2025-04-26 18:41:51,619 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 18:41:51,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2025-04-26 18:41:51,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:51,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,619 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 9 letters. Loop has 2 letters. [2025-04-26 18:41:51,619 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,620 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 7 letters. Loop has 4 letters. [2025-04-26 18:41:51,620 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:51,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 286 states and 607 transitions. [2025-04-26 18:41:51,622 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:51,624 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 286 states to 192 states and 397 transitions. [2025-04-26 18:41:51,624 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 82 [2025-04-26 18:41:51,624 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 114 [2025-04-26 18:41:51,624 INFO L74 IsDeterministic]: Start isDeterministic. Operand 192 states and 397 transitions. [2025-04-26 18:41:51,624 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:51,625 INFO L218 hiAutomatonCegarLoop]: Abstraction has 192 states and 397 transitions. [2025-04-26 18:41:51,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states and 397 transitions. [2025-04-26 18:41:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 157. [2025-04-26 18:41:51,629 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 18:41:51,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 332 transitions. [2025-04-26 18:41:51,630 INFO L240 hiAutomatonCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 18:41:51,630 INFO L438 stractBuchiCegarLoop]: Abstraction has 157 states and 332 transitions. [2025-04-26 18:41:51,630 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:51,630 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 157 states and 332 transitions. [2025-04-26 18:41:51,632 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:51,632 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:51,632 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:51,632 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:51,633 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:51,633 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 18:41:51,633 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 18:41:51,634 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2134695376, now seen corresponding path program 1 times [2025-04-26 18:41:51,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,634 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058685409] [2025-04-26 18:41:51,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,641 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,645 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,645 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,645 INFO L85 PathProgramCache]: Analyzing trace with hash 3652, now seen corresponding path program 1 times [2025-04-26 18:41:51,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560963456] [2025-04-26 18:41:51,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,647 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,651 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1552108461, now seen corresponding path program 1 times [2025-04-26 18:41:51,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322147635] [2025-04-26 18:41:51,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:51,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:51,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:51,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:51,704 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322147635] [2025-04-26 18:41:51,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322147635] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:51,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:51,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-26 18:41:51,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761682521] [2025-04-26 18:41:51,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:51,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:51,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-26 18:41:51,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-26 18:41:51,721 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 18:41:51,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:51,763 INFO L93 Difference]: Finished difference Result 162 states and 337 transitions. [2025-04-26 18:41:51,763 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 162 states and 337 transitions. [2025-04-26 18:41:51,764 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:51,767 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 162 states to 156 states and 331 transitions. [2025-04-26 18:41:51,767 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 76 [2025-04-26 18:41:51,767 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 76 [2025-04-26 18:41:51,767 INFO L74 IsDeterministic]: Start isDeterministic. Operand 156 states and 331 transitions. [2025-04-26 18:41:51,767 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:51,767 INFO L218 hiAutomatonCegarLoop]: Abstraction has 156 states and 331 transitions. [2025-04-26 18:41:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states and 331 transitions. [2025-04-26 18:41:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-04-26 18:41:51,771 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 18:41:51,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 328 transitions. [2025-04-26 18:41:51,771 INFO L240 hiAutomatonCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 18:41:51,773 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-26 18:41:51,773 INFO L438 stractBuchiCegarLoop]: Abstraction has 154 states and 328 transitions. [2025-04-26 18:41:51,774 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:51,774 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 328 transitions. [2025-04-26 18:41:51,774 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 35 [2025-04-26 18:41:51,774 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:51,774 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:51,775 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:51,775 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:51,775 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 18:41:51,775 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 18:41:51,775 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,775 INFO L85 PathProgramCache]: Analyzing trace with hash -2116418793, now seen corresponding path program 1 times [2025-04-26 18:41:51,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,775 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980097866] [2025-04-26 18:41:51,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,788 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,798 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,800 INFO L85 PathProgramCache]: Analyzing trace with hash 3652, now seen corresponding path program 2 times [2025-04-26 18:41:51,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847668199] [2025-04-26 18:41:51,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:51,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,801 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,802 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,802 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:51,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,802 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:51,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:51,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:51,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1936040922, now seen corresponding path program 1 times [2025-04-26 18:41:51,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:51,804 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760671549] [2025-04-26 18:41:51,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:51,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:51,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:51,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:51,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,808 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:51,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:51,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,816 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:51,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:51,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:51,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:51,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:51,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:51,989 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 18:41:51,998 INFO L201 PluginConnector]: Adding new model three-array-sum.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:51 BoogieIcfgContainer [2025-04-26 18:41:51,998 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:51,999 INFO L158 Benchmark]: Toolchain (without parser) took 2591.67ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 87.9MB in the beginning and 63.7MB in the end (delta: 24.2MB). Peak memory consumption was 25.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:51,999 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:51,999 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.34ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 86.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,001 INFO L158 Benchmark]: Boogie Preprocessor took 23.55ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:52,002 INFO L158 Benchmark]: RCFGBuilder took 195.19ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 74.8MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,003 INFO L158 Benchmark]: BuchiAutomizer took 2335.33ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 63.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. [2025-04-26 18:41:52,004 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.19ms. Allocated memory is still 159.4MB. Free memory is still 88.9MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.34ms. Allocated memory is still 159.4MB. Free memory was 87.9MB in the beginning and 86.1MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.55ms. Allocated memory is still 159.4MB. Free memory was 86.0MB in the beginning and 84.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 195.19ms. Allocated memory is still 159.4MB. Free memory was 84.9MB in the beginning and 74.8MB in the end (delta: 10.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2335.33ms. Allocated memory was 159.4MB in the beginning and 155.2MB in the end (delta: -4.2MB). Free memory was 74.7MB in the beginning and 63.7MB in the end (delta: 11.0MB). Peak memory consumption was 8.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.2s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.5s. 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: 27ms 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.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 172, 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 18:41:52,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...