./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/AlternKonv.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-restricted-15/AlternKonv.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 08:03:22,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 08:03:22,505 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-11-17 08:03:22,511 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 08:03:22,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 08:03:22,512 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2024-11-17 08:03:22,539 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 08:03:22,539 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 08:03:22,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 08:03:22,540 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 08:03:22,541 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 08:03:22,541 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 08:03:22,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 08:03:22,542 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 08:03:22,542 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-17 08:03:22,543 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-17 08:03:22,543 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-17 08:03:22,543 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-17 08:03:22,544 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-17 08:03:22,544 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-17 08:03:22,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 08:03:22,547 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-17 08:03:22,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 08:03:22,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 08:03:22,550 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-17 08:03:22,550 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-17 08:03:22,551 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-17 08:03:22,551 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 08:03:22,551 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 08:03:22,552 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 08:03:22,552 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-17 08:03:22,552 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 08:03:22,553 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 08:03:22,557 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 08:03:22,558 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 08:03:22,558 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 08:03:22,558 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-17 08:03:22,559 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/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/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 -> 9816d5cc9e8c1fba9291af90498afaa319416e5c56fa3cf3ce8da9d63d3e9939 [2024-11-17 08:03:22,829 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 08:03:22,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 08:03:22,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 08:03:22,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 08:03:22,858 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 08:03:22,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-11-17 08:03:24,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 08:03:24,536 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 08:03:24,536 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/AlternKonv.c [2024-11-17 08:03:24,542 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f28d6bf3/450452f90ac44a1d85e4eea6f7c213d9/FLAGaef3ea4ac [2024-11-17 08:03:24,554 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5f28d6bf3/450452f90ac44a1d85e4eea6f7c213d9 [2024-11-17 08:03:24,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 08:03:24,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 08:03:24,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 08:03:24,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 08:03:24,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 08:03:24,567 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,568 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d020e44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24, skipping insertion in model container [2024-11-17 08:03:24,568 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,585 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 08:03:24,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:03:24,762 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 08:03:24,776 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 08:03:24,792 INFO L204 MainTranslator]: Completed translation [2024-11-17 08:03:24,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24 WrapperNode [2024-11-17 08:03:24,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 08:03:24,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 08:03:24,794 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 08:03:24,794 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 08:03:24,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,804 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,823 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2024-11-17 08:03:24,825 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 08:03:24,825 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 08:03:24,826 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 08:03:24,826 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 08:03:24,835 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,837 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,843 INFO L175 MemorySlicer]: No memory access in input program. [2024-11-17 08:03:24,843 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,843 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,848 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,849 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,850 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 08:03:24,851 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 08:03:24,851 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 08:03:24,852 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 08:03:24,853 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (1/1) ... [2024-11-17 08:03:24,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:24,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:24,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:24,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2024-11-17 08:03:24,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 08:03:24,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 08:03:24,994 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 08:03:24,996 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 08:03:25,073 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-11-17 08:03:25,073 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 08:03:25,092 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 08:03:25,092 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 08:03:25,093 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:25 BoogieIcfgContainer [2024-11-17 08:03:25,093 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 08:03:25,094 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-17 08:03:25,094 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-17 08:03:25,102 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-17 08:03:25,105 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:25,105 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.11 08:03:24" (1/3) ... [2024-11-17 08:03:25,106 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693a2b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:03:25, skipping insertion in model container [2024-11-17 08:03:25,106 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:25,106 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 08:03:24" (2/3) ... [2024-11-17 08:03:25,107 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@693a2b7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.11 08:03:25, skipping insertion in model container [2024-11-17 08:03:25,107 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-17 08:03:25,107 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:25" (3/3) ... [2024-11-17 08:03:25,109 INFO L332 chiAutomizerObserver]: Analyzing ICFG AlternKonv.c [2024-11-17 08:03:25,191 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-17 08:03:25,191 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-17 08:03:25,192 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-17 08:03:25,192 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-17 08:03:25,192 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-17 08:03:25,193 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-17 08:03:25,193 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-17 08:03:25,193 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-17 08:03:25,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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-11-17 08:03:25,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:03:25,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:25,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:25,221 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:25,221 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:03:25,223 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-17 08:03:25,224 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 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-11-17 08:03:25,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:03:25,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:25,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:25,226 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-17 08:03:25,226 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:03:25,235 INFO L745 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 8#ULTIMATE.init_returnLabel#1true assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 2#L9true [2024-11-17 08:03:25,237 INFO L747 eck$LassoCheckResult]: Loop: 2#L9true assume true; 9#L9-1true assume !!(0 != main_~i~0#1); 10#L10true assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 4#L18true assume main_~i~0#1 > 0;main_~i~0#1 := -1 * main_~i~0#1; 2#L9true [2024-11-17 08:03:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1568, now seen corresponding path program 1 times [2024-11-17 08:03:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:25,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673485836] [2024-11-17 08:03:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:25,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:25,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1415006, now seen corresponding path program 1 times [2024-11-17 08:03:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:25,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552783433] [2024-11-17 08:03:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:25,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,378 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:25,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:25,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:25,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1448572413, now seen corresponding path program 1 times [2024-11-17 08:03:25,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:25,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226444505] [2024-11-17 08:03:25,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:25,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,411 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:25,417 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:25,518 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:25,518 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:25,519 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:25,519 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:25,519 INFO L128 ssoRankerPreferences]: Use exernal solver: true [2024-11-17 08:03:25,519 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,519 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:25,519 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:25,519 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2024-11-17 08:03:25,519 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:25,520 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:25,534 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,545 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,550 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,621 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:25,622 INFO L365 LassoAnalysis]: Checking for nontermination... [2024-11-17 08:03:25,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,626 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2024-11-17 08:03:25,630 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:25,630 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:25,657 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:03:25,657 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-11-17 08:03:25,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:25,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2024-11-17 08:03:25,688 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:25,688 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:25,707 INFO L398 LassoAnalysis]: Proved nontermination for one component. [2024-11-17 08:03:25,707 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-11-17 08:03:25,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:25,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,720 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2024-11-17 08:03:25,722 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2024-11-17 08:03:25,722 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:25,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2024-11-17 08:03:25,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,754 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2024-11-17 08:03:25,756 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2024-11-17 08:03:25,756 INFO L160 nArgumentSynthesizer]: Using integer mode. [2024-11-17 08:03:25,817 INFO L405 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2024-11-17 08:03:25,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2024-11-17 08:03:25,822 INFO L204 LassoAnalysis]: Preferences: [2024-11-17 08:03:25,822 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-11-17 08:03:25,823 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-11-17 08:03:25,823 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-11-17 08:03:25,823 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-11-17 08:03:25,823 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,823 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-11-17 08:03:25,823 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-11-17 08:03:25,823 INFO L132 ssoRankerPreferences]: Filename of dumped script: AlternKonv.c_Iteration1_Loop [2024-11-17 08:03:25,823 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-11-17 08:03:25,832 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-11-17 08:03:25,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-11-17 08:03:25,907 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-11-17 08:03:25,912 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-11-17 08:03:25,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2024-11-17 08:03:25,920 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-11-17 08:03:25,934 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:25,934 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:25,934 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:25,934 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:25,941 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:25,942 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:25,952 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:25,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-11-17 08:03:25,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:25,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:25,973 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:25,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2024-11-17 08:03:25,977 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-11-17 08:03:25,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:25,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:25,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:25,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:25,993 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-11-17 08:03:25,993 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-11-17 08:03:26,000 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-11-17 08:03:26,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2024-11-17 08:03:26,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:26,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:26,019 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:26,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2024-11-17 08:03:26,022 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-11-17 08:03:26,034 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-11-17 08:03:26,035 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-11-17 08:03:26,035 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-11-17 08:03:26,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-11-17 08:03:26,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-11-17 08:03:26,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-11-17 08:03:26,039 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-11-17 08:03:26,044 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-11-17 08:03:26,047 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2024-11-17 08:03:26,047 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-11-17 08:03:26,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-17 08:03:26,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 08:03:26,067 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2024-11-17 08:03:26,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2024-11-17 08:03:26,071 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-11-17 08:03:26,071 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-11-17 08:03:26,071 INFO L474 LassoAnalysis]: Proved termination. [2024-11-17 08:03:26,072 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-11-17 08:03:26,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-11-17 08:03:26,091 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2024-11-17 08:03:26,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:26,123 WARN L253 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 08:03:26,124 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:26,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:26,137 WARN L253 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 08:03:26,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 08:03:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:26,200 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-11-17 08:03:26,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-17 08:03:26,251 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 12 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 26 states and 39 transitions. Complement of second has 6 states. [2024-11-17 08:03:26,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2024-11-17 08:03:26,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 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-11-17 08:03:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2024-11-17 08:03:26,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 4 letters. [2024-11-17 08:03:26,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:26,260 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 6 letters. Loop has 4 letters. [2024-11-17 08:03:26,260 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:26,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 13 transitions. Stem has 2 letters. Loop has 8 letters. [2024-11-17 08:03:26,261 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-11-17 08:03:26,261 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 39 transitions. [2024-11-17 08:03:26,263 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:03:26,266 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 18 states and 25 transitions. [2024-11-17 08:03:26,266 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2024-11-17 08:03:26,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2024-11-17 08:03:26,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 25 transitions. [2024-11-17 08:03:26,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:26,267 INFO L218 hiAutomatonCegarLoop]: Abstraction has 18 states and 25 transitions. [2024-11-17 08:03:26,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 25 transitions. [2024-11-17 08:03:26,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-17 08:03:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.411764705882353) internal successors, (24), 16 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 24 transitions. [2024-11-17 08:03:26,291 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-17 08:03:26,291 INFO L425 stractBuchiCegarLoop]: Abstraction has 17 states and 24 transitions. [2024-11-17 08:03:26,292 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-17 08:03:26,292 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 24 transitions. [2024-11-17 08:03:26,292 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2024-11-17 08:03:26,293 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:26,293 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:26,294 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:03:26,294 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-11-17 08:03:26,294 INFO L745 eck$LassoCheckResult]: Stem: 89#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 90#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 93#L9 assume true; 81#L9-1 assume !!(0 != main_~i~0#1); 91#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 94#L12 [2024-11-17 08:03:26,294 INFO L747 eck$LassoCheckResult]: Loop: 94#L12 assume !(main_~i~0#1 < 0); 85#L9 assume true; 96#L9-1 assume !!(0 != main_~i~0#1); 95#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 94#L12 [2024-11-17 08:03:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 46728139, now seen corresponding path program 1 times [2024-11-17 08:03:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722431909] [2024-11-17 08:03:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,301 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,304 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1207491, now seen corresponding path program 1 times [2024-11-17 08:03:26,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451878019] [2024-11-17 08:03:26,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:26,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:26,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:26,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451878019] [2024-11-17 08:03:26,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451878019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:26,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:26,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-17 08:03:26,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219568234] [2024-11-17 08:03:26,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:26,360 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:26,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 08:03:26,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 08:03:26,364 INFO L87 Difference]: Start difference. First operand 17 states and 24 transitions. cyclomatic complexity: 9 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 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-11-17 08:03:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:26,386 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2024-11-17 08:03:26,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2024-11-17 08:03:26,387 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:03:26,387 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 27 transitions. [2024-11-17 08:03:26,388 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-11-17 08:03:26,388 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-11-17 08:03:26,388 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2024-11-17 08:03:26,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:26,388 INFO L218 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:03:26,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2024-11-17 08:03:26,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-17 08:03:26,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.35) internal successors, (27), 19 states have internal predecessors, (27), 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-11-17 08:03:26,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 27 transitions. [2024-11-17 08:03:26,391 INFO L240 hiAutomatonCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:03:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 08:03:26,392 INFO L425 stractBuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2024-11-17 08:03:26,392 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-11-17 08:03:26,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 27 transitions. [2024-11-17 08:03:26,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2024-11-17 08:03:26,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:26,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:26,394 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2024-11-17 08:03:26,394 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-11-17 08:03:26,394 INFO L745 eck$LassoCheckResult]: Stem: 132#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 133#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 134#L9 assume true; 141#L9-1 assume !!(0 != main_~i~0#1); 137#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 138#L12 [2024-11-17 08:03:26,395 INFO L747 eck$LassoCheckResult]: Loop: 138#L12 assume main_~i~0#1 < 0; 131#L13-1 assume !(main_~i~0#1 <= -2147483648);main_~i~0#1 := -1 * main_~i~0#1; 123#L9 assume true; 124#L9-1 assume !!(0 != main_~i~0#1); 135#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 138#L12 [2024-11-17 08:03:26,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,395 INFO L85 PathProgramCache]: Analyzing trace with hash 46728139, now seen corresponding path program 2 times [2024-11-17 08:03:26,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536217756] [2024-11-17 08:03:26,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,403 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,407 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash 36241707, now seen corresponding path program 1 times [2024-11-17 08:03:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902464468] [2024-11-17 08:03:26,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:26,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:26,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:26,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902464468] [2024-11-17 08:03:26,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902464468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:26,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:26,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 08:03:26,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921611786] [2024-11-17 08:03:26,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:26,469 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:26,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:26,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:03:26,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:03:26,470 INFO L87 Difference]: Start difference. First operand 20 states and 27 transitions. cyclomatic complexity: 9 Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:26,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:26,497 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2024-11-17 08:03:26,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2024-11-17 08:03:26,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2024-11-17 08:03:26,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 34 transitions. [2024-11-17 08:03:26,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-11-17 08:03:26,504 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-11-17 08:03:26,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 34 transitions. [2024-11-17 08:03:26,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:26,504 INFO L218 hiAutomatonCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-17 08:03:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 34 transitions. [2024-11-17 08:03:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2024-11-17 08:03:26,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 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-11-17 08:03:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2024-11-17 08:03:26,507 INFO L240 hiAutomatonCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-17 08:03:26,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:03:26,509 INFO L425 stractBuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2024-11-17 08:03:26,509 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-11-17 08:03:26,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2024-11-17 08:03:26,510 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2024-11-17 08:03:26,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:26,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:26,511 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:03:26,511 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-17 08:03:26,511 INFO L745 eck$LassoCheckResult]: Stem: 189#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 190#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 191#L9 assume true; 181#L9-1 [2024-11-17 08:03:26,511 INFO L747 eck$LassoCheckResult]: Loop: 181#L9-1 assume !!(0 != main_~i~0#1); 192#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 195#L12 assume !(main_~i~0#1 < 0); 188#L9 assume true; 198#L9-1 assume !!(0 != main_~i~0#1); 194#L10 assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 184#L18 assume main_~i~0#1 > 0;main_~i~0#1 := -1 * main_~i~0#1; 180#L9 assume true; 181#L9-1 [2024-11-17 08:03:26,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,512 INFO L85 PathProgramCache]: Analyzing trace with hash 48624, now seen corresponding path program 1 times [2024-11-17 08:03:26,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306032804] [2024-11-17 08:03:26,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,516 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,520 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash -877102586, now seen corresponding path program 1 times [2024-11-17 08:03:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250678069] [2024-11-17 08:03:26,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 08:03:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 08:03:26,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 08:03:26,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250678069] [2024-11-17 08:03:26,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250678069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 08:03:26,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 08:03:26,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 08:03:26,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117536815] [2024-11-17 08:03:26,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 08:03:26,602 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-11-17 08:03:26,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 08:03:26,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 08:03:26,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 08:03:26,604 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 8 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 08:03:26,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 08:03:26,638 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-17 08:03:26,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 43 transitions. [2024-11-17 08:03:26,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 19 [2024-11-17 08:03:26,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 34 states and 40 transitions. [2024-11-17 08:03:26,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2024-11-17 08:03:26,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2024-11-17 08:03:26,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 40 transitions. [2024-11-17 08:03:26,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-11-17 08:03:26,641 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-17 08:03:26,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 40 transitions. [2024-11-17 08:03:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2024-11-17 08:03:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 21 states have internal predecessors, (28), 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-11-17 08:03:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-11-17 08:03:26,643 INFO L240 hiAutomatonCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-17 08:03:26,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 08:03:26,645 INFO L425 stractBuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-11-17 08:03:26,645 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-11-17 08:03:26,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2024-11-17 08:03:26,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2024-11-17 08:03:26,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-17 08:03:26,646 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-17 08:03:26,646 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-17 08:03:26,647 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2024-11-17 08:03:26,647 INFO L745 eck$LassoCheckResult]: Stem: 248#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 249#ULTIMATE.init_returnLabel#1 assume true;assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1;havoc main_~i~0#1;havoc main_#t~nondet0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1; 250#L9 assume true; 244#L9-1 [2024-11-17 08:03:26,647 INFO L747 eck$LassoCheckResult]: Loop: 244#L9-1 assume !!(0 != main_~i~0#1); 251#L10 assume main_~i~0#1 < 0;main_~i~0#1 := 2 + main_~i~0#1; 253#L12 assume !(main_~i~0#1 < 0); 254#L9 assume true; 261#L9-1 assume !!(0 != main_~i~0#1); 252#L10 assume !(main_~i~0#1 < 0);main_~i~0#1 := main_~i~0#1 - 2; 245#L18 assume !(main_~i~0#1 > 0); 243#L9 assume true; 244#L9-1 [2024-11-17 08:03:26,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,648 INFO L85 PathProgramCache]: Analyzing trace with hash 48624, now seen corresponding path program 2 times [2024-11-17 08:03:26,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654587332] [2024-11-17 08:03:26,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,655 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -877102555, now seen corresponding path program 1 times [2024-11-17 08:03:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108742940] [2024-11-17 08:03:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,673 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,681 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 08:03:26,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1114646252, now seen corresponding path program 1 times [2024-11-17 08:03:26,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 08:03:26,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305179695] [2024-11-17 08:03:26,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 08:03:26,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 08:03:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,690 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-17 08:03:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,761 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-17 08:03:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-17 08:03:26,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.11 08:03:26 BoogieIcfgContainer [2024-11-17 08:03:26,781 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-17 08:03:26,782 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-17 08:03:26,782 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-17 08:03:26,782 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-17 08:03:26,783 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 08:03:25" (3/4) ... [2024-11-17 08:03:26,785 INFO L140 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-17 08:03:26,823 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-17 08:03:26,825 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-17 08:03:26,826 INFO L158 Benchmark]: Toolchain (without parser) took 2268.73ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 120.2MB in the beginning and 164.1MB in the end (delta: -43.8MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2024-11-17 08:03:26,826 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:03:26,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 234.12ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 108.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:03:26,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.39ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:03:26,827 INFO L158 Benchmark]: Boogie Preprocessor took 24.86ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 106.2MB in the end (delta: 979.2kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 08:03:26,828 INFO L158 Benchmark]: IcfgBuilder took 242.15ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 96.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-17 08:03:26,828 INFO L158 Benchmark]: BuchiAutomizer took 1687.65ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 166.2MB in the end (delta: -69.9MB). Peak memory consumption was 731.7kB. Max. memory is 16.1GB. [2024-11-17 08:03:26,829 INFO L158 Benchmark]: Witness Printer took 43.25ms. Allocated memory is still 245.4MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-17 08:03:26,831 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.20ms. Allocated memory is still 176.2MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 234.12ms. Allocated memory is still 176.2MB. Free memory was 120.2MB in the beginning and 108.7MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.39ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 107.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.86ms. Allocated memory is still 176.2MB. Free memory was 107.2MB in the beginning and 106.2MB in the end (delta: 979.2kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 242.15ms. Allocated memory is still 176.2MB. Free memory was 106.1MB in the beginning and 96.7MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 1687.65ms. Allocated memory was 176.2MB in the beginning and 245.4MB in the end (delta: 69.2MB). Free memory was 96.2MB in the beginning and 166.2MB in the end (delta: -69.9MB). Peak memory consumption was 731.7kB. Max. memory is 16.1GB. * Witness Printer took 43.25ms. Allocated memory is still 245.4MB. Free memory was 166.2MB in the beginning and 164.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function i and consists of 4 locations. 3 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 22 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.5s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 22 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, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 52 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 72 IncrementalHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 37 mSDtfsCounter, 72 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI3 SFLT1 conc0 concLT0 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: 39ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 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: 9]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() Loop: [L9] COND TRUE i != 0 [L10] COND TRUE i < 0 [L11] i = i+2 [L12] COND FALSE !(i < 0) [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 9]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] i = __VERIFIER_nondet_int() Loop: [L9] COND TRUE i != 0 [L10] COND TRUE i < 0 [L11] i = i+2 [L12] COND FALSE !(i < 0) [L9] COND TRUE i != 0 [L10] COND FALSE !(i < 0) [L17] i = i-2 [L18] COND FALSE !(i > 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-17 08:03:26,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Ended with exit code 0 [2024-11-17 08:03:27,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)