/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-more/max-array-hom.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:41:08,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:41:08,712 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:41:08,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:41:08,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:41:08,718 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:08,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:41:08,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:41:08,741 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:41:08,741 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:41:08,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:41:08,742 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:41:08,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:41:08,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:41:08,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:08,743 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:41:08,743 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:41:08,744 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:41:08,744 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:41:08,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:41:08,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:41:08,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:41:08,967 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:41:08,967 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:41:08,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array-hom.wvr.bpl [2025-04-26 18:41:08,968 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/popl20-more/max-array-hom.wvr.bpl' [2025-04-26 18:41:08,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:41:08,986 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:41:08,987 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:08,987 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:41:08,987 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:41:08,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,016 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,024 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:41:09,025 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:41:09,026 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:41:09,026 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:41:09,026 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:41:09,031 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,033 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,033 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,037 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:41:09,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:41:09,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:41:09,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:41:09,053 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/1) ... [2025-04-26 18:41:09,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:41:09,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,076 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:09,079 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:09,098 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:41:09,098 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:41:09,098 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:41:09,098 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:41:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:41:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:41:09,099 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:41:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:41:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:41:09,099 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:41:09,099 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:41:09,099 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:41:09,099 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:09,133 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:41:09,134 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:41:09,204 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:41:09,204 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:41:09,216 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:41:09,216 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-26 18:41:09,217 INFO L201 PluginConnector]: Adding new model max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:09 BoogieIcfgContainer [2025-04-26 18:41:09,217 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:41:09,219 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:41:09,219 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:41:09,224 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:41:09,224 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:09,224 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:41:08" (1/2) ... [2025-04-26 18:41:09,225 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4f88bd2b and model type max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:41:09, skipping insertion in model container [2025-04-26 18:41:09,225 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:41:09,225 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:41:09" (2/2) ... [2025-04-26 18:41:09,226 INFO L376 chiAutomizerObserver]: Analyzing ICFG max-array-hom.wvr.bpl [2025-04-26 18:41:09,267 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:41:09,299 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:41:09,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:41:09,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:09,302 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:09,304 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:09,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:09,366 INFO L116 PetriNetUnfolderBase]: 3/26 cut-off events. [2025-04-26 18:41:09,368 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:41:09,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 26 events. 3/26 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 28 event pairs, 0 based on Foata normal form. 0/22 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:41:09,372 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 32 transitions, 85 flow [2025-04-26 18:41:09,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:09,375 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:09,377 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 26 transitions, 70 flow [2025-04-26 18:41:09,392 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 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:09,393 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 114 states, 112 states have (on average 2.8035714285714284) internal successors, (in total 314), 113 states have internal predecessors, (314), 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:09,395 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:41:09,441 WARN L140 AmpleReduction]: Number of pruned transitions: 87 [2025-04-26 18:41:09,442 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 0 [2025-04-26 18:41:09,442 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 39 [2025-04-26 18:41:09,443 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:23 [2025-04-26 18:41:09,443 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:51 [2025-04-26 18:41:09,443 WARN L145 AmpleReduction]: Times succ was already a loop node:66 [2025-04-26 18:41:09,443 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:41:09,443 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:41:09,443 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:09,449 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:41:09,449 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:41:09,449 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:41:09,449 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:41:09,449 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:41:09,449 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:41:09,449 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:41:09,449 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:41:09,451 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:09,468 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:09,468 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,468 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,472 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,472 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:09,472 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:41:09,472 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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:09,475 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 84 [2025-04-26 18:41:09,475 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:09,475 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:09,476 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-04-26 18:41:09,476 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:09,480 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3) (= v_i_6 v_max3_1)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" [2025-04-26 18:41:09,480 INFO L754 eck$LassoCheckResult]: Loop: "[68] L23-1-->L23: 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[]" "[70] L23-->L23-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" [2025-04-26 18:41:09,483 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,484 INFO L85 PathProgramCache]: Analyzing trace with hash 86396430, now seen corresponding path program 1 times [2025-04-26 18:41:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022313077] [2025-04-26 18:41:09,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,538 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:09,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:09,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,556 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,557 INFO L85 PathProgramCache]: Analyzing trace with hash 3139, now seen corresponding path program 1 times [2025-04-26 18:41:09,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454214966] [2025-04-26 18:41:09,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:09,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:09,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,569 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:09,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:09,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,577 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,579 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1422592784, now seen corresponding path program 1 times [2025-04-26 18:41:09,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:09,579 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298413515] [2025-04-26 18:41:09,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:09,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:09,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,591 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:09,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:41:09,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:41:09,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:09,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:09,605 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:09,797 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:09,797 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:09,797 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:09,798 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:09,798 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:09,798 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:09,798 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:09,798 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:09,798 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array-hom.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:41:09,798 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:09,798 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:09,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,872 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,876 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,879 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:09,882 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:10,061 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:10,066 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:10,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,098 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:10,119 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:10,120 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:10,134 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,148 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,155 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:10,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,158 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:10,160 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:10,161 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:10,171 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,175 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,179 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,184 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:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,187 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:10,189 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:10,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:10,202 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,202 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,202 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,202 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,204 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,207 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:10,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,215 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:10,215 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:10,216 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:10,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,228 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,231 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,237 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:10,237 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,239 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:10,241 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:10,242 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:10,252 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,252 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,252 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:10,252 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,264 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2025-04-26 18:41:10,264 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:10,280 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:10,286 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:10,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,288 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:10,289 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:10,291 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:10,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:10,302 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:10,302 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:10,302 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:10,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:10,305 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:10,310 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:10,329 INFO L436 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2025-04-26 18:41:10,330 INFO L437 ModelExtractionUtils]: 4 out of 16 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:41:10,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:10,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:10,333 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:10,334 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:10,335 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:10,351 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:10,351 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:10,351 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:10,351 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i, N) = -1*i + 1*N Supporting invariants [] [2025-04-26 18:41:10,361 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:10,364 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:10,382 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:41:10,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:41:10,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,410 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:10,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:10,426 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:10,439 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:10,440 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:10,532 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 114 states, 112 states have (on average 2.0267857142857144) internal successors, (in total 227), 113 states have internal predecessors, (227), 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 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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 260 states and 529 transitions. Complement of second has 7 states. [2025-04-26 18:41:10,533 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:10,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (in total 7), 3 states have internal predecessors, (7), 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:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-04-26 18:41:10,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 2 letters. [2025-04-26 18:41:10,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 7 letters. Loop has 2 letters. [2025-04-26 18:41:10,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,539 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 5 states and 47 transitions. Stem has 5 letters. Loop has 4 letters. [2025-04-26 18:41:10,539 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:10,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 260 states and 529 transitions. [2025-04-26 18:41:10,546 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:10,549 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 260 states to 119 states and 241 transitions. [2025-04-26 18:41:10,551 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-04-26 18:41:10,551 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2025-04-26 18:41:10,551 INFO L74 IsDeterministic]: Start isDeterministic. Operand 119 states and 241 transitions. [2025-04-26 18:41:10,551 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,552 INFO L218 hiAutomatonCegarLoop]: Abstraction has 119 states and 241 transitions. [2025-04-26 18:41:10,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 241 transitions. [2025-04-26 18:41:10,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 104. [2025-04-26 18:41:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.019230769230769) internal successors, (in total 210), 103 states have internal predecessors, (210), 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:10,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 210 transitions. [2025-04-26 18:41:10,576 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:10,576 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 210 transitions. [2025-04-26 18:41:10,576 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:41:10,576 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 210 transitions. [2025-04-26 18:41:10,577 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:10,577 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,577 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,577 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,577 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:10,577 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3) (= v_i_6 v_max3_1)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[67] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[69] thread1FINAL-->thread1EXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[]" "[84] L59-1-->L34-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:10,577 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_6 .cse0) .cse0 v_max2_6)) v_max2_5)) InVars {A=v_A_6, max2=v_max2_6, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_5, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:10,578 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1150702436, now seen corresponding path program 1 times [2025-04-26 18:41:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590373555] [2025-04-26 18:41:10,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-26 18:41:10,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-26 18:41:10,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,642 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:10,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:10,642 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590373555] [2025-04-26 18:41:10,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590373555] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:10,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:10,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-26 18:41:10,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269055344] [2025-04-26 18:41:10,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:10,646 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-04-26 18:41:10,647 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,647 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 1 times [2025-04-26 18:41:10,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699412364] [2025-04-26 18:41:10,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,652 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,656 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:10,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-26 18:41:10,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-26 18:41:10,689 INFO L87 Difference]: Start difference. First operand 104 states and 210 transitions. cyclomatic complexity: 133 Second operand has 5 states, 5 states have (on average 1.6) internal successors, (in total 8), 4 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:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:10,726 INFO L93 Difference]: Finished difference Result 106 states and 212 transitions. [2025-04-26 18:41:10,726 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 106 states and 212 transitions. [2025-04-26 18:41:10,727 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:10,728 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 106 states to 106 states and 212 transitions. [2025-04-26 18:41:10,728 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 62 [2025-04-26 18:41:10,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:41:10,730 INFO L74 IsDeterministic]: Start isDeterministic. Operand 106 states and 212 transitions. [2025-04-26 18:41:10,730 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:10,730 INFO L218 hiAutomatonCegarLoop]: Abstraction has 106 states and 212 transitions. [2025-04-26 18:41:10,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states and 212 transitions. [2025-04-26 18:41:10,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2025-04-26 18:41:10,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 104 states have (on average 2.0096153846153846) internal successors, (in total 209), 103 states have internal predecessors, (209), 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:10,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 209 transitions. [2025-04-26 18:41:10,736 INFO L240 hiAutomatonCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:10,736 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-26 18:41:10,737 INFO L438 stractBuchiCegarLoop]: Abstraction has 104 states and 209 transitions. [2025-04-26 18:41:10,737 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:41:10,737 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 209 transitions. [2025-04-26 18:41:10,739 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:10,739 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:10,739 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:10,739 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:10,739 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:10,739 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3) (= v_i_6 v_max3_1)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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[]" "[84] L59-1-->L34-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]" "[70] L23-->L23-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:10,740 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_6 .cse0) .cse0 v_max2_6)) v_max2_5)) InVars {A=v_A_6, max2=v_max2_6, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_5, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:10,740 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1312080987, now seen corresponding path program 1 times [2025-04-26 18:41:10,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,741 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906689210] [2025-04-26 18:41:10,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:10,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:10,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,751 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-26 18:41:10,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-26 18:41:10,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,766 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,766 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,766 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 2 times [2025-04-26 18:41:10,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,766 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225763210] [2025-04-26 18:41:10,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:10,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,779 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:10,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-26 18:41:10,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,779 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:10,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:10,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:10,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:10,786 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:10,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:10,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1810554211, now seen corresponding path program 1 times [2025-04-26 18:41:10,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:10,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249294560] [2025-04-26 18:41:10,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:10,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:10,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:10,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:10,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:10,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-26 18:41:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-26 18:41:10,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249294560] [2025-04-26 18:41:10,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249294560] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-26 18:41:10,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-26 18:41:10,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-26 18:41:10,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169721260] [2025-04-26 18:41:10,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-26 18:41:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-26 18:41:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-26 18:41:10,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-26 18:41:10,891 INFO L87 Difference]: Start difference. First operand 104 states and 209 transitions. cyclomatic complexity: 132 Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (in total 11), 6 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:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-26 18:41:10,995 INFO L93 Difference]: Finished difference Result 154 states and 290 transitions. [2025-04-26 18:41:10,995 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 154 states and 290 transitions. [2025-04-26 18:41:10,997 INFO L131 ngComponentsAnalysis]: Automaton has 25 accepting balls. 56 [2025-04-26 18:41:10,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 154 states to 152 states and 288 transitions. [2025-04-26 18:41:10,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 95 [2025-04-26 18:41:10,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 95 [2025-04-26 18:41:10,998 INFO L74 IsDeterministic]: Start isDeterministic. Operand 152 states and 288 transitions. [2025-04-26 18:41:10,998 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:11,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 152 states and 288 transitions. [2025-04-26 18:41:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states and 288 transitions. [2025-04-26 18:41:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 123. [2025-04-26 18:41:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 123 states have (on average 1.983739837398374) internal successors, (in total 244), 122 states have internal predecessors, (244), 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:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 244 transitions. [2025-04-26 18:41:11,005 INFO L240 hiAutomatonCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:11,006 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-26 18:41:11,006 INFO L438 stractBuchiCegarLoop]: Abstraction has 123 states and 244 transitions. [2025-04-26 18:41:11,006 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:41:11,006 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 123 states and 244 transitions. [2025-04-26 18:41:11,007 INFO L131 ngComponentsAnalysis]: Automaton has 18 accepting balls. 42 [2025-04-26 18:41:11,007 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:11,007 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:11,007 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:11,007 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:11,008 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3) (= v_i_6 v_max3_1)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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[]" "[84] L59-1-->L34-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]" "[70] L23-->L23-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[68] L23-1-->L23: 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[]" "[70] L23-->L23-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[67] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" [2025-04-26 18:41:11,008 INFO L754 eck$LassoCheckResult]: Loop: "[72] L34-1-->L34: Formula: (< v_j_1 v_M_1) InVars {M=v_M_1, j=v_j_1} OutVars{M=v_M_1, j=v_j_1} AuxVars[] AssignedVars[]" "[74] L34-->L34-1: Formula: (and (= (+ v_j_8 1) v_j_7) (= (let ((.cse0 (select v_A_6 v_j_8))) (ite (< v_max2_6 .cse0) .cse0 v_max2_6)) v_max2_5)) InVars {A=v_A_6, max2=v_max2_6, j=v_j_8} OutVars{A=v_A_6, max2=v_max2_5, j=v_j_7} AuxVars[] AssignedVars[j, max2]" [2025-04-26 18:41:11,008 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1810553319, now seen corresponding path program 2 times [2025-04-26 18:41:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,009 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156652496] [2025-04-26 18:41:11,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:11,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 11 statements into 2 equivalence classes. [2025-04-26 18:41:11,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:11,016 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,016 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:11,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:11,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash 3267, now seen corresponding path program 3 times [2025-04-26 18:41:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371255733] [2025-04-26 18:41:11,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-26 18:41:11,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,029 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,030 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,032 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-26 18:41:11,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,032 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:11,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:11,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,040 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,040 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -479982373, now seen corresponding path program 2 times [2025-04-26 18:41:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:11,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448866557] [2025-04-26 18:41:11,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-26 18:41:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:11,043 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-04-26 18:41:11,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:11,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-26 18:41:11,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,056 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:11,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:11,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:11,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:11,076 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:11,352 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:11,352 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:11,352 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:11,352 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:11,352 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:11,352 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,352 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:11,352 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:11,352 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array-hom.wvr.bpl_petrified1_Iteration4_Lasso [2025-04-26 18:41:11,352 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:11,352 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:11,355 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,357 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,361 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,365 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,495 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,497 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:11,792 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:11,792 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:11,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,794 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:11,795 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:11,796 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:11,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,808 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,808 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,810 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2025-04-26 18:41:11,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,817 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:11,818 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:11,819 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:11,829 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,829 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,829 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,829 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,834 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-04-26 18:41:11,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,843 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:11,845 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:11,846 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:11,855 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,856 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,856 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,856 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,859 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,864 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:11,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,866 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-04-26 18:41:11,868 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2025-04-26 18:41:11,877 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,882 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,889 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-04-26 18:41:11,891 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:11,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,901 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2025-04-26 18:41:11,901 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:11,901 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,920 INFO L402 nArgumentSynthesizer]: We have 28 Motzkin's Theorem applications. [2025-04-26 18:41:11,920 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:11,936 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:11,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2025-04-26 18:41:11,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,945 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2025-04-26 18:41:11,948 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:11,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:11,958 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:11,958 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:11,958 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:11,960 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:11,960 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:11,964 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:11,977 INFO L436 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2025-04-26 18:41:11,977 INFO L437 ModelExtractionUtils]: 2 out of 13 variables were initially zero. Simplification set additionally 8 variables to zero. [2025-04-26 18:41:11,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:11,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:11,979 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:11,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-04-26 18:41:11,982 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:11,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:11,999 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:11,999 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:11,999 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(M, j) = 1*M - 1*j Supporting invariants [] [2025-04-26 18:41:12,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:12,014 INFO L156 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2025-04-26 18:41:12,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:12,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,054 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,063 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:12,064 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:12,064 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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:12,109 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 123 states and 244 transitions. cyclomatic complexity: 148. Second operand has 3 states, 3 states have (on average 3.6666666666666665) 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) Result 267 states and 557 transitions. Complement of second has 6 states. [2025-04-26 18:41:12,110 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:12,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) 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:12,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2025-04-26 18:41:12,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:12,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:12,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,111 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 50 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:12,111 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 267 states and 557 transitions. [2025-04-26 18:41:12,113 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:12,116 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 267 states to 158 states and 310 transitions. [2025-04-26 18:41:12,116 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 64 [2025-04-26 18:41:12,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 92 [2025-04-26 18:41:12,117 INFO L74 IsDeterministic]: Start isDeterministic. Operand 158 states and 310 transitions. [2025-04-26 18:41:12,117 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:41:12,117 INFO L218 hiAutomatonCegarLoop]: Abstraction has 158 states and 310 transitions. [2025-04-26 18:41:12,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states and 310 transitions. [2025-04-26 18:41:12,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2025-04-26 18:41:12,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 121 states have (on average 2.074380165289256) internal successors, (in total 251), 120 states have internal predecessors, (251), 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:12,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 251 transitions. [2025-04-26 18:41:12,125 INFO L240 hiAutomatonCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:12,125 INFO L438 stractBuchiCegarLoop]: Abstraction has 121 states and 251 transitions. [2025-04-26 18:41:12,125 INFO L340 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-04-26 18:41:12,125 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 121 states and 251 transitions. [2025-04-26 18:41:12,125 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 14 [2025-04-26 18:41:12,125 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:41:12,125 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:41:12,126 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-26 18:41:12,126 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2025-04-26 18:41:12,126 INFO L752 eck$LassoCheckResult]: Stem: "[61] $Ultimate##0-->L56: Formula: (<= 0 v_M_3) InVars {M=v_M_3} OutVars{M=v_M_3} AuxVars[] AssignedVars[]" "[46] L56-->L57: Formula: (< v_M_4 v_N_3) InVars {M=v_M_4, N=v_N_3} OutVars{M=v_M_4, N=v_N_3} AuxVars[] AssignedVars[]" "[63] L57-->L58: Formula: (and (= v_i_6 0) (= v_j_6 v_i_6) (= v_i_6 v_max1_3) (= v_i_6 v_max2_3) (= v_i_6 v_max3_1)) InVars {i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} OutVars{i=v_i_6, max1=v_max1_3, max2=v_max2_3, j=v_j_6, max3=v_max3_1} AuxVars[] AssignedVars[]" "[48] L58-->L59: Formula: (= v_M_5 v_k_1) InVars {M=v_M_5, k=v_k_1} OutVars{M=v_M_5, k=v_k_1} AuxVars[] AssignedVars[]" "[81] L59-->L23-1: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[68] L23-1-->L23: 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[]" "[84] L59-1-->L34-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]" "[70] L23-->L23-1: Formula: (and (= (let ((.cse0 (select v_A_4 v_i_8))) (ite (< v_max1_6 .cse0) .cse0 v_max1_6)) v_max1_5) (= (+ v_i_8 1) v_i_7)) InVars {A=v_A_4, i=v_i_8, max1=v_max1_6} OutVars{A=v_A_4, i=v_i_7, max1=v_max1_5} AuxVars[] AssignedVars[i, max1]" "[87] L60-->L45-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]" "[67] L23-1-->thread1FINAL: Formula: (<= v_N_2 v_i_5) InVars {i=v_i_5, N=v_N_2} OutVars{i=v_i_5, N=v_N_2} AuxVars[] AssignedVars[]" "[71] L34-1-->thread2FINAL: Formula: (<= v_M_2 v_j_5) InVars {M=v_M_2, j=v_j_5} OutVars{M=v_M_2, j=v_j_5} AuxVars[] AssignedVars[]" [2025-04-26 18:41:12,126 INFO L754 eck$LassoCheckResult]: Loop: "[76] L45-1-->L45: 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[]" "[78] L45-->L45-1: Formula: (and (= (+ v_k_8 1) v_k_7) (= (let ((.cse0 (select v_A_8 v_k_8))) (ite (< v_max3_6 .cse0) .cse0 v_max3_6)) v_max3_5)) InVars {A=v_A_8, k=v_k_8, max3=v_max3_6} OutVars{A=v_A_8, k=v_k_7, max3=v_max3_5} AuxVars[] AssignedVars[k, max3]" [2025-04-26 18:41:12,126 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1810535149, now seen corresponding path program 1 times [2025-04-26 18:41:12,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,127 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203699090] [2025-04-26 18:41:12,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:12,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:12,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:12,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,137 INFO L85 PathProgramCache]: Analyzing trace with hash 3395, now seen corresponding path program 1 times [2025-04-26 18:41:12,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679821727] [2025-04-26 18:41:12,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:12,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,140 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,142 INFO L85 PathProgramCache]: Analyzing trace with hash -462520875, now seen corresponding path program 1 times [2025-04-26 18:41:12,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:41:12,142 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988505917] [2025-04-26 18:41:12,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:41:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:41:12,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:12,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:12,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,148 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:41:12,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-26 18:41:12,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-26 18:41:12,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:41:12,154 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:41:12,338 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:41:12,338 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:41:12,338 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:41:12,338 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:41:12,338 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:41:12,338 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,338 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:41:12,338 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:41:12,338 INFO L132 ssoRankerPreferences]: Filename of dumped script: max-array-hom.wvr.bpl_petrified1_Iteration5_Lasso [2025-04-26 18:41:12,338 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:41:12,338 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:41:12,340 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,342 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,399 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,402 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,404 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,405 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,409 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,411 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,413 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,415 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:41:12,589 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:41:12,589 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:41:12,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,592 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-04-26 18:41:12,597 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:12,607 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,607 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,607 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,611 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2025-04-26 18:41:12,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,618 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-04-26 18:41:12,620 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:12,630 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,630 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2025-04-26 18:41:12,630 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2025-04-26 18:41:12,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,637 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2025-04-26 18:41:12,637 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2025-04-26 18:41:12,648 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:41:12,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2025-04-26 18:41:12,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,657 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-04-26 18:41:12,659 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:12,668 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:41:12,669 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:41:12,669 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:41:12,669 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:41:12,671 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:41:12,671 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:41:12,675 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:41:12,680 INFO L436 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2025-04-26 18:41:12,680 INFO L437 ModelExtractionUtils]: 1 out of 13 variables were initially zero. Simplification set additionally 9 variables to zero. [2025-04-26 18:41:12,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:41:12,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:41:12,682 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-04-26 18:41:12,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2025-04-26 18:41:12,684 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:41:12,700 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2025-04-26 18:41:12,701 INFO L439 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2025-04-26 18:41:12,701 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:41:12,701 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(k, N) = -1*k + 1*N Supporting invariants [] [2025-04-26 18:41:12,709 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:12,709 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:41:12,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:41:12,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-26 18:41:12,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-26 18:41:12,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:41:12,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:41:12,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:41:12,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:41:12,741 WARN L254 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:41:12,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:41:12,753 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:12,754 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:12,754 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149 Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:12,810 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 121 states and 251 transitions. cyclomatic complexity: 149. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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 224 states and 442 transitions. Complement of second has 6 states. [2025-04-26 18:41:12,814 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:12,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (in total 13), 3 states have internal predecessors, (13), 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:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2025-04-26 18:41:12,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 2 letters. [2025-04-26 18:41:12,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 13 letters. Loop has 2 letters. [2025-04-26 18:41:12,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,815 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 43 transitions. Stem has 11 letters. Loop has 4 letters. [2025-04-26 18:41:12,815 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:41:12,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 442 transitions. [2025-04-26 18:41:12,818 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,818 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2025-04-26 18:41:12,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:41:12,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:41:12,818 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,818 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:41:12,819 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,819 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,819 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:41:12,819 INFO L340 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-04-26 18:41:12,819 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:41:12,819 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:41:12,819 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:41:12,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-26 18:41:12,830 INFO L201 PluginConnector]: Adding new model max-array-hom.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:41:12 BoogieIcfgContainer [2025-04-26 18:41:12,830 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:41:12,831 INFO L158 Benchmark]: Toolchain (without parser) took 3844.65ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 83.6MB in the beginning and 46.9MB in the end (delta: 36.7MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,832 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.53ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,833 INFO L158 Benchmark]: Boogie Preprocessor took 26.16ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,834 INFO L158 Benchmark]: RCFGBuilder took 164.24ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 70.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-26 18:41:12,834 INFO L158 Benchmark]: BuchiAutomizer took 3611.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 70.8MB in the beginning and 46.9MB in the end (delta: 23.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:41:12,835 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 155.2MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.53ms. Allocated memory is still 155.2MB. Free memory was 83.6MB in the beginning and 81.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.16ms. Allocated memory is still 155.2MB. Free memory was 81.7MB in the beginning and 80.7MB in the end (delta: 1.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 164.24ms. Allocated memory is still 155.2MB. Free memory was 80.7MB in the beginning and 70.8MB in the end (delta: 9.9MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * BuchiAutomizer took 3611.53ms. Allocated memory was 155.2MB in the beginning and 125.8MB in the end (delta: -29.4MB). Free memory was 70.8MB in the beginning and 46.9MB in the end (delta: 23.9MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.5s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 2.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 83 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 [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 110 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 230 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 60 mSDtfsCounter, 230 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital102 mio100 ax100 hnf100 lsp212 ukn43 mio100 lsp64 div100 bol100 ite100 ukn100 eq158 hnf94 smp100 dnf467 smp46 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 49ms VariablesStem: 6 VariablesLoop: 3 DisjunctsStem: 4 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 28 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 148, Number of transitions in reduction automaton: 227, Number of states in reduction automaton: 114, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function N + -1 * i and consists of 5 locations. One deterministic module has affine ranking function M + -1 * j and consists of 4 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 6 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:41:12,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...