./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-12 00:14:41,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-12 00:14:41,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-12 00:14:41,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-12 00:14:41,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-12 00:14:41,774 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-12 00:14:41,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-12 00:14:41,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-12 00:14:41,775 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-12 00:14:41,775 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-12 00:14:41,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-12 00:14:41,776 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-12 00:14:41,776 INFO L153 SettingsManager]: * Use SBE=true [2024-10-12 00:14:41,776 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-12 00:14:41,776 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-12 00:14:41,776 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-12 00:14:41,777 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-12 00:14:41,777 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-12 00:14:41,779 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-12 00:14:41,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-12 00:14:41,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-12 00:14:41,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-12 00:14:41,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-12 00:14:41,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-12 00:14:41,783 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-12 00:14:41,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-12 00:14:41,784 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-12 00:14:41,784 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-12 00:14:41,784 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-12 00:14:41,784 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-12 00:14:41,784 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-12 00:14:41,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-12 00:14:41,785 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-12 00:14:41,785 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-12 00:14:41,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-12 00:14:41,786 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-12 00:14:41,787 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26441cee42562e2fd703b97b1a86d2baa847af9810285d31267fccda11d2ea67 [2024-10-12 00:14:42,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-12 00:14:42,031 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-12 00:14:42,035 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-12 00:14:42,036 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-12 00:14:42,036 INFO L274 PluginConnector]: CDTParser initialized [2024-10-12 00:14:42,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-10-12 00:14:43,453 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-12 00:14:43,628 INFO L384 CDTParser]: Found 1 translation units. [2024-10-12 00:14:43,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/NO_04.c [2024-10-12 00:14:43,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e247bff42/e1da50305e9d41898beef8e75fa6e42c/FLAG58462a36d [2024-10-12 00:14:44,027 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e247bff42/e1da50305e9d41898beef8e75fa6e42c [2024-10-12 00:14:44,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-12 00:14:44,031 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-12 00:14:44,032 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-12 00:14:44,032 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-12 00:14:44,036 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-12 00:14:44,036 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,037 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f46f3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44, skipping insertion in model container [2024-10-12 00:14:44,037 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,051 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-12 00:14:44,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:14:44,208 INFO L200 MainTranslator]: Completed pre-run [2024-10-12 00:14:44,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-12 00:14:44,232 INFO L204 MainTranslator]: Completed translation [2024-10-12 00:14:44,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44 WrapperNode [2024-10-12 00:14:44,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-12 00:14:44,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-12 00:14:44,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-12 00:14:44,234 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-12 00:14:44,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,255 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 43 [2024-10-12 00:14:44,256 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-12 00:14:44,257 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-12 00:14:44,257 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-12 00:14:44,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-12 00:14:44,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,266 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,271 INFO L175 MemorySlicer]: No memory access in input program. [2024-10-12 00:14:44,271 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,271 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,275 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,285 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-12 00:14:44,286 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-12 00:14:44,286 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-12 00:14:44,286 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-12 00:14:44,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (1/1) ... [2024-10-12 00:14:44,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:44,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:44,312 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:44,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-10-12 00:14:44,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-12 00:14:44,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-12 00:14:44,423 INFO L238 CfgBuilder]: Building ICFG [2024-10-12 00:14:44,425 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-12 00:14:44,516 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2024-10-12 00:14:44,516 INFO L287 CfgBuilder]: Performing block encoding [2024-10-12 00:14:44,527 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-12 00:14:44,528 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-12 00:14:44,528 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:44 BoogieIcfgContainer [2024-10-12 00:14:44,528 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-12 00:14:44,529 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-12 00:14:44,529 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-12 00:14:44,532 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-12 00:14:44,533 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:44,533 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 12.10 12:14:44" (1/3) ... [2024-10-12 00:14:44,534 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ea39e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:14:44, skipping insertion in model container [2024-10-12 00:14:44,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:44,534 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.10 12:14:44" (2/3) ... [2024-10-12 00:14:44,534 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11ea39e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 12.10 12:14:44, skipping insertion in model container [2024-10-12 00:14:44,534 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-12 00:14:44,534 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:44" (3/3) ... [2024-10-12 00:14:44,535 INFO L332 chiAutomizerObserver]: Analyzing ICFG NO_04.c [2024-10-12 00:14:44,578 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-12 00:14:44,579 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-12 00:14:44,579 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-12 00:14:44,579 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-12 00:14:44,579 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-12 00:14:44,579 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-12 00:14:44,579 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-12 00:14:44,579 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-12 00:14:44,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2024-10-12 00:14:44,595 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:14:44,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:44,595 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:44,599 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:44,599 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:14:44,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-12 00:14:44,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) [2024-10-12 00:14:44,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-10-12 00:14:44,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:44,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:44,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:44,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-10-12 00:14:44,606 INFO L745 eck$LassoCheckResult]: Stem: 14#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 5#L-1true 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, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0; 6#L15-2true [2024-10-12 00:14:44,606 INFO L747 eck$LassoCheckResult]: Loop: 6#L15-2true assume !!(main_~i~0#1 < 100);main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0; 9#L18-2true assume !(main_~j~0#1 < main_~a~0#1); 12#L18-3true main_~i~0#1 := 1 + main_~i~0#1; 6#L15-2true [2024-10-12 00:14:44,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,611 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-12 00:14:44,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693258468] [2024-10-12 00:14:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,677 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,696 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:44,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,699 INFO L85 PathProgramCache]: Analyzing trace with hash 40983, now seen corresponding path program 1 times [2024-10-12 00:14:44,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350224792] [2024-10-12 00:14:44,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:44,716 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 28699925, now seen corresponding path program 1 times [2024-10-12 00:14:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:44,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496965178] [2024-10-12 00:14:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:44,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:44,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:44,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:44,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496965178] [2024-10-12 00:14:44,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496965178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:44,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:44,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:14:44,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963206819] [2024-10-12 00:14:44,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:44,895 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:44,896 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:44,896 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:44,896 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:44,897 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-10-12 00:14:44,897 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:44,897 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:44,897 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:44,897 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2024-10-12 00:14:44,897 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:44,897 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:44,910 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:44,919 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:44,923 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:44,925 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:44,928 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:44,985 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:44,986 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-10-12 00:14:44,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:44,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:44,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:44,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-10-12 00:14:44,992 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:44,992 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,017 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:45,017 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:45,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:45,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-10-12 00:14:45,036 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:45,036 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,062 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:45,063 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:45,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,076 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-10-12 00:14:45,078 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:45,078 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,090 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:45,090 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~a~0#1=0} Honda state: {ULTIMATE.start_main_~a~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:45,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2024-10-12 00:14:45,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,107 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,108 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-10-12 00:14:45,109 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:45,109 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,121 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-10-12 00:14:45,122 INFO L401 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0#1=0} Honda state: {ULTIMATE.start_main_~j~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2024-10-12 00:14:45,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-10-12 00:14:45,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,135 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-10-12 00:14:45,138 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-10-12 00:14:45,138 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-12 00:14:45,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,162 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-10-12 00:14:45,164 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-10-12 00:14:45,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-10-12 00:14:45,192 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-10-12 00:14:45,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-10-12 00:14:45,197 INFO L204 LassoAnalysis]: Preferences: [2024-10-12 00:14:45,197 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-12 00:14:45,197 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-12 00:14:45,197 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-12 00:14:45,197 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-12 00:14:45,197 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,198 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-12 00:14:45,198 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-12 00:14:45,198 INFO L132 ssoRankerPreferences]: Filename of dumped script: NO_04.c_Iteration1_Loop [2024-10-12 00:14:45,198 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-12 00:14:45,198 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-12 00:14:45,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,202 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,213 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,217 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-12 00:14:45,261 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-12 00:14:45,264 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-12 00:14:45,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,268 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-10-12 00:14:45,270 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 [2024-10-12 00:14:45,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:45,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:45,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:45,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:45,285 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:45,285 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:45,295 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:45,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2024-10-12 00:14:45,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-10-12 00:14:45,310 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 [2024-10-12 00:14:45,320 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:45,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:45,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:45,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:45,323 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-12 00:14:45,323 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-12 00:14:45,326 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-12 00:14:45,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-10-12 00:14:45,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,340 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2024-10-12 00:14:45,342 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 [2024-10-12 00:14:45,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-12 00:14:45,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-12 00:14:45,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-12 00:14:45,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-12 00:14:45,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-12 00:14:45,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-12 00:14:45,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-12 00:14:45,356 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-12 00:14:45,358 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-10-12 00:14:45,358 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-12 00:14:45,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-12 00:14:45,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-12 00:14:45,378 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-10-12 00:14:45,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2024-10-12 00:14:45,380 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-12 00:14:45,381 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-12 00:14:45,381 INFO L474 LassoAnalysis]: Proved termination. [2024-10-12 00:14:45,381 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2024-10-12 00:14:45,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-12 00:14:45,396 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-10-12 00:14:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:45,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-12 00:14:45,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-12 00:14:45,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:45,507 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-12 00:14:45,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-12 00:14:45,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:45,601 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-12 00:14:45,603 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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) 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) [2024-10-12 00:14:45,670 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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). 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 57 states and 97 transitions. Complement of second has 10 states. [2024-10-12 00:14:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2024-10-12 00:14:45,677 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) [2024-10-12 00:14:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2024-10-12 00:14:45,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 3 letters. [2024-10-12 00:14:45,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:45,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 5 letters. Loop has 3 letters. [2024-10-12 00:14:45,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:45,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 60 transitions. Stem has 2 letters. Loop has 6 letters. [2024-10-12 00:14:45,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-12 00:14:45,681 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 97 transitions. [2024-10-12 00:14:45,683 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:14:45,686 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 38 states and 55 transitions. [2024-10-12 00:14:45,687 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:14:45,687 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2024-10-12 00:14:45,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 55 transitions. [2024-10-12 00:14:45,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-12 00:14:45,687 INFO L218 hiAutomatonCegarLoop]: Abstraction has 38 states and 55 transitions. [2024-10-12 00:14:45,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 55 transitions. [2024-10-12 00:14:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 25. [2024-10-12 00:14:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 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) [2024-10-12 00:14:45,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 36 transitions. [2024-10-12 00:14:45,707 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 36 transitions. [2024-10-12 00:14:45,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:45,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:45,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:45,710 INFO L87 Difference]: Start difference. First operand 25 states and 36 transitions. 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) [2024-10-12 00:14:45,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:45,734 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2024-10-12 00:14:45,735 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. [2024-10-12 00:14:45,735 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-10-12 00:14:45,736 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 19 states and 26 transitions. [2024-10-12 00:14:45,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2024-10-12 00:14:45,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2024-10-12 00:14:45,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 26 transitions. [2024-10-12 00:14:45,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:45,736 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 26 transitions. [2024-10-12 00:14:45,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 26 transitions. [2024-10-12 00:14:45,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 12. [2024-10-12 00:14:45,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 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) [2024-10-12 00:14:45,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2024-10-12 00:14:45,738 INFO L240 hiAutomatonCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:14:45,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:45,739 INFO L425 stractBuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2024-10-12 00:14:45,739 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-12 00:14:45,739 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2024-10-12 00:14:45,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2024-10-12 00:14:45,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:45,739 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:45,740 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:45,740 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:45,740 INFO L745 eck$LassoCheckResult]: Stem: 192#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 193#L-1 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, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0; 189#L15-2 [2024-10-12 00:14:45,740 INFO L747 eck$LassoCheckResult]: Loop: 189#L15-2 assume !!(main_~i~0#1 < 100);main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0; 186#L18-2 assume !!(main_~j~0#1 < main_~a~0#1);main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1); 187#L20-2 assume !(main_~k~0#1 >= 0); 190#L20-3 main_~j~0#1 := 1 + main_~j~0#1; 191#L18-2 assume !(main_~j~0#1 < main_~a~0#1); 188#L18-3 main_~i~0#1 := 1 + main_~i~0#1; 189#L15-2 [2024-10-12 00:14:45,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,741 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-12 00:14:45,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434547158] [2024-10-12 00:14:45,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,744 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,746 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:45,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1221756439, now seen corresponding path program 1 times [2024-10-12 00:14:45,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324854844] [2024-10-12 00:14:45,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:45,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:45,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324854844] [2024-10-12 00:14:45,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324854844] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:45,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:45,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-12 00:14:45,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066303772] [2024-10-12 00:14:45,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:45,783 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:45,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:45,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:45,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:45,784 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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) [2024-10-12 00:14:45,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:45,804 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2024-10-12 00:14:45,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2024-10-12 00:14:45,804 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-10-12 00:14:45,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2024-10-12 00:14:45,805 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2024-10-12 00:14:45,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2024-10-12 00:14:45,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2024-10-12 00:14:45,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:45,805 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17 states and 23 transitions. [2024-10-12 00:14:45,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2024-10-12 00:14:45,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2024-10-12 00:14:45,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.3076923076923077) 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) [2024-10-12 00:14:45,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2024-10-12 00:14:45,807 INFO L240 hiAutomatonCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:14:45,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:45,809 INFO L425 stractBuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2024-10-12 00:14:45,809 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-12 00:14:45,809 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2024-10-12 00:14:45,810 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2024-10-12 00:14:45,810 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:45,810 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:45,810 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:45,810 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:45,810 INFO L745 eck$LassoCheckResult]: Stem: 230#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 231#L-1 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, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0; 229#L15-2 [2024-10-12 00:14:45,811 INFO L747 eck$LassoCheckResult]: Loop: 229#L15-2 assume !!(main_~i~0#1 < 100);main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0; 222#L18-2 assume !!(main_~j~0#1 < main_~a~0#1);main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1); 223#L20-2 assume !!(main_~k~0#1 >= 0);main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0; 224#L23-2 assume !(main_~l~0#1 < main_~b~0#1); 225#L23-3 main_~k~0#1 := main_~k~0#1 - 1; 232#L20-2 assume !(main_~k~0#1 >= 0); 226#L20-3 main_~j~0#1 := 1 + main_~j~0#1; 227#L18-2 assume !(main_~j~0#1 < main_~a~0#1); 228#L18-3 main_~i~0#1 := 1 + main_~i~0#1; 229#L15-2 [2024-10-12 00:14:45,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,811 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-12 00:14:45,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105014874] [2024-10-12 00:14:45,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,815 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:45,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1352067341, now seen corresponding path program 1 times [2024-10-12 00:14:45,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920499627] [2024-10-12 00:14:45,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:45,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:45,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:45,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920499627] [2024-10-12 00:14:45,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920499627] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:45,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:45,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-12 00:14:45,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116111852] [2024-10-12 00:14:45,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:45,857 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:45,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:45,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-12 00:14:45,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-12 00:14:45,858 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. cyclomatic complexity: 5 Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 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) [2024-10-12 00:14:45,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:45,879 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2024-10-12 00:14:45,880 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2024-10-12 00:14:45,880 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:45,880 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 18 transitions. [2024-10-12 00:14:45,880 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2024-10-12 00:14:45,881 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2024-10-12 00:14:45,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 18 transitions. [2024-10-12 00:14:45,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:45,881 INFO L218 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-12 00:14:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 18 transitions. [2024-10-12 00:14:45,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2024-10-12 00:14:45,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 13 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) [2024-10-12 00:14:45,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2024-10-12 00:14:45,882 INFO L240 hiAutomatonCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-12 00:14:45,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-12 00:14:45,883 INFO L425 stractBuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2024-10-12 00:14:45,883 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-12 00:14:45,883 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2024-10-12 00:14:45,884 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-10-12 00:14:45,884 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:45,884 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:45,884 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-12 00:14:45,884 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-12 00:14:45,884 INFO L745 eck$LassoCheckResult]: Stem: 266#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 267#L-1 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, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0; 264#L15-2 [2024-10-12 00:14:45,884 INFO L747 eck$LassoCheckResult]: Loop: 264#L15-2 assume !!(main_~i~0#1 < 100);main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0; 258#L18-2 assume !!(main_~j~0#1 < main_~a~0#1);main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1); 259#L20-2 assume !!(main_~k~0#1 >= 0);main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0; 260#L23-2 assume !!(main_~l~0#1 < main_~b~0#1);main_~m~0#1 := 1000 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1 + main_~l~0#1); 256#L25-2 assume !(main_~m~0#1 >= 0); 257#L25-3 main_~l~0#1 := 1 + main_~l~0#1; 265#L23-2 assume !(main_~l~0#1 < main_~b~0#1); 268#L23-3 main_~k~0#1 := main_~k~0#1 - 1; 269#L20-2 assume !(main_~k~0#1 >= 0); 261#L20-3 main_~j~0#1 := 1 + main_~j~0#1; 262#L18-2 assume !(main_~j~0#1 < main_~a~0#1); 263#L18-3 main_~i~0#1 := 1 + main_~i~0#1; 264#L15-2 [2024-10-12 00:14:45,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,885 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-12 00:14:45,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606118632] [2024-10-12 00:14:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,888 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,889 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:45,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1603093127, now seen corresponding path program 1 times [2024-10-12 00:14:45,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283056766] [2024-10-12 00:14:45,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-12 00:14:45,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-12 00:14:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-12 00:14:45,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283056766] [2024-10-12 00:14:45,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283056766] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-12 00:14:45,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-12 00:14:45,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-12 00:14:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719181516] [2024-10-12 00:14:45,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-12 00:14:45,948 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-12 00:14:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-12 00:14:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-12 00:14:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-12 00:14:45,948 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 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) [2024-10-12 00:14:45,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-12 00:14:45,974 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2024-10-12 00:14:45,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 7 transitions. [2024-10-12 00:14:45,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-12 00:14:45,974 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 7 states and 7 transitions. [2024-10-12 00:14:45,974 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-12 00:14:45,975 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-12 00:14:45,975 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 7 transitions. [2024-10-12 00:14:45,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-12 00:14:45,975 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-12 00:14:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 7 transitions. [2024-10-12 00:14:45,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-12 00:14:45,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.0) internal successors, (7), 6 states have internal predecessors, (7), 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) [2024-10-12 00:14:45,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2024-10-12 00:14:45,976 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-12 00:14:45,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-12 00:14:45,977 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 7 transitions. [2024-10-12 00:14:45,977 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-12 00:14:45,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 7 transitions. [2024-10-12 00:14:45,977 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2024-10-12 00:14:45,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-12 00:14:45,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-12 00:14:45,977 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2024-10-12 00:14:45,977 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1] [2024-10-12 00:14:45,977 INFO L745 eck$LassoCheckResult]: Stem: 293#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 294#L-1 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, main_~l~0#1, main_~m~0#1, main_~a~0#1, main_~b~0#1;havoc main_~i~0#1;havoc main_~j~0#1;havoc main_~k~0#1;havoc main_~l~0#1;havoc main_~m~0#1;havoc main_~a~0#1;havoc main_~b~0#1;main_~i~0#1 := 0; 295#L15-2 assume !!(main_~i~0#1 < 100);main_~a~0#1 := 2 + main_~i~0#1;main_~j~0#1 := 0; 290#L18-2 assume !!(main_~j~0#1 < main_~a~0#1);main_~k~0#1 := 3 + (main_~i~0#1 + main_~j~0#1); 291#L20-2 assume !!(main_~k~0#1 >= 0);main_~b~0#1 := 4 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1);main_~l~0#1 := 0; 292#L23-2 assume !!(main_~l~0#1 < main_~b~0#1);main_~m~0#1 := 1000 + (main_~i~0#1 + main_~j~0#1 + main_~k~0#1 + main_~l~0#1); 289#L25-2 [2024-10-12 00:14:45,978 INFO L747 eck$LassoCheckResult]: Loop: 289#L25-2 assume !!(main_~m~0#1 >= 0);main_~m~0#1 := main_~m~0#1; 289#L25-2 [2024-10-12 00:14:45,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 889698581, now seen corresponding path program 1 times [2024-10-12 00:14:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255742688] [2024-10-12 00:14:45,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,984 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:45,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,988 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:45,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,988 INFO L85 PathProgramCache]: Analyzing trace with hash 78, now seen corresponding path program 1 times [2024-10-12 00:14:45,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206427477] [2024-10-12 00:14:45,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,991 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,993 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:45,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-12 00:14:45,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1810852282, now seen corresponding path program 1 times [2024-10-12 00:14:45,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-12 00:14:45,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005231083] [2024-10-12 00:14:45,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-12 00:14:45,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-12 00:14:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:45,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:46,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:46,003 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-12 00:14:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:46,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-12 00:14:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-12 00:14:46,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 12.10 12:14:46 BoogieIcfgContainer [2024-10-12 00:14:46,098 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-12 00:14:46,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-12 00:14:46,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-12 00:14:46,099 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-12 00:14:46,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 12:14:44" (3/4) ... [2024-10-12 00:14:46,101 INFO L136 WitnessPrinter]: Generating witness for non-termination counterexample [2024-10-12 00:14:46,129 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-12 00:14:46,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-12 00:14:46,130 INFO L158 Benchmark]: Toolchain (without parser) took 2098.98ms. Allocated memory is still 197.1MB. Free memory was 129.9MB in the beginning and 109.5MB in the end (delta: 20.4MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,130 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 119.5MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:14:46,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.32ms. Allocated memory is still 197.1MB. Free memory was 129.7MB in the beginning and 118.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.41ms. Allocated memory is still 197.1MB. Free memory was 118.2MB in the beginning and 116.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,130 INFO L158 Benchmark]: Boogie Preprocessor took 27.86ms. Allocated memory is still 197.1MB. Free memory was 116.8MB in the beginning and 115.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,131 INFO L158 Benchmark]: RCFGBuilder took 242.69ms. Allocated memory is still 197.1MB. Free memory was 115.3MB in the beginning and 165.1MB in the end (delta: -49.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,131 INFO L158 Benchmark]: BuchiAutomizer took 1569.07ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 111.6MB in the end (delta: 53.5MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. [2024-10-12 00:14:46,131 INFO L158 Benchmark]: Witness Printer took 30.63ms. Allocated memory is still 197.1MB. Free memory was 111.6MB in the beginning and 109.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-12 00:14:46,133 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.42ms. Allocated memory is still 119.5MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.32ms. Allocated memory is still 197.1MB. Free memory was 129.7MB in the beginning and 118.2MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.41ms. Allocated memory is still 197.1MB. Free memory was 118.2MB in the beginning and 116.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.86ms. Allocated memory is still 197.1MB. Free memory was 116.8MB in the beginning and 115.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 242.69ms. Allocated memory is still 197.1MB. Free memory was 115.3MB in the beginning and 165.1MB in the end (delta: -49.8MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 1569.07ms. Allocated memory is still 197.1MB. Free memory was 165.1MB in the beginning and 111.6MB in the end (delta: 53.5MB). Peak memory consumption was 50.1MB. Max. memory is 16.1GB. * Witness Printer took 30.63ms. Allocated memory is still 197.1MB. Free memory was 111.6MB in the beginning and 109.5MB in the end (delta: 2.1MB). 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function ((long) -1 * i) and consists of 6 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 1.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 24 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 84 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 40 mSDtfsCounter, 84 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax200 hnf100 lsp50 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq150 hnf94 smp100 dnf100 smp100 tf111 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 VAL [i=0] [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 VAL [a=2, i=0, j=0] [L18] COND TRUE j < a [L19] k = i+j+3 VAL [a=2, i=0, j=0, k=3] [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 VAL [a=2, b=7, i=0, j=0, k=3, l=0] [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 VAL [a=2, b=7, i=0, j=0, k=3, l=0, m=1003] Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int j; [L8] int k; [L9] int l; [L10] int m; [L11] int a; [L12] int b; [L13] i = 0 VAL [i=0] [L15] COND TRUE i < 100 [L16] a = i+2 [L17] j = 0 VAL [a=2, i=0, j=0] [L18] COND TRUE j < a [L19] k = i+j+3 VAL [a=2, i=0, j=0, k=3] [L20] COND TRUE k >= 0 [L21] b = i+j+k+4 [L22] l = 0 VAL [a=2, b=7, i=0, j=0, k=3, l=0] [L23] COND TRUE l < b [L24] m = i+j+k+l+1000 VAL [a=2, b=7, i=0, j=0, k=3, l=0, m=1003] Loop: [L25] COND TRUE m >= 0 [L26] m = m-0 End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-10-12 00:14:46,153 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)