/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/chl/array-int-trans.wvr.bpl -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.ample-buchi-a4216cd-m [2025-04-26 18:40:03,895 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-26 18:40:03,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/Termination.epf [2025-04-26 18:40:03,946 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-26 18:40:03,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-26 18:40:03,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Check unreachability of error function in SV-COMP mode [2025-04-26 18:40:03,946 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2025-04-26 18:40:03,969 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-26 18:40:03,970 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-26 18:40:03,970 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-26 18:40:03,970 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-26 18:40:03,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-26 18:40:03,970 INFO L153 SettingsManager]: * Use SBE=true [2025-04-26 18:40:03,970 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-04-26 18:40:03,971 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Use old map elimination=false [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Automaton type for concurrent programs=PARTIAL_ORDER_BA [2025-04-26 18:40:03,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-26 18:40:03,972 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-26 18:40:03,973 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:03,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-26 18:40:03,973 INFO L153 SettingsManager]: * Use conditional POR in concurrent analysis=false [2025-04-26 18:40:03,974 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-04-26 18:40:03,974 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR [2025-04-26 18:40:04,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-26 18:40:04,206 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-26 18:40:04,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-26 18:40:04,208 INFO L270 PluginConnector]: Initializing Boogie PL CUP Parser... [2025-04-26 18:40:04,208 INFO L274 PluginConnector]: Boogie PL CUP Parser initialized [2025-04-26 18:40:04,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl [2025-04-26 18:40:04,209 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/concurrent/bpl/weaver-benchmarks/generated/chl/array-int-trans.wvr.bpl' [2025-04-26 18:40:04,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-26 18:40:04,224 INFO L133 ToolchainWalker]: Walking toolchain with 4 elements. [2025-04-26 18:40:04,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:04,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-26 18:40:04,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-26 18:40:04,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,249 INFO L138 Inliner]: procedures = 4, calls = 3, calls flagged for inlining = 0, calls inlined = 0, statements flattened = 0 [2025-04-26 18:40:04,250 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-26 18:40:04,251 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-26 18:40:04,251 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-26 18:40:04,251 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-26 18:40:04,255 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,257 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,259 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,260 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,261 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,270 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-26 18:40:04,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-26 18:40:04,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-26 18:40:04,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-26 18:40:04,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/1) ... [2025-04-26 18:40:04,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -smt2 -in -t:4000 [2025-04-26 18:40:04,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,295 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:40:04,298 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:40:04,319 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread1 given in one single declaration [2025-04-26 18:40:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-26 18:40:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-26 18:40:04,320 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread2 given in one single declaration [2025-04-26 18:40:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-26 18:40:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-26 18:40:04,320 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2025-04-26 18:40:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-26 18:40:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-26 18:40:04,320 INFO L124 BoogieDeclarations]: Specification and implementation of procedure thread3 given in one single declaration [2025-04-26 18:40:04,320 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-26 18:40:04,320 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-26 18:40:04,321 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:40:04,358 INFO L234 CfgBuilder]: Building ICFG [2025-04-26 18:40:04,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-26 18:40:04,458 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-26 18:40:04,458 INFO L283 CfgBuilder]: Performing block encoding [2025-04-26 18:40:04,486 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-26 18:40:04,486 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-26 18:40:04,486 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:04 BoogieIcfgContainer [2025-04-26 18:40:04,486 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-26 18:40:04,487 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-04-26 18:40:04,487 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-04-26 18:40:04,493 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-04-26 18:40:04,494 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:04,494 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.04 06:40:04" (1/2) ... [2025-04-26 18:40:04,495 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@340aa808 and model type array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.04 06:40:04, skipping insertion in model container [2025-04-26 18:40:04,495 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-04-26 18:40:04,495 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.04 06:40:04" (2/2) ... [2025-04-26 18:40:04,496 INFO L376 chiAutomizerObserver]: Analyzing ICFG array-int-trans.wvr.bpl [2025-04-26 18:40:04,540 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-26 18:40:04,576 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-26 18:40:04,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-26 18:40:04,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:04,579 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:40:04,580 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:40:04,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:04,649 INFO L116 PetriNetUnfolderBase]: 3/22 cut-off events. [2025-04-26 18:40:04,652 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-26 18:40:04,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35 conditions, 22 events. 3/22 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 24 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 18. Up to 2 conditions per place. [2025-04-26 18:40:04,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 28 transitions, 77 flow [2025-04-26 18:40:04,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:04,657 INFO L84 lAbstractionProvider]: Constructed initial Petri net abstraction that has has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:04,657 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 29 places, 22 transitions, 62 flow [2025-04-26 18:40:04,674 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:40:04,674 INFO L171 actionProvider$Eager]: Constructed initial Büchi automaton abstraction (from Petri net) that has 110 states, 108 states have (on average 2.8703703703703702) internal successors, (in total 310), 109 states have internal predecessors, (310), 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:40:04,676 INFO L135 AmpleReduction]: Starting ample reduction [2025-04-26 18:40:04,702 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 205#[L87, thread1EXIT, L72, thread2EXIT]true [2025-04-26 18:40:04,703 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 219#[L88, L72, thread2EXIT]true [2025-04-26 18:40:04,705 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 105#[thread1EXIT, L86, L53]true [2025-04-26 18:40:04,706 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 175#[thread1EXIT, L87, L72, thread2FINAL]true [2025-04-26 18:40:04,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 197#[L88, L72, thread2FINAL]true [2025-04-26 18:40:04,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 145#[L87, L53, thread1EXIT, L72]true [2025-04-26 18:40:04,707 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 179#[thread1EXIT, L53, L87, thread3FINAL]true [2025-04-26 18:40:04,708 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 207#[L87, L53, thread1EXIT, thread3EXIT]true [2025-04-26 18:40:04,708 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 201#[L88, L53, thread3FINAL]true [2025-04-26 18:40:04,710 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 173#[L88, L72, L53]true [2025-04-26 18:40:04,710 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 41#[L34, L85]true [2025-04-26 18:40:04,711 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 77#[L86, L53, thread1FINAL]true [2025-04-26 18:40:04,712 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 147#[L87, L72, thread1FINAL, thread2FINAL]true [2025-04-26 18:40:04,712 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 115#[L53, L87, L72, thread1FINAL]true [2025-04-26 18:40:04,712 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 151#[thread3FINAL, L87, L53, thread1FINAL]true [2025-04-26 18:40:04,713 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 185#[L53, L87, thread3EXIT, thread1FINAL]true [2025-04-26 18:40:04,713 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 57#[L86, L53, L34]true [2025-04-26 18:40:04,713 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 79#[L86, thread2FINAL, L34]true [2025-04-26 18:40:04,715 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 109#[L86, thread2EXIT, L34]true [2025-04-26 18:40:04,718 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 183#[L87, L72, thread1FINAL, thread2EXIT]true [2025-04-26 18:40:04,718 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 155#[L87, L72, L34, thread2EXIT]true [2025-04-26 18:40:04,718 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 189#[L87, thread3FINAL, L34, thread2EXIT]true [2025-04-26 18:40:04,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 117#[L87, L72, L34, thread2FINAL]true [2025-04-26 18:40:04,719 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 153#[thread3FINAL, L87, L34, thread2FINAL]true [2025-04-26 18:40:04,720 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 187#[L87, thread3EXIT, L34, thread2FINAL]true [2025-04-26 18:40:04,720 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 89#[L87, L53, L72, L34]true [2025-04-26 18:40:04,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 121#[thread3FINAL, L53, L87, L34]true [2025-04-26 18:40:04,721 WARN L275 AmpleReduction]: Non-loop node is now a loop node: 157#[L87, L53, thread3EXIT, L34]true [2025-04-26 18:40:04,721 WARN L140 AmpleReduction]: Number of pruned transitions: 45 [2025-04-26 18:40:04,721 WARN L141 AmpleReduction]: Loop nodes with "changing loop node status": 28 [2025-04-26 18:40:04,722 WARN L142 AmpleReduction]: Number of trivial sets caused by loops: 28 [2025-04-26 18:40:04,722 WARN L143 AmpleReduction]: Number of not loop caused trivial ample sets:16 [2025-04-26 18:40:04,722 WARN L144 AmpleReduction]: Number of initially assigned non-trivial ample sets:49 [2025-04-26 18:40:04,722 WARN L145 AmpleReduction]: Times succ was already a loop node:0 [2025-04-26 18:40:04,722 WARN L146 AmpleReduction]: Times some other node on the cycle already had a trivial ample set:0 [2025-04-26 18:40:04,722 INFO L149 AmpleReduction]: Finished ample reduction [2025-04-26 18:40:04,722 INFO L136 dAbstractionProvider]: Constructed initial ample set-reduced NBA abstraction that has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:04,728 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-04-26 18:40:04,729 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-04-26 18:40:04,729 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-04-26 18:40:04,729 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-04-26 18:40:04,729 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-04-26 18:40:04,729 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-04-26 18:40:04,729 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-04-26 18:40:04,729 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-04-26 18:40:04,730 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:04,741 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:04,741 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,741 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,744 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:04,744 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:04,744 INFO L340 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-04-26 18:40:04,745 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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:40:04,747 INFO L131 ngComponentsAnalysis]: Automaton has 31 accepting balls. 31 [2025-04-26 18:40:04,747 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:04,747 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:04,747 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-04-26 18:40:04,747 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:04,751 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 18:40:04,751 INFO L754 eck$LassoCheckResult]: Loop: "[88] L34-->L34: Formula: (let ((.cse1 (select v_array_2_9 v_i_6_16)) (.cse2 (select v_array_0_9 v_i_6_16))) (let ((.cse0 (= .cse1 .cse2))) (and (or (and (not v_break_7_13) .cse0) (and (not .cse0) v_break_7_13)) (not v_break_7_14) (< v_i_6_17 v_len_1_11) (= v_result_8_17 (ite .cse0 v_result_8_18 (+ (* (- 1) .cse1) .cse2))) (< v_i_6_17 v_len_3_11) (= v_i_6_16 (+ v_i_6_17 1))))) InVars {result_8=v_result_8_18, i_6=v_i_6_17, len_1=v_len_1_11, array_2=v_array_2_9, len_3=v_len_3_11, break_7=v_break_7_14, array_0=v_array_0_9} OutVars{result_8=v_result_8_17, i_6=v_i_6_16, len_1=v_len_1_11, array_2=v_array_2_9, break_7=v_break_7_13, len_3=v_len_3_11, array_0=v_array_0_9} AuxVars[] AssignedVars[result_8, i_6, break_7]" [2025-04-26 18:40:04,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,754 INFO L85 PathProgramCache]: Analyzing trace with hash 4147, now seen corresponding path program 1 times [2025-04-26 18:40:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708323587] [2025-04-26 18:40:04,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,803 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:04,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:04,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,820 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,822 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 119, now seen corresponding path program 1 times [2025-04-26 18:40:04,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847474541] [2025-04-26 18:40:04,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:04,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:04,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:04,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:04,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,846 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:04,846 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:04,847 INFO L85 PathProgramCache]: Analyzing trace with hash 128645, now seen corresponding path program 1 times [2025-04-26 18:40:04,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:04,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182315466] [2025-04-26 18:40:04,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:04,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:04,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:04,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:04,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:04,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-04-26 18:40:04,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-04-26 18:40:04,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:04,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:04,872 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,093 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,094 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,094 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,094 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,094 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:05,094 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,094 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,095 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,095 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration1_Lasso [2025-04-26 18:40:05,095 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,095 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,113 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,388 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:05,390 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:05,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,394 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:40:05,395 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:40:05,397 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:40:05,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:05,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:05,410 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:05,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:05,460 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:05,460 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:05,512 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:05,556 INFO L436 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2025-04-26 18:40:05,556 INFO L437 ModelExtractionUtils]: 48 out of 57 variables were initially zero. Simplification set additionally 6 variables to zero. [2025-04-26 18:40:05,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:05,560 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:40:05,561 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:40:05,561 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:05,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2025-04-26 18:40:05,583 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 18:40:05,584 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:05,584 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(i_6, len_1) = -1*i_6 + 1*len_1 Supporting invariants [] [2025-04-26 18:40:05,592 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:40:05,594 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:05,611 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-04-26 18:40:05,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-04-26 18:40:05,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:05,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:05,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:05,634 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:40:05,647 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:05,648 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:40:05,710 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 66 states, 64 states have (on average 2.15625) internal successors, (in total 138), 65 states have internal predecessors, (138), 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 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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 167 states and 409 transitions. Complement of second has 5 states. [2025-04-26 18:40:05,712 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:05,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 1.5) internal successors, (in total 3), 2 states have internal predecessors, (3), 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:40:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2025-04-26 18:40:05,719 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 1 letters. [2025-04-26 18:40:05,719 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 3 letters. Loop has 1 letters. [2025-04-26 18:40:05,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,720 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2025-04-26 18:40:05,720 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:05,720 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 409 transitions. [2025-04-26 18:40:05,728 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:05,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 83 states and 205 transitions. [2025-04-26 18:40:05,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2025-04-26 18:40:05,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 62 [2025-04-26 18:40:05,736 INFO L74 IsDeterministic]: Start isDeterministic. Operand 83 states and 205 transitions. [2025-04-26 18:40:05,737 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:05,737 INFO L218 hiAutomatonCegarLoop]: Abstraction has 83 states and 205 transitions. [2025-04-26 18:40:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states and 205 transitions. [2025-04-26 18:40:05,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2025-04-26 18:40:05,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.5625) internal successors, (in total 164), 63 states have internal predecessors, (164), 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:40:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 164 transitions. [2025-04-26 18:40:05,756 INFO L240 hiAutomatonCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:05,756 INFO L438 stractBuchiCegarLoop]: Abstraction has 64 states and 164 transitions. [2025-04-26 18:40:05,756 INFO L340 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-04-26 18:40:05,756 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 164 transitions. [2025-04-26 18:40:05,760 INFO L131 ngComponentsAnalysis]: Automaton has 24 accepting balls. 24 [2025-04-26 18:40:05,760 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:05,760 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:05,760 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-04-26 18:40:05,760 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:05,761 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" "[103] L85-->$Ultimate##0: 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]" "[90] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= (+ v_result_11_19 v_len_5_11) v_len_3_17) (= v_i_9_18 0)) InVars {len_5=v_len_5_11, len_3=v_len_3_17} OutVars{len_5=v_len_5_11, result_11=v_result_11_19, break_10=v_break_10_15, len_3=v_len_3_17, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 18:40:05,761 INFO L754 eck$LassoCheckResult]: Loop: "[92] L53-->L53: Formula: (let ((.cse2 (select v_array_2_15 v_i_9_14)) (.cse1 (select v_array_4_9 v_i_9_14))) (let ((.cse0 (= .cse2 .cse1))) (and (< v_i_9_15 v_len_3_13) (< v_i_9_15 v_len_5_7) (not v_break_10_10) (= (+ v_i_9_15 1) v_i_9_14) (or (and v_break_10_9 (not .cse0)) (and .cse0 (not v_break_10_9))) (= (ite .cse0 v_result_11_14 (+ (* (- 1) .cse1) .cse2)) v_result_11_13)))) InVars {result_11=v_result_11_14, break_10=v_break_10_10, array_4=v_array_4_9, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_7, i_9=v_i_9_15} OutVars{result_11=v_result_11_13, break_10=v_break_10_9, array_4=v_array_4_9, array_2=v_array_2_15, len_3=v_len_3_13, len_5=v_len_5_7, i_9=v_i_9_14} AuxVars[] AssignedVars[result_11, break_10, i_9]" [2025-04-26 18:40:05,761 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 3988550, now seen corresponding path program 1 times [2025-04-26 18:40:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853691000] [2025-04-26 18:40:05,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:05,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:05,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,766 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:05,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:05,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,769 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash 123, now seen corresponding path program 1 times [2025-04-26 18:40:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041298975] [2025-04-26 18:40:05,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,777 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:05,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:05,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,784 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,784 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:05,784 INFO L85 PathProgramCache]: Analyzing trace with hash 123645142, now seen corresponding path program 1 times [2025-04-26 18:40:05,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:05,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424139207] [2025-04-26 18:40:05,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:05,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,795 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:05,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-26 18:40:05,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-26 18:40:05,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:05,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:05,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:05,953 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:05,953 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:05,953 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:05,953 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:05,953 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:05,953 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:05,953 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:05,954 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:05,954 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration2_Lasso [2025-04-26 18:40:05,954 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:05,954 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:05,955 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,959 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,964 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:05,967 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,017 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,024 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,206 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:06,206 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:06,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,208 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:40:06,209 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:40:06,210 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:40:06,220 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,220 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,220 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,220 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,223 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,229 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:40:06,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,249 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:40:06,255 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:40:06,255 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:40:06,265 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,265 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,265 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,265 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,267 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,267 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,269 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,276 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:40:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,278 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:40:06,279 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:40:06,280 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:40:06,290 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,290 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,290 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,292 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:06,294 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:06,300 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:40:06,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,303 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:40:06,304 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:40:06,306 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:40:06,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,317 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:06,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,340 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:06,340 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:06,391 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:06,417 INFO L436 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2025-04-26 18:40:06,417 INFO L437 ModelExtractionUtils]: 61 out of 71 variables were initially zero. Simplification set additionally 7 variables to zero. [2025-04-26 18:40:06,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,419 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:40:06,419 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:40:06,420 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:06,438 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:40:06,438 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 18:40:06,438 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:06,438 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_3, i_9) = 1*len_3 - 1*i_9 Supporting invariants [] [2025-04-26 18:40:06,445 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:40:06,446 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:06,459 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-26 18:40:06,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-26 18:40:06,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:06,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:06,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:06,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:06,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:06,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:06,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:06,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:06,474 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:40:06,474 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:06,474 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133 Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,503 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 164 transitions. cyclomatic complexity: 133. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) Result 177 states and 468 transitions. Complement of second has 4 states. [2025-04-26 18:40:06,503 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:06,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (in total 5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (in total 0), 0 states have return successors, (0), 0 states have call predecessors, ( in total0), 0 states have call successors, (0) [2025-04-26 18:40:06,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2025-04-26 18:40:06,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 1 letters. [2025-04-26 18:40:06,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 5 letters. Loop has 1 letters. [2025-04-26 18:40:06,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,504 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 4 letters. Loop has 2 letters. [2025-04-26 18:40:06,504 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:06,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 177 states and 468 transitions. [2025-04-26 18:40:06,507 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:06,508 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 177 states to 91 states and 232 transitions. [2025-04-26 18:40:06,508 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2025-04-26 18:40:06,508 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2025-04-26 18:40:06,508 INFO L74 IsDeterministic]: Start isDeterministic. Operand 91 states and 232 transitions. [2025-04-26 18:40:06,508 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-04-26 18:40:06,508 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 232 transitions. [2025-04-26 18:40:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 232 transitions. [2025-04-26 18:40:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 77. [2025-04-26 18:40:06,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 2.675324675324675) internal successors, (in total 206), 76 states have internal predecessors, (206), 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:40:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 206 transitions. [2025-04-26 18:40:06,513 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:06,513 INFO L438 stractBuchiCegarLoop]: Abstraction has 77 states and 206 transitions. [2025-04-26 18:40:06,513 INFO L340 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-04-26 18:40:06,513 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 206 transitions. [2025-04-26 18:40:06,514 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 13 [2025-04-26 18:40:06,514 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-04-26 18:40:06,514 INFO L120 BuchiIsEmpty]: Starting construction of run [2025-04-26 18:40:06,514 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2025-04-26 18:40:06,514 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-04-26 18:40:06,514 INFO L752 eck$LassoCheckResult]: Stem: "[100] $Ultimate##0-->$Ultimate##0: Formula: (= v_thread1Thread1of1ForFork0_thidvar0_2 1) InVars {} OutVars{thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_thidvar0]" "[86] $Ultimate##0-->L34: Formula: (and (not v_break_7_7) (= v_len_1_9 (+ v_result_8_7 v_len_3_9)) (= v_i_6_8 0)) InVars {len_1=v_len_1_9, len_3=v_len_3_9} OutVars{result_8=v_result_8_7, i_6=v_i_6_8, len_1=v_len_1_9, len_3=v_len_3_9, break_7=v_break_7_7} AuxVars[] AssignedVars[result_8, i_6, break_7]" "[103] L85-->$Ultimate##0: 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]" "[90] $Ultimate##0-->L53: Formula: (and (not v_break_10_15) (= (+ v_result_11_19 v_len_5_11) v_len_3_17) (= v_i_9_18 0)) InVars {len_5=v_len_5_11, len_3=v_len_3_17} OutVars{len_5=v_len_5_11, result_11=v_result_11_19, break_10=v_break_10_15, len_3=v_len_3_17, i_9=v_i_9_18} AuxVars[] AssignedVars[result_11, break_10, i_9]" "[106] L86-->$Ultimate##0: 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]" "[94] $Ultimate##0-->L72: Formula: (and (= v_len_1_17 (+ v_result_14_19 v_len_5_17)) (= v_i_12_18 0) (not v_break_13_15)) InVars {len_1=v_len_1_17, len_5=v_len_5_17} OutVars{len_5=v_len_5_17, i_12=v_i_12_18, result_14=v_result_14_19, len_1=v_len_1_17, break_13=v_break_13_15} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 18:40:06,514 INFO L754 eck$LassoCheckResult]: Loop: "[96] L72-->L72: Formula: (let ((.cse1 (select v_array_4_15 v_i_12_14)) (.cse2 (select v_array_0_15 v_i_12_14))) (let ((.cse0 (= .cse1 .cse2))) (and (< v_i_12_15 v_len_5_13) (or (and v_break_13_9 (not .cse0)) (and .cse0 (not v_break_13_9))) (< v_i_12_15 v_len_1_13) (not v_break_13_10) (= (+ v_i_12_15 1) v_i_12_14) (= v_result_14_13 (ite .cse0 v_result_14_14 (+ (* (- 1) .cse1) .cse2)))))) InVars {result_14=v_result_14_14, array_4=v_array_4_15, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_13, i_12=v_i_12_15, break_13=v_break_13_10} OutVars{result_14=v_result_14_13, array_4=v_array_4_15, len_1=v_len_1_13, array_0=v_array_0_15, len_5=v_len_5_13, i_12=v_i_12_14, break_13=v_break_13_9} AuxVars[] AssignedVars[result_14, i_12, break_13]" [2025-04-26 18:40:06,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,515 INFO L85 PathProgramCache]: Analyzing trace with hash -461967366, now seen corresponding path program 1 times [2025-04-26 18:40:06,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,515 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147083657] [2025-04-26 18:40:06,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:06,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:06,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,521 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:06,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:06,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,531 INFO L85 PathProgramCache]: Analyzing trace with hash 127, now seen corresponding path program 1 times [2025-04-26 18:40:06,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718438675] [2025-04-26 18:40:06,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:06,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:06,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,539 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:06,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:06,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,544 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:06,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1436086362, now seen corresponding path program 1 times [2025-04-26 18:40:06,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-26 18:40:06,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828901886] [2025-04-26 18:40:06,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-26 18:40:06,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-26 18:40:06,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:06,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:06,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,555 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-26 18:40:06,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-26 18:40:06,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-26 18:40:06,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-26 18:40:06,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-26 18:40:06,713 INFO L206 LassoAnalysis]: Preferences: [2025-04-26 18:40:06,713 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-04-26 18:40:06,713 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-04-26 18:40:06,713 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-04-26 18:40:06,713 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-04-26 18:40:06,713 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,713 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-04-26 18:40:06,713 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-04-26 18:40:06,713 INFO L132 ssoRankerPreferences]: Filename of dumped script: array-int-trans.wvr.bpl_petrified1_Iteration3_Lasso [2025-04-26 18:40:06,713 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-04-26 18:40:06,713 INFO L243 LassoAnalysis]: Starting lasso preprocessing... [2025-04-26 18:40:06,715 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,719 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,722 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,724 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,726 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,728 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,730 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,732 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,733 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,779 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,781 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-04-26 18:40:06,980 INFO L261 LassoAnalysis]: Preprocessing complete. [2025-04-26 18:40:06,980 INFO L453 LassoAnalysis]: Using template 'affine'. [2025-04-26 18:40:06,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:06,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:06,985 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:40:06,986 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:40:06,987 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:40:06,998 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:06,998 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:06,998 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:06,998 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:06,999 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:06,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,001 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,011 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:40:07,012 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:40:07,013 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:40:07,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,026 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,026 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,028 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,035 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:40:07,037 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:40:07,038 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:40:07,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,050 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,050 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,053 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-04-26 18:40:07,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,060 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:40:07,062 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:40:07,063 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:40:07,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,073 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,077 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,083 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:40:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,086 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:40:07,086 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:40:07,088 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:40:07,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,099 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,101 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,107 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:40:07,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,109 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:40:07,109 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:40:07,110 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:40:07,120 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,120 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,120 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,120 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,123 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2025-04-26 18:40:07,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,131 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:40:07,131 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:40:07,132 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:40:07,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,153 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,158 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2025-04-26 18:40:07,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,160 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:40:07,160 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:40:07,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:40:07,170 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,171 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,171 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-04-26 18:40:07,171 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-04-26 18:40:07,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-04-26 18:40:07,174 INFO L490 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-04-26 18:40:07,179 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:40:07,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,181 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:40:07,181 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:40:07,182 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:40:07,192 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-04-26 18:40:07,193 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-04-26 18:40:07,193 INFO L204 nArgumentSynthesizer]: 3 loop disjuncts [2025-04-26 18:40:07,193 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-04-26 18:40:07,225 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2025-04-26 18:40:07,225 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2025-04-26 18:40:07,273 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-04-26 18:40:07,304 INFO L436 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-04-26 18:40:07,304 INFO L437 ModelExtractionUtils]: 50 out of 78 variables were initially zero. Simplification set additionally 25 variables to zero. [2025-04-26 18:40:07,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-04-26 18:40:07,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-26 18:40:07,306 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:40:07,307 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:40:07,309 INFO L436 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-04-26 18:40:07,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2025-04-26 18:40:07,326 INFO L439 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2025-04-26 18:40:07,326 INFO L476 LassoAnalysis]: Proved termination. [2025-04-26 18:40:07,326 INFO L478 LassoAnalysis]: Termination argument consisting of: Ranking function f(len_5, i_12) = 1*len_5 - 1*i_12 Supporting invariants [] [2025-04-26 18:40:07,333 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:40:07,334 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-04-26 18:40:07,343 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-26 18:40:07,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-26 18:40:07,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-26 18:40:07,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-26 18:40:07,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-26 18:40:07,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-26 18:40:07,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-26 18:40:07,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-26 18:40:07,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-26 18:40:07,366 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:40:07,366 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-04-26 18:40:07,367 INFO L70 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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:40:07,393 INFO L74 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 77 states and 206 transitions. cyclomatic complexity: 158. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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 148 states and 380 transitions. Complement of second has 4 states. [2025-04-26 18:40:07,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2025-04-26 18:40:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (in total 7), 2 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:40:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2025-04-26 18:40:07,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 1 letters. [2025-04-26 18:40:07,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 7 letters. Loop has 1 letters. [2025-04-26 18:40:07,394 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,394 INFO L85 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 6 letters. Loop has 2 letters. [2025-04-26 18:40:07,395 INFO L117 BuchiAccepts]: Finished buchiAccepts. [2025-04-26 18:40:07,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 148 states and 380 transitions. [2025-04-26 18:40:07,396 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:07,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 148 states to 0 states and 0 transitions. [2025-04-26 18:40:07,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-04-26 18:40:07,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-04-26 18:40:07,396 INFO L74 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-04-26 18:40:07,396 INFO L81 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-04-26 18:40:07,396 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,397 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,397 INFO L438 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-04-26 18:40:07,397 INFO L340 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-04-26 18:40:07,397 INFO L73 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-04-26 18:40:07,397 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-04-26 18:40:07,397 INFO L88 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-04-26 18:40:07,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-26 18:40:07,410 INFO L201 PluginConnector]: Adding new model array-int-trans.wvr.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.04 06:40:07 BoogieIcfgContainer [2025-04-26 18:40:07,410 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-04-26 18:40:07,411 INFO L158 Benchmark]: Toolchain (without parser) took 3186.40ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 97.9MB in the end (delta: -15.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,412 INFO L158 Benchmark]: Boogie PL CUP Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.89ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,412 INFO L158 Benchmark]: Boogie Preprocessor took 18.98ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 79.2MB in the end (delta: 985.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,412 INFO L158 Benchmark]: RCFGBuilder took 216.29ms. Allocated memory is still 155.2MB. Free memory was 79.0MB in the beginning and 66.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-26 18:40:07,412 INFO L158 Benchmark]: BuchiAutomizer took 2922.74ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 97.9MB in the end (delta: -31.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-26 18:40:07,413 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.15ms. Allocated memory is still 155.2MB. Free memory is still 83.2MB. There was no memory consumed. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.89ms. Allocated memory is still 155.2MB. Free memory was 82.1MB in the beginning and 80.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 18.98ms. Allocated memory is still 155.2MB. Free memory was 80.1MB in the beginning and 79.2MB in the end (delta: 985.4kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 216.29ms. Allocated memory is still 155.2MB. Free memory was 79.0MB in the beginning and 66.6MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * BuchiAutomizer took 2922.74ms. Allocated memory is still 155.2MB. Free memory was 66.5MB in the beginning and 97.9MB in the end (delta: -31.4MB). 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 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 33 StatesRemovedByMinimization, 2 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, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 66 IncrementalHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 18 mSDtfsCounter, 66 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital100 mio100 ax100 hnf100 lsp97 ukn65 mio100 lsp100 div100 bol107 ite100 ukn100 eq170 hnf96 smp100 dnf234 smp57 tf100 neg100 sie109 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 193ms VariablesStem: 5 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 6 MotzkinApplications: 30 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.1s InitialAbstraction: Time to compute Ample Reduction [ms]: 149, Number of transitions in reduction automaton: 138, Number of states in reduction automaton: 66, Underlying: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function len_1 + -1 * i_6 and consists of 4 locations. One deterministic module has affine ranking function -1 * i_9 + len_3 and consists of 3 locations. One deterministic module has affine ranking function -1 * i_12 + len_5 and consists of 3 locations. - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-04-26 18:40:07,426 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...