./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loop-lit/cggmp2005b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/loop-lit/cggmp2005b.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 07:35:02,273 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 07:35:02,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-01-10 07:35:02,320 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 07:35:02,320 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 07:35:02,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 07:35:02,336 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 07:35:02,336 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 07:35:02,337 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 07:35:02,337 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 07:35:02,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 07:35:02,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 07:35:02,337 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 07:35:02,337 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Use old map elimination=false [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-01-10 07:35:02,338 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 07:35:02,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 07:35:02,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 07:35:02,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 07:35:02,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 07:35:02,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 07:35:02,340 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-01-10 07:35:02,340 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5a85ef4e6caed20a9aa6e00fcf3a476ebe3f071202fc083a4545018fb19b4c9c [2025-01-10 07:35:02,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 07:35:02,700 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 07:35:02,701 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 07:35:02,702 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 07:35:02,702 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 07:35:02,703 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/cggmp2005b.i [2025-01-10 07:35:04,109 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d58fb99d/379ac4e4ab5143bdb7df2a5c6dd49122/FLAG7a6dbd2a5 [2025-01-10 07:35:04,350 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 07:35:04,351 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loop-lit/cggmp2005b.i [2025-01-10 07:35:04,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d58fb99d/379ac4e4ab5143bdb7df2a5c6dd49122/FLAG7a6dbd2a5 [2025-01-10 07:35:04,402 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d58fb99d/379ac4e4ab5143bdb7df2a5c6dd49122 [2025-01-10 07:35:04,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 07:35:04,406 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 07:35:04,410 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:04,410 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 07:35:04,419 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 07:35:04,420 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54b17bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04, skipping insertion in model container [2025-01-10 07:35:04,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,439 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 07:35:04,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:04,646 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 07:35:04,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 07:35:04,684 INFO L204 MainTranslator]: Completed translation [2025-01-10 07:35:04,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04 WrapperNode [2025-01-10 07:35:04,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 07:35:04,690 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:04,690 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 07:35:04,690 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 07:35:04,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,735 INFO L138 Inliner]: procedures = 16, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2025-01-10 07:35:04,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 07:35:04,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 07:35:04,737 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 07:35:04,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 07:35:04,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,751 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,763 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-10 07:35:04,766 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,769 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,771 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,778 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,779 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,779 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 07:35:04,780 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 07:35:04,780 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 07:35:04,780 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 07:35:04,780 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (1/1) ... [2025-01-10 07:35:04,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:04,830 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:04,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2025-01-10 07:35:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 07:35:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 07:35:04,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 07:35:04,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 07:35:04,879 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 07:35:04,881 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 07:35:04,925 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-10 07:35:04,925 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 07:35:04,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 07:35:04,930 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 07:35:04,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:04 BoogieIcfgContainer [2025-01-10 07:35:04,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 07:35:04,931 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-01-10 07:35:04,931 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-01-10 07:35:04,935 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-01-10 07:35:04,935 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:04,936 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.01 07:35:04" (1/3) ... [2025-01-10 07:35:04,936 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599624e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:04, skipping insertion in model container [2025-01-10 07:35:04,936 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:04,936 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 07:35:04" (2/3) ... [2025-01-10 07:35:04,937 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@599624e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.01 07:35:04, skipping insertion in model container [2025-01-10 07:35:04,937 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-01-10 07:35:04,937 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:04" (3/3) ... [2025-01-10 07:35:04,937 INFO L363 chiAutomizerObserver]: Analyzing ICFG cggmp2005b.i [2025-01-10 07:35:04,967 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-01-10 07:35:04,967 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-01-10 07:35:04,967 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-01-10 07:35:04,967 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-01-10 07:35:04,967 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-01-10 07:35:04,967 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-01-10 07:35:04,967 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-01-10 07:35:04,967 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-01-10 07:35:04,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:04,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:35:04,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:04,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:04,982 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:04,982 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:35:04,982 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-01-10 07:35:04,982 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:04,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2025-01-10 07:35:04,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:04,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:04,983 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-01-10 07:35:04,984 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-01-10 07:35:04,988 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" [2025-01-10 07:35:04,988 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" [2025-01-10 07:35:04,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:04,992 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2025-01-10 07:35:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821172810] [2025-01-10 07:35:04,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:05,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:05,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,046 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:05,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:05,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:05,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,058 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:05,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,060 INFO L85 PathProgramCache]: Analyzing trace with hash 35947, now seen corresponding path program 1 times [2025-01-10 07:35:05,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:05,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456037946] [2025-01-10 07:35:05,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:05,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:05,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:05,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,067 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:05,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:05,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:05,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,071 INFO L85 PathProgramCache]: Analyzing trace with hash 28694889, now seen corresponding path program 1 times [2025-01-10 07:35:05,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:05,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873444181] [2025-01-10 07:35:05,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:05,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:35:05,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:05,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:05,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873444181] [2025-01-10 07:35:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873444181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:35:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:35:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 07:35:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586165629] [2025-01-10 07:35:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:35:05,181 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:05,181 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:05,181 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:05,182 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:05,182 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:05,182 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,182 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:05,182 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:05,182 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration1_Loop [2025-01-10 07:35:05,182 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:05,182 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:05,189 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,240 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:05,241 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:05,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2025-01-10 07:35:05,255 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:05,255 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:05,285 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2025-01-10 07:35:05,285 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=20} Honda state: {ULTIMATE.start_main_~j~0#1=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2025-01-10 07:35:05,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2025-01-10 07:35:05,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,294 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2025-01-10 07:35:05,296 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:05,296 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:05,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:05,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2025-01-10 07:35:05,329 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:05,329 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:05,365 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:05,369 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:05,369 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:05,370 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:05,370 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:05,370 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:05,370 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:05,370 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,370 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:05,370 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:05,370 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration1_Loop [2025-01-10 07:35:05,370 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:05,370 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:05,371 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,375 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,381 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,411 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:05,413 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:05,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,416 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2025-01-10 07:35:05,421 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-01-10 07:35:05,432 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:05,432 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:05,433 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:05,433 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:05,433 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:05,436 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:05,436 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:05,438 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2025-01-10 07:35:05,443 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2025-01-10 07:35:05,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2025-01-10 07:35:05,449 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-01-10 07:35:05,460 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:05,460 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:05,460 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:05,460 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:05,460 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:05,461 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:05,461 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:05,464 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:05,466 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:05,468 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:05,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,471 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2025-01-10 07:35:05,473 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:05,473 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:05,473 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:05,474 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 201 Supporting invariants [] [2025-01-10 07:35:05,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2025-01-10 07:35:05,486 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:05,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-01-10 07:35:05,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-01-10 07:35:05,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:05,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:05,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:05,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 07:35:05,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 07:35:05,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:05,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:05,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:05,576 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2025-01-10 07:35:05,578 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:05,599 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 21 states and 33 transitions. Complement of second has 5 states. [2025-01-10 07:35:05,601 INFO L141 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-01-10 07:35:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2025-01-10 07:35:05,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 3 letters. [2025-01-10 07:35:05,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:05,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 3 letters. [2025-01-10 07:35:05,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:05,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 2 letters. Loop has 6 letters. [2025-01-10 07:35:05,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:05,612 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 33 transitions. [2025-01-10 07:35:05,613 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:05,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 11 states and 18 transitions. [2025-01-10 07:35:05,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:35:05,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2025-01-10 07:35:05,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2025-01-10 07:35:05,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:05,616 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 18 transitions. [2025-01-10 07:35:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2025-01-10 07:35:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2025-01-10 07:35:05,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 15 transitions. [2025-01-10 07:35:05,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 15 transitions. [2025-01-10 07:35:05,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:05,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:35:05,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:35:05,633 INFO L87 Difference]: Start difference. First operand 9 states and 15 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:05,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:05,639 INFO L93 Difference]: Finished difference Result 10 states and 17 transitions. [2025-01-10 07:35:05,639 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 17 transitions. [2025-01-10 07:35:05,639 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:05,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 17 transitions. [2025-01-10 07:35:05,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:35:05,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:35:05,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 17 transitions. [2025-01-10 07:35:05,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:05,640 INFO L218 hiAutomatonCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-01-10 07:35:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 17 transitions. [2025-01-10 07:35:05,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2025-01-10 07:35:05,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:05,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 17 transitions. [2025-01-10 07:35:05,641 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-01-10 07:35:05,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:35:05,642 INFO L432 stractBuchiCegarLoop]: Abstraction has 10 states and 17 transitions. [2025-01-10 07:35:05,642 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-01-10 07:35:05,642 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 17 transitions. [2025-01-10 07:35:05,642 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:05,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:05,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:05,643 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2025-01-10 07:35:05,643 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:05,643 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-01-10 07:35:05,643 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-01-10 07:35:05,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,643 INFO L85 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2025-01-10 07:35:05,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:05,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819364186] [2025-01-10 07:35:05,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:05,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:35:05,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:35:05,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,650 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:05,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:35:05,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:35:05,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,655 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:05,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,655 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 1 times [2025-01-10 07:35:05,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:05,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087473495] [2025-01-10 07:35:05,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:05,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:05,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:05,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:05,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:05,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,659 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:05,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash 28694819, now seen corresponding path program 2 times [2025-01-10 07:35:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129244972] [2025-01-10 07:35:05,660 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:05,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5 statements into 2 equivalence classes. [2025-01-10 07:35:05,667 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:05,667 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:05,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:05,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:35:05,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:05,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:05,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:05,672 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:05,790 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:05,791 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:05,791 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:05,791 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:05,791 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:05,791 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,791 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:05,791 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:05,791 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration2_Lasso [2025-01-10 07:35:05,791 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:05,791 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:05,793 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,801 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,803 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,814 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,821 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:05,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2025-01-10 07:35:05,940 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:05,941 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:05,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2025-01-10 07:35:05,945 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-01-10 07:35:05,956 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:05,956 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:05,956 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:05,956 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:05,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2025-01-10 07:35:05,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2025-01-10 07:35:05,965 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:05,974 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2025-01-10 07:35:05,974 INFO L444 ModelExtractionUtils]: 1 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2025-01-10 07:35:05,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:05,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:05,976 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:05,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2025-01-10 07:35:05,978 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:05,990 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2025-01-10 07:35:05,990 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:05,991 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1, ULTIMATE.start_main_~j~0#1) = 39*ULTIMATE.start_main_~i~0#1 - 2*ULTIMATE.start_main_~j~0#1 Supporting invariants [1*ULTIMATE.start_main_~i~0#1 - 1 >= 0] [2025-01-10 07:35:05,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2025-01-10 07:35:06,001 INFO L156 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2025-01-10 07:35:06,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-01-10 07:35:06,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-01-10 07:35:06,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,078 WARN L254 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:06,079 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2025-01-10 07:35:06,079 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 17 transitions. cyclomatic complexity: 10 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,134 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 17 transitions. cyclomatic complexity: 10. Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 20 states and 34 transitions. Complement of second has 7 states. [2025-01-10 07:35:06,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2025-01-10 07:35:06,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2025-01-10 07:35:06,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 1 letters. [2025-01-10 07:35:06,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 5 letters. Loop has 1 letters. [2025-01-10 07:35:06,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 4 letters. Loop has 2 letters. [2025-01-10 07:35:06,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 34 transitions. [2025-01-10 07:35:06,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:35:06,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 28 transitions. [2025-01-10 07:35:06,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2025-01-10 07:35:06,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2025-01-10 07:35:06,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 28 transitions. [2025-01-10 07:35:06,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:06,138 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 28 transitions. [2025-01-10 07:35:06,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 28 transitions. [2025-01-10 07:35:06,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2025-01-10 07:35:06,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2025-01-10 07:35:06,138 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 21 transitions. [2025-01-10 07:35:06,139 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 21 transitions. [2025-01-10 07:35:06,139 INFO L338 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2025-01-10 07:35:06,139 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 21 transitions. [2025-01-10 07:35:06,139 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:06,139 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:06,139 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:06,139 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2025-01-10 07:35:06,139 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:06,139 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" [2025-01-10 07:35:06,139 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= 3;main_~k~0#1 := 1 + main_~k~0#1;" [2025-01-10 07:35:06,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash 28694821, now seen corresponding path program 1 times [2025-01-10 07:35:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125916271] [2025-01-10 07:35:06,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:06,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:35:06,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:06,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:06,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125916271] [2025-01-10 07:35:06,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125916271] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:35:06,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271460885] [2025-01-10 07:35:06,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:06,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:35:06,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,267 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 07:35:06,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:35:06,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:06,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:06,323 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:35:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271460885] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:35:06,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:35:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 07:35:06,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993105384] [2025-01-10 07:35:06,349 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:35:06,349 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:35:06,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,349 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 1 times [2025-01-10 07:35:06,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058388043] [2025-01-10 07:35:06,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,352 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:06,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:06,362 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:06,363 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:06,363 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:06,363 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:06,363 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:06,363 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,363 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:06,363 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:06,363 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Loop [2025-01-10 07:35:06,363 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:06,363 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:06,363 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:06,377 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:06,377 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:06,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,381 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2025-01-10 07:35:06,384 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:06,384 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:06,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2025-01-10 07:35:06,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,407 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2025-01-10 07:35:06,409 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:06,409 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:06,432 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:06,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:06,436 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:06,436 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:06,436 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:06,436 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:06,436 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:06,436 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,436 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:06,436 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:06,436 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration3_Loop [2025-01-10 07:35:06,436 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:06,436 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:06,437 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:06,452 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:06,452 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,455 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2025-01-10 07:35:06,458 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-01-10 07:35:06,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:06,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:06,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:06,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:06,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:06,469 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:06,469 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:06,473 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:06,475 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:06,476 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:06,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,481 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2025-01-10 07:35:06,482 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:06,482 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:06,482 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:06,482 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2025-01-10 07:35:06,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:06,492 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:06,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 07:35:06,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 07:35:06,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,516 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:06,517 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-01-10 07:35:06,517 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 21 transitions. cyclomatic complexity: 13 Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,523 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 21 transitions. cyclomatic complexity: 13. Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 25 states and 43 transitions. Complement of second has 5 states. [2025-01-10 07:35:06,524 INFO L141 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-01-10 07:35:06,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2025-01-10 07:35:06,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 1 letters. [2025-01-10 07:35:06,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2025-01-10 07:35:06,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 5 letters. Loop has 2 letters. [2025-01-10 07:35:06,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:06,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 43 transitions. [2025-01-10 07:35:06,526 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 3 [2025-01-10 07:35:06,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 16 states and 29 transitions. [2025-01-10 07:35:06,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2025-01-10 07:35:06,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2025-01-10 07:35:06,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 29 transitions. [2025-01-10 07:35:06,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:06,526 INFO L218 hiAutomatonCegarLoop]: Abstraction has 16 states and 29 transitions. [2025-01-10 07:35:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 29 transitions. [2025-01-10 07:35:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 10. [2025-01-10 07:35:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2025-01-10 07:35:06,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 10 states and 16 transitions. [2025-01-10 07:35:06,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:06,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 07:35:06,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-10 07:35:06,528 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 10 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:06,549 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2025-01-10 07:35:06,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 18 transitions. [2025-01-10 07:35:06,550 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:06,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 18 transitions. [2025-01-10 07:35:06,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2025-01-10 07:35:06,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2025-01-10 07:35:06,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 18 transitions. [2025-01-10 07:35:06,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:06,551 INFO L218 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-01-10 07:35:06,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 18 transitions. [2025-01-10 07:35:06,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2025-01-10 07:35:06,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2025-01-10 07:35:06,552 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-01-10 07:35:06,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 07:35:06,552 INFO L432 stractBuchiCegarLoop]: Abstraction has 12 states and 18 transitions. [2025-01-10 07:35:06,552 INFO L338 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2025-01-10 07:35:06,552 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 18 transitions. [2025-01-10 07:35:06,553 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2025-01-10 07:35:06,553 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:06,553 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:06,553 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [4, 2, 1, 1, 1, 1] [2025-01-10 07:35:06,553 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:06,553 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-01-10 07:35:06,553 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" [2025-01-10 07:35:06,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1331038353, now seen corresponding path program 1 times [2025-01-10 07:35:06,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234632057] [2025-01-10 07:35:06,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 07:35:06,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:06,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:06,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,571 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 07:35:06,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:06,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234632057] [2025-01-10 07:35:06,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234632057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 07:35:06,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 07:35:06,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 07:35:06,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407365057] [2025-01-10 07:35:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 07:35:06,572 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:35:06,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,572 INFO L85 PathProgramCache]: Analyzing trace with hash 41, now seen corresponding path program 2 times [2025-01-10 07:35:06,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478610960] [2025-01-10 07:35:06,572 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:06,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:35:06,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,575 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:06,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,576 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:06,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:06,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 07:35:06,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 07:35:06,589 INFO L87 Difference]: Start difference. First operand 12 states and 18 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:06,592 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2025-01-10 07:35:06,592 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. [2025-01-10 07:35:06,593 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:06,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 14 transitions. [2025-01-10 07:35:06,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2025-01-10 07:35:06,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2025-01-10 07:35:06,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2025-01-10 07:35:06,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2025-01-10 07:35:06,593 INFO L218 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-01-10 07:35:06,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2025-01-10 07:35:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-01-10 07:35:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2025-01-10 07:35:06,594 INFO L240 hiAutomatonCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-01-10 07:35:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 07:35:06,595 INFO L432 stractBuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2025-01-10 07:35:06,595 INFO L338 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2025-01-10 07:35:06,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2025-01-10 07:35:06,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2025-01-10 07:35:06,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-01-10 07:35:06,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-01-10 07:35:06,595 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1] [2025-01-10 07:35:06,596 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2025-01-10 07:35:06,596 INFO L752 eck$LassoCheckResult]: Stem: "assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);" "assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~i~0#1, main_~j~0#1, main_~k~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;main_~i~0#1 := 0;main_~k~0#1 := 9;main_~j~0#1 := -100;" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume main_~j~0#1 < 20;main_~j~0#1 := main_~i~0#1 + main_~j~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" "assume !(main_~k~0#1 <= 3);" "assume main_~i~0#1 <= 100;main_~i~0#1 := 1 + main_~i~0#1;" "assume !(main_~j~0#1 < 20);main_~k~0#1 := 4;" [2025-01-10 07:35:06,596 INFO L754 eck$LassoCheckResult]: Loop: "assume main_~k~0#1 <= 3;main_~k~0#1 := 1 + main_~k~0#1;" [2025-01-10 07:35:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1331038355, now seen corresponding path program 2 times [2025-01-10 07:35:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757458408] [2025-01-10 07:35:06,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 07:35:06,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:06,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:06,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:35:06,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 07:35:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757458408] [2025-01-10 07:35:06,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757458408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 07:35:06,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637036280] [2025-01-10 07:35:06,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:06,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 07:35:06,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,686 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-01-10 07:35:06,714 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 2 equivalence classes. [2025-01-10 07:35:06,721 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:06,721 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-10 07:35:06,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:06,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-10 07:35:06,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:35:06,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 07:35:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 07:35:06,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637036280] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 07:35:06,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 07:35:06,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-01-10 07:35:06,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865930358] [2025-01-10 07:35:06,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 07:35:06,865 INFO L757 eck$LassoCheckResult]: stem already infeasible [2025-01-10 07:35:06,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:06,866 INFO L85 PathProgramCache]: Analyzing trace with hash 47, now seen corresponding path program 2 times [2025-01-10 07:35:06,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 07:35:06,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945845702] [2025-01-10 07:35:06,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 07:35:06,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 07:35:06,870 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 07:35:06,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,871 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-10 07:35:06,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:06,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:06,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:06,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-10 07:35:06,873 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-10 07:35:06,882 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:06,882 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:06,882 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:06,882 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:06,882 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2025-01-10 07:35:06,882 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,882 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:06,882 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:06,882 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration5_Loop [2025-01-10 07:35:06,882 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:06,882 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:06,883 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:06,895 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:06,895 INFO L365 LassoAnalysis]: Checking for nontermination... [2025-01-10 07:35:06,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2025-01-10 07:35:06,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2025-01-10 07:35:06,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:06,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:06,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,918 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2025-01-10 07:35:06,921 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2025-01-10 07:35:06,921 INFO L160 nArgumentSynthesizer]: Using integer mode. [2025-01-10 07:35:06,943 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2025-01-10 07:35:06,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:06,947 INFO L204 LassoAnalysis]: Preferences: [2025-01-10 07:35:06,948 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2025-01-10 07:35:06,948 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2025-01-10 07:35:06,948 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2025-01-10 07:35:06,948 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2025-01-10 07:35:06,948 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,948 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2025-01-10 07:35:06,948 INFO L131 ssoRankerPreferences]: Path of dumped script: [2025-01-10 07:35:06,948 INFO L132 ssoRankerPreferences]: Filename of dumped script: cggmp2005b.i_Iteration5_Loop [2025-01-10 07:35:06,948 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2025-01-10 07:35:06,948 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2025-01-10 07:35:06,948 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2025-01-10 07:35:06,962 INFO L259 LassoAnalysis]: Preprocessing complete. [2025-01-10 07:35:06,962 INFO L451 LassoAnalysis]: Using template 'affine'. [2025-01-10 07:35:06,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,964 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,968 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-01-10 07:35:06,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2025-01-10 07:35:06,978 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2025-01-10 07:35:06,978 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2025-01-10 07:35:06,978 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2025-01-10 07:35:06,978 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2025-01-10 07:35:06,978 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2025-01-10 07:35:06,978 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2025-01-10 07:35:06,978 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2025-01-10 07:35:06,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2025-01-10 07:35:06,982 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2025-01-10 07:35:06,982 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2025-01-10 07:35:06,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-01-10 07:35:06,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 07:35:06,984 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2025-01-10 07:35:06,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2025-01-10 07:35:06,986 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2025-01-10 07:35:06,986 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2025-01-10 07:35:06,986 INFO L474 LassoAnalysis]: Proved termination. [2025-01-10 07:35:06,986 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0#1) = -2*ULTIMATE.start_main_~k~0#1 + 7 Supporting invariants [] [2025-01-10 07:35:06,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:06,993 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2025-01-10 07:35:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:07,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:07,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:07,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:07,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:07,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:07,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:07,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:07,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,062 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:07,062 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-01-10 07:35:07,063 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,069 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 21 transitions. Complement of second has 5 states. [2025-01-10 07:35:07,069 INFO L141 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-01-10 07:35:07,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:35:07,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2025-01-10 07:35:07,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:07,070 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:35:07,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:07,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:07,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:07,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,100 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:07,101 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:07,101 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,105 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 16 states and 21 transitions. Complement of second has 5 states. [2025-01-10 07:35:07,106 INFO L141 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-01-10 07:35:07,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2025-01-10 07:35:07,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 1 letters. [2025-01-10 07:35:07,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:07,106 INFO L689 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2025-01-10 07:35:07,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 07:35:07,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 07:35:07,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 07:35:07,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-01-10 07:35:07,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-01-10 07:35:07,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 07:35:07,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 07:35:07,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 07:35:07,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 07:35:07,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 07:35:07,133 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2025-01-10 07:35:07,133 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6 Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,138 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 14 transitions. cyclomatic complexity: 6. Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 17 transitions. Complement of second has 4 states. [2025-01-10 07:35:07,139 INFO L141 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-01-10 07:35:07,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 11 transitions. [2025-01-10 07:35:07,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 1 letters. [2025-01-10 07:35:07,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:07,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 11 letters. Loop has 1 letters. [2025-01-10 07:35:07,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:07,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 11 transitions. Stem has 10 letters. Loop has 2 letters. [2025-01-10 07:35:07,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2025-01-10 07:35:07,140 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2025-01-10 07:35:07,140 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:35:07,140 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 0 states and 0 transitions. [2025-01-10 07:35:07,140 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:35:07,140 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:35:07,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:35:07,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:07,140 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:07,140 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:07,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 07:35:07,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-10 07:35:07,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2025-01-10 07:35:07,141 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 16 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 07:35:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-10 07:35:07,141 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:35:07,141 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2025-01-10 07:35:07,141 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2025-01-10 07:35:07,141 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-01-10 07:35:07,141 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-10 07:35:07,141 INFO L432 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L338 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2025-01-10 07:35:07,141 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2025-01-10 07:35:07,141 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2025-01-10 07:35:07,141 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2025-01-10 07:35:07,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.01 07:35:07 BoogieIcfgContainer [2025-01-10 07:35:07,147 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-01-10 07:35:07,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 07:35:07,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 07:35:07,148 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 07:35:07,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 07:35:04" (3/4) ... [2025-01-10 07:35:07,150 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-10 07:35:07,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 07:35:07,151 INFO L158 Benchmark]: Toolchain (without parser) took 2745.23ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 121.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.18ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.14ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: Boogie Preprocessor took 42.89ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: RCFGBuilder took 150.99ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 100.5MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 07:35:07,151 INFO L158 Benchmark]: BuchiAutomizer took 2216.01ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 121.2MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:07,152 INFO L158 Benchmark]: Witness Printer took 2.48ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 121.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 07:35:07,152 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 117.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.18ms. Allocated memory is still 167.8MB. Free memory was 123.3MB in the beginning and 112.6MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.14ms. Allocated memory is still 167.8MB. Free memory was 112.6MB in the beginning and 111.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.89ms. Allocated memory is still 167.8MB. Free memory was 111.3MB in the beginning and 110.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 150.99ms. Allocated memory is still 167.8MB. Free memory was 110.1MB in the beginning and 100.5MB in the end (delta: 9.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 2216.01ms. Allocated memory is still 167.8MB. Free memory was 100.5MB in the beginning and 121.2MB in the end (delta: -20.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.48ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 121.2MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function (((long long) -2 * i) + 201) and consists of 3 locations. One deterministic module has affine ranking function (((long long) -2 * j) + ((long long) 39 * i)) and consists of 5 locations. One deterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. One nondeterministic module has affine ranking function (7 + ((long long) -2 * k)) and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 16 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.1s and 6 iterations. TraceHistogramMax:4. Analysis of lassos took 1.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 6. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 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, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 41 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 55 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 59 mSDtfsCounter, 55 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT1 SILN1 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax100 hnf100 lsp79 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq164 hnf93 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 49ms VariablesStem: 2 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2025-01-10 07:35:07,165 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-01-10 07:35:07,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 07:35:07,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE