./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a31fd051 Calling Ultimate with: /usr/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/UpAndDownIneq.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.graphml --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 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 14:16:23,739 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 14:16:23,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 14:16:23,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 14:16:23,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 14:16:23,779 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 14:16:23,782 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 14:16:23,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 14:16:23,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 14:16:23,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 14:16:23,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 14:16:23,796 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 14:16:23,796 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 14:16:23,798 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 14:16:23,800 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 14:16:23,801 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 14:16:23,801 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 14:16:23,803 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 14:16:23,804 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 14:16:23,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 14:16:23,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 14:16:23,810 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 14:16:23,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 14:16:23,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 14:16:23,819 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 14:16:23,819 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 14:16:23,820 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 14:16:23,822 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 14:16:23,822 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 14:16:23,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 14:16:23,823 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 14:16:23,824 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 14:16:23,825 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 14:16:23,826 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 14:16:23,827 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 14:16:23,827 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 14:16:23,827 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 14:16:23,828 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 14:16:23,828 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 14:16:23,829 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 14:16:23,830 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 14:16:23,831 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2023-02-15 14:16:23,859 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 14:16:23,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 14:16:23,860 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 14:16:23,860 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 14:16:23,861 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 14:16:23,861 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 14:16:23,861 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 14:16:23,861 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-02-15 14:16:23,862 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-02-15 14:16:23,862 INFO L138 SettingsManager]: * Use old map elimination=false [2023-02-15 14:16:23,862 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2023-02-15 14:16:23,863 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2023-02-15 14:16:23,863 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-02-15 14:16:23,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 14:16:23,863 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 14:16:23,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-15 14:16:23,864 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-02-15 14:16:23,865 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 14:16:23,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-02-15 14:16:23,865 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 14:16:23,865 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 14:16:23,865 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 14:16:23,866 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 14:16:23,867 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-02-15 14:16:23,867 INFO L138 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.graphml 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 -> 7c4ca36c34c25cccb97ec2e65527d2a743b4e62b95f1f396c9f281ef44a01670 [2023-02-15 14:16:24,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 14:16:24,136 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 14:16:24,139 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 14:16:24,140 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 14:16:24,141 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 14:16:24,143 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-15 14:16:25,332 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 14:16:25,485 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 14:16:25,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/UpAndDownIneq.c [2023-02-15 14:16:25,490 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b685221b7/e2640c051dc8440f97be49fe646cd246/FLAG86a9d3bde [2023-02-15 14:16:25,501 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b685221b7/e2640c051dc8440f97be49fe646cd246 [2023-02-15 14:16:25,503 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 14:16:25,504 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 14:16:25,505 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 14:16:25,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 14:16:25,511 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 14:16:25,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@734dd288 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25, skipping insertion in model container [2023-02-15 14:16:25,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,520 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 14:16:25,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 14:16:25,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:16:25,636 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 14:16:25,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 14:16:25,658 INFO L208 MainTranslator]: Completed translation [2023-02-15 14:16:25,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25 WrapperNode [2023-02-15 14:16:25,659 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 14:16:25,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 14:16:25,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 14:16:25,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 14:16:25,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,683 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-02-15 14:16:25,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 14:16:25,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 14:16:25,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 14:16:25,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 14:16:25,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,694 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,701 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,702 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,703 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 14:16:25,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 14:16:25,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 14:16:25,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 14:16:25,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (1/1) ... [2023-02-15 14:16:25,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:25,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:25,742 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) [2023-02-15 14:16:25,765 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 [2023-02-15 14:16:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 14:16:25,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 14:16:25,841 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 14:16:25,844 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 14:16:25,934 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 14:16:25,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 14:16:25,941 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 14:16:25,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:16:25 BoogieIcfgContainer [2023-02-15 14:16:25,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 14:16:25,944 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-02-15 14:16:25,944 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2023-02-15 14:16:25,947 INFO L275 PluginConnector]: BuchiAutomizer initialized [2023-02-15 14:16:25,948 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:16:25,948 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.02 02:16:25" (1/3) ... [2023-02-15 14:16:25,949 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d517c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:16:25, skipping insertion in model container [2023-02-15 14:16:25,949 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:16:25,949 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 02:16:25" (2/3) ... [2023-02-15 14:16:25,950 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d517c05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.02 02:16:25, skipping insertion in model container [2023-02-15 14:16:25,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-02-15 14:16:25,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:16:25" (3/3) ... [2023-02-15 14:16:25,951 INFO L332 chiAutomizerObserver]: Analyzing ICFG UpAndDownIneq.c [2023-02-15 14:16:26,019 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-02-15 14:16:26,019 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-02-15 14:16:26,019 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-02-15 14:16:26,020 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-02-15 14:16:26,020 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-02-15 14:16:26,020 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-02-15 14:16:26,020 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-02-15 14:16:26,020 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-02-15 14:16:26,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:26,039 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:16:26,040 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:26,040 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:26,044 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:16:26,044 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:26,045 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-02-15 14:16:26,045 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:26,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2023-02-15 14:16:26,046 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:26,047 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:26,047 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2023-02-15 14:16:26,047 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:26,055 INFO L748 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4#L18-1true [2023-02-15 14:16:26,056 INFO L750 eck$LassoCheckResult]: Loop: 4#L18-1true assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 10#L12true assume !(main_~i~0#1 >= 10); 2#L12-2true assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 7#L15-1true assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4#L18-1true [2023-02-15 14:16:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:26,062 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2023-02-15 14:16:26,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:26,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11983513] [2023-02-15 14:16:26,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:26,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:26,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash 1267244, now seen corresponding path program 1 times [2023-02-15 14:16:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:26,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750052198] [2023-02-15 14:16:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:26,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,165 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,183 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:26,184 INFO L85 PathProgramCache]: Analyzing trace with hash 889694446, now seen corresponding path program 1 times [2023-02-15 14:16:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:26,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501168296] [2023-02-15 14:16:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:26,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,192 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:26,197 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:26,278 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:26,278 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:26,279 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:26,279 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:26,279 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:26,279 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,279 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:26,279 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:26,279 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-15 14:16:26,279 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:26,280 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:26,308 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,334 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,360 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,454 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:26,457 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:26,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,465 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) [2023-02-15 14:16:26,466 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 [2023-02-15 14:16:26,475 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:26,475 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:26,500 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:26,500 INFO L440 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: [] [2023-02-15 14:16:26,508 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 [2023-02-15 14:16:26,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,510 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) [2023-02-15 14:16:26,512 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 [2023-02-15 14:16:26,516 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:26,516 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:26,537 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:26,537 INFO L440 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: [] [2023-02-15 14:16:26,545 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 [2023-02-15 14:16:26,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,547 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) [2023-02-15 14:16:26,555 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:26,556 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:26,556 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 [2023-02-15 14:16:26,584 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 [2023-02-15 14:16:26,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,588 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) [2023-02-15 14:16:26,589 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 [2023-02-15 14:16:26,590 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:26,590 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:26,609 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:26,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:26,613 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:26,613 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:26,613 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:26,613 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:26,614 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:26,614 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,614 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:26,614 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:26,614 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration1_Loop [2023-02-15 14:16:26,614 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:26,614 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:26,615 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,619 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,627 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,635 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:26,685 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:26,689 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:26,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,691 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) [2023-02-15 14:16:26,693 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 [2023-02-15 14:16:26,695 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 [2023-02-15 14:16:26,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:26,702 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:26,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:26,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:26,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:26,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:26,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:26,710 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:26,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:26,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,717 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) [2023-02-15 14:16:26,718 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 [2023-02-15 14:16:26,720 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 [2023-02-15 14:16:26,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:26,726 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:26,726 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:26,726 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:26,730 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:16:26,730 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:16:26,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:26,749 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 [2023-02-15 14:16:26,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,750 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) [2023-02-15 14:16:26,752 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 [2023-02-15 14:16:26,754 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 [2023-02-15 14:16:26,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:26,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:26,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:26,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:26,764 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:16:26,764 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:16:26,776 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:26,787 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 [2023-02-15 14:16:26,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,789 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) [2023-02-15 14:16:26,795 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 [2023-02-15 14:16:26,817 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 [2023-02-15 14:16:26,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:26,824 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:26,824 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:26,824 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:26,824 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:26,825 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:26,825 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:26,836 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:26,840 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:26,840 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:16:26,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:26,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:26,846 INFO L229 MonitoredProcess]: Starting monitored process 10 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) [2023-02-15 14:16:26,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2023-02-15 14:16:26,849 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:26,849 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:26,849 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:26,850 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 1 Supporting invariants [] [2023-02-15 14:16:26,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:26,860 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:26,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:26,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:26,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:26,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:26,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:26,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:26,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:26,948 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 [2023-02-15 14:16:26,950 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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) [2023-02-15 14:16:26,998 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). 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 36 states and 54 transitions. Complement of second has 8 states. [2023-02-15 14:16:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:27,004 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) [2023-02-15 14:16:27,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2023-02-15 14:16:27,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2023-02-15 14:16:27,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 6 letters. Loop has 4 letters. [2023-02-15 14:16:27,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 8 letters. [2023-02-15 14:16:27,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 54 transitions. [2023-02-15 14:16:27,011 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-15 14:16:27,015 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 19 states and 30 transitions. [2023-02-15 14:16:27,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2023-02-15 14:16:27,016 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2023-02-15 14:16:27,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 30 transitions. [2023-02-15 14:16:27,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:27,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 19 states and 30 transitions. [2023-02-15 14:16:27,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 30 transitions. [2023-02-15 14:16:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2023-02-15 14:16:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 17 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) [2023-02-15 14:16:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2023-02-15 14:16:27,040 INFO L240 hiAutomatonCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-15 14:16:27,040 INFO L428 stractBuchiCegarLoop]: Abstraction has 18 states and 28 transitions. [2023-02-15 14:16:27,040 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-02-15 14:16:27,040 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 28 transitions. [2023-02-15 14:16:27,041 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-15 14:16:27,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:27,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:27,042 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2023-02-15 14:16:27,042 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:27,042 INFO L748 eck$LassoCheckResult]: Stem: 100#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 101#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 105#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-15 14:16:27,042 INFO L750 eck$LassoCheckResult]: Loop: 97#L12 assume !(main_~i~0#1 >= 10); 106#L12-2 assume !(main_~i~0#1 <= 0); 107#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 96#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 97#L12 [2023-02-15 14:16:27,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2023-02-15 14:16:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127223658] [2023-02-15 14:16:27,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,048 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,051 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:27,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash 1422136, now seen corresponding path program 1 times [2023-02-15 14:16:27,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421481845] [2023-02-15 14:16:27,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,058 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,061 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:27,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1810725983, now seen corresponding path program 1 times [2023-02-15 14:16:27,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141041054] [2023-02-15 14:16:27,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:27,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:27,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:27,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141041054] [2023-02-15 14:16:27,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141041054] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:27,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:27,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:16:27,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545653821] [2023-02-15 14:16:27,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:27,131 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:27,132 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:27,132 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:27,132 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:27,132 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:27,132 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,132 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:27,133 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:27,133 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-15 14:16:27,133 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:27,133 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:27,134 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,137 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,143 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,146 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,179 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:27,180 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:27,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,185 INFO L229 MonitoredProcess]: Starting monitored process 11 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) [2023-02-15 14:16:27,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2023-02-15 14:16:27,189 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:27,189 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,210 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:27,210 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_3=0} Honda state: {v_rep~unnamed0~0~false_3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:27,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,219 INFO L229 MonitoredProcess]: Starting monitored process 12 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) [2023-02-15 14:16:27,232 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:27,232 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2023-02-15 14:16:27,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,261 INFO L229 MonitoredProcess]: Starting monitored process 13 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) [2023-02-15 14:16:27,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:27,272 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2023-02-15 14:16:27,305 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:27,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,312 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:27,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:27,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:27,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:27,313 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:27,313 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:27,313 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:27,313 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration2_Loop [2023-02-15 14:16:27,313 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:27,313 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:27,314 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,318 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,327 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,331 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,372 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:27,373 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:27,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,374 INFO L229 MonitoredProcess]: Starting monitored process 14 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) [2023-02-15 14:16:27,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2023-02-15 14:16:27,378 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 [2023-02-15 14:16:27,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:27,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:27,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:27,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:27,390 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:16:27,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:16:27,409 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:27,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,419 INFO L229 MonitoredProcess]: Starting monitored process 15 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) [2023-02-15 14:16:27,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2023-02-15 14:16:27,424 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 [2023-02-15 14:16:27,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:27,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:27,432 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:27,432 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:27,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:27,434 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:27,434 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:27,446 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:27,450 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:27,451 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:16:27,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,454 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2023-02-15 14:16:27,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2023-02-15 14:16:27,457 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:27,457 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:27,457 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:27,457 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-15 14:16:27,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,469 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:27,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:27,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:27,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:27,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:27,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:27,568 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 [2023-02-15 14:16:27,568 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13 Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2023-02-15 14:16:27,607 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 28 transitions. cyclomatic complexity: 13. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) Result 44 states and 73 transitions. Complement of second has 7 states. [2023-02-15 14:16:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:27,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 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) [2023-02-15 14:16:27,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2023-02-15 14:16:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 4 letters. [2023-02-15 14:16:27,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 7 letters. Loop has 4 letters. [2023-02-15 14:16:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 3 letters. Loop has 8 letters. [2023-02-15 14:16:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:27,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 73 transitions. [2023-02-15 14:16:27,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2023-02-15 14:16:27,614 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 36 states and 59 transitions. [2023-02-15 14:16:27,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2023-02-15 14:16:27,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2023-02-15 14:16:27,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 59 transitions. [2023-02-15 14:16:27,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:27,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 36 states and 59 transitions. [2023-02-15 14:16:27,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 59 transitions. [2023-02-15 14:16:27,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2023-02-15 14:16:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 27 states have internal predecessors, (46), 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) [2023-02-15 14:16:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 46 transitions. [2023-02-15 14:16:27,619 INFO L240 hiAutomatonCegarLoop]: Abstraction has 28 states and 46 transitions. [2023-02-15 14:16:27,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:27,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:16:27,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:16:27,623 INFO L87 Difference]: Start difference. First operand 28 states and 46 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) [2023-02-15 14:16:27,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:27,635 INFO L93 Difference]: Finished difference Result 37 states and 56 transitions. [2023-02-15 14:16:27,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 56 transitions. [2023-02-15 14:16:27,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:16:27,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 32 states and 49 transitions. [2023-02-15 14:16:27,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-15 14:16:27,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-15 14:16:27,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 32 states and 49 transitions. [2023-02-15 14:16:27,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:27,658 INFO L218 hiAutomatonCegarLoop]: Abstraction has 32 states and 49 transitions. [2023-02-15 14:16:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states and 49 transitions. [2023-02-15 14:16:27,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2023-02-15 14:16:27,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 25 states have internal predecessors, (40), 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) [2023-02-15 14:16:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2023-02-15 14:16:27,661 INFO L240 hiAutomatonCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-15 14:16:27,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:16:27,667 INFO L428 stractBuchiCegarLoop]: Abstraction has 26 states and 40 transitions. [2023-02-15 14:16:27,667 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2023-02-15 14:16:27,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 40 transitions. [2023-02-15 14:16:27,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:16:27,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:27,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:27,668 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2023-02-15 14:16:27,668 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:27,669 INFO L748 eck$LassoCheckResult]: Stem: 272#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 273#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 276#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 277#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 264#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-15 14:16:27,669 INFO L750 eck$LassoCheckResult]: Loop: 265#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 274#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 283#L12 assume !(main_~i~0#1 >= 10); 281#L12-2 assume !(main_~i~0#1 <= 0); 265#L15-1 [2023-02-15 14:16:27,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash 28699760, now seen corresponding path program 1 times [2023-02-15 14:16:27,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205664074] [2023-02-15 14:16:27,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,674 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,677 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:27,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1768758, now seen corresponding path program 1 times [2023-02-15 14:16:27,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667566368] [2023-02-15 14:16:27,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,691 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:27,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,708 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:27,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:27,708 INFO L85 PathProgramCache]: Analyzing trace with hash 588716581, now seen corresponding path program 1 times [2023-02-15 14:16:27,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:27,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692812217] [2023-02-15 14:16:27,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:27,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,713 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:27,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:27,717 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:27,748 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:27,749 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:27,749 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:27,749 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:27,749 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:27,749 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,749 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:27,750 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:27,750 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-15 14:16:27,750 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:27,750 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:27,751 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,754 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,756 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,761 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,794 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:27,794 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:27,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,796 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2023-02-15 14:16:27,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2023-02-15 14:16:27,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:27,800 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,821 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:27,822 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:27,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,830 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2023-02-15 14:16:27,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2023-02-15 14:16:27,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:27,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,849 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:27,850 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:27,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,858 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2023-02-15 14:16:27,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:27,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2023-02-15 14:16:27,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2023-02-15 14:16:27,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:27,896 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2023-02-15 14:16:27,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2023-02-15 14:16:27,900 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:27,900 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:27,966 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:27,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:27,970 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:27,970 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:27,970 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:27,970 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:27,970 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:27,970 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:27,970 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:27,970 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:27,970 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration3_Loop [2023-02-15 14:16:27,970 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:27,970 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:27,971 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,979 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,986 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:27,989 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,037 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:28,038 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:28,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,039 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2023-02-15 14:16:28,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2023-02-15 14:16:28,044 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 [2023-02-15 14:16:28,051 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:28,051 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:28,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:28,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:28,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:28,052 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:28,053 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:28,069 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:28,073 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,075 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2023-02-15 14:16:28,086 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 [2023-02-15 14:16:28,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2023-02-15 14:16:28,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:28,093 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:28,093 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:28,093 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:28,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:28,094 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:28,094 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:28,097 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:28,098 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2023-02-15 14:16:28,098 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:16:28,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,100 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2023-02-15 14:16:28,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2023-02-15 14:16:28,103 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:28,103 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:28,103 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:28,104 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-15 14:16:28,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,113 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:28,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,160 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 [2023-02-15 14:16:28,161 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2023-02-15 14:16:28,186 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 40 transitions. cyclomatic complexity: 17. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) Result 58 states and 90 transitions. Complement of second has 7 states. [2023-02-15 14:16:28,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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) [2023-02-15 14:16:28,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 14:16:28,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 4 letters. [2023-02-15 14:16:28,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:28,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-15 14:16:28,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:28,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 8 letters. [2023-02-15 14:16:28,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:28,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 90 transitions. [2023-02-15 14:16:28,190 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-15 14:16:28,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 55 states and 85 transitions. [2023-02-15 14:16:28,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2023-02-15 14:16:28,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2023-02-15 14:16:28,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2023-02-15 14:16:28,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:28,192 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-02-15 14:16:28,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2023-02-15 14:16:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2023-02-15 14:16:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 1.6122448979591837) internal successors, (79), 48 states have internal predecessors, (79), 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) [2023-02-15 14:16:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2023-02-15 14:16:28,196 INFO L240 hiAutomatonCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-15 14:16:28,196 INFO L428 stractBuchiCegarLoop]: Abstraction has 49 states and 79 transitions. [2023-02-15 14:16:28,196 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2023-02-15 14:16:28,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 79 transitions. [2023-02-15 14:16:28,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2023-02-15 14:16:28,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:28,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:28,198 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2023-02-15 14:16:28,198 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:28,198 INFO L748 eck$LassoCheckResult]: Stem: 406#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 407#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 412#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 425#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 418#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 419#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-15 14:16:28,198 INFO L750 eck$LassoCheckResult]: Loop: 433#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 420#L12 assume !(main_~i~0#1 >= 10); 421#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 432#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 433#L18-1 [2023-02-15 14:16:28,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,199 INFO L85 PathProgramCache]: Analyzing trace with hash 889692526, now seen corresponding path program 1 times [2023-02-15 14:16:28,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988238872] [2023-02-15 14:16:28,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:28,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988238872] [2023-02-15 14:16:28,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988238872] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:28,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:28,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:16:28,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305446393] [2023-02-15 14:16:28,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:28,219 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:16:28,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1267246, now seen corresponding path program 1 times [2023-02-15 14:16:28,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015617999] [2023-02-15 14:16:28,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:28,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015617999] [2023-02-15 14:16:28,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015617999] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:28,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:28,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:16:28,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966281958] [2023-02-15 14:16:28,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:28,236 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:16:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:28,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:16:28,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:16:28,237 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. cyclomatic complexity: 36 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-02-15 14:16:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:28,246 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2023-02-15 14:16:28,246 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2023-02-15 14:16:28,247 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:16:28,247 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 41 states and 60 transitions. [2023-02-15 14:16:28,247 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2023-02-15 14:16:28,248 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2023-02-15 14:16:28,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 60 transitions. [2023-02-15 14:16:28,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:28,248 INFO L218 hiAutomatonCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-02-15 14:16:28,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 60 transitions. [2023-02-15 14:16:28,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2023-02-15 14:16:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 39 states have internal predecessors, (59), 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) [2023-02-15 14:16:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 59 transitions. [2023-02-15 14:16:28,251 INFO L240 hiAutomatonCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-15 14:16:28,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:16:28,252 INFO L428 stractBuchiCegarLoop]: Abstraction has 40 states and 59 transitions. [2023-02-15 14:16:28,252 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2023-02-15 14:16:28,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 59 transitions. [2023-02-15 14:16:28,253 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2023-02-15 14:16:28,253 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:28,253 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:28,253 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-15 14:16:28,254 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:28,254 INFO L748 eck$LassoCheckResult]: Stem: 509#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 510#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 514#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 521#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 519#L12-2 assume !(main_~i~0#1 <= 0); 511#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 512#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 531#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 501#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-15 14:16:28,254 INFO L750 eck$LassoCheckResult]: Loop: 502#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 517#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 530#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 528#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 502#L15-1 [2023-02-15 14:16:28,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 588716517, now seen corresponding path program 1 times [2023-02-15 14:16:28,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039587630] [2023-02-15 14:16:28,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:28,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039587630] [2023-02-15 14:16:28,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039587630] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:28,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:28,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 14:16:28,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57957350] [2023-02-15 14:16:28,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:28,284 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:16:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1709112, now seen corresponding path program 1 times [2023-02-15 14:16:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039673912] [2023-02-15 14:16:28,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:28,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039673912] [2023-02-15 14:16:28,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039673912] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:28,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:28,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 14:16:28,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515894983] [2023-02-15 14:16:28,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:28,301 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-02-15 14:16:28,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:28,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 14:16:28,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 14:16:28,302 INFO L87 Difference]: Start difference. First operand 40 states and 59 transitions. cyclomatic complexity: 24 Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-02-15 14:16:28,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:28,312 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-02-15 14:16:28,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 64 transitions. [2023-02-15 14:16:28,312 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2023-02-15 14:16:28,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 45 states and 60 transitions. [2023-02-15 14:16:28,313 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2023-02-15 14:16:28,313 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2023-02-15 14:16:28,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 60 transitions. [2023-02-15 14:16:28,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:28,314 INFO L218 hiAutomatonCegarLoop]: Abstraction has 45 states and 60 transitions. [2023-02-15 14:16:28,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 60 transitions. [2023-02-15 14:16:28,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2023-02-15 14:16:28,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 1.3846153846153846) internal successors, (54), 38 states have internal predecessors, (54), 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) [2023-02-15 14:16:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2023-02-15 14:16:28,316 INFO L240 hiAutomatonCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-15 14:16:28,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 14:16:28,317 INFO L428 stractBuchiCegarLoop]: Abstraction has 39 states and 54 transitions. [2023-02-15 14:16:28,317 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2023-02-15 14:16:28,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 54 transitions. [2023-02-15 14:16:28,318 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 9 [2023-02-15 14:16:28,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:28,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:28,318 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:16:28,319 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:28,319 INFO L748 eck$LassoCheckResult]: Stem: 606#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 607#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 601#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 602#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 597#L12-2 assume !(main_~i~0#1 <= 0); 598#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 608#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 623#L12 assume !(main_~i~0#1 >= 10); 618#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-15 14:16:28,319 INFO L750 eck$LassoCheckResult]: Loop: 614#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 615#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 620#L12 assume !(main_~i~0#1 >= 10); 619#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 614#L15-1 [2023-02-15 14:16:28,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,319 INFO L85 PathProgramCache]: Analyzing trace with hash 588716579, now seen corresponding path program 1 times [2023-02-15 14:16:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677320433] [2023-02-15 14:16:28,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,345 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:28,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677320433] [2023-02-15 14:16:28,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677320433] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:16:28,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488136118] [2023-02-15 14:16:28,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:16:28,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,348 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:16:28,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-02-15 14:16:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 14:16:28,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:16:28,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488136118] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:16:28,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:16:28,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-02-15 14:16:28,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155487854] [2023-02-15 14:16:28,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:16:28,412 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:16:28,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1709174, now seen corresponding path program 2 times [2023-02-15 14:16:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112547733] [2023-02-15 14:16:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:28,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:28,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:28,419 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:28,457 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:28,458 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:28,458 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:28,458 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:28,458 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:28,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:28,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:28,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-15 14:16:28,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:28,458 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:28,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,462 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,467 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,530 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:28,530 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:28,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,555 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2023-02-15 14:16:28,582 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:28,582 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:28,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2023-02-15 14:16:28,609 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:28,609 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:28,616 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,618 INFO L229 MonitoredProcess]: Starting monitored process 26 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) [2023-02-15 14:16:28,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2023-02-15 14:16:28,622 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:28,622 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:28,650 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:28,650 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=1} Honda state: {ULTIMATE.start_main_~up~0#1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:28,653 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2023-02-15 14:16:28,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,655 INFO L229 MonitoredProcess]: Starting monitored process 27 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) [2023-02-15 14:16:28,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2023-02-15 14:16:28,658 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:28,658 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:28,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Ended with exit code 0 [2023-02-15 14:16:28,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,670 INFO L229 MonitoredProcess]: Starting monitored process 28 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) [2023-02-15 14:16:28,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2023-02-15 14:16:28,673 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:28,673 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:28,748 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:28,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,755 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:28,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:28,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:28,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:28,755 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:28,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:28,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:28,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration6_Loop [2023-02-15 14:16:28,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:28,756 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:28,757 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,762 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,768 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,771 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:28,818 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:28,818 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:28,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,819 INFO L229 MonitoredProcess]: Starting monitored process 29 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) [2023-02-15 14:16:28,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2023-02-15 14:16:28,830 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 [2023-02-15 14:16:28,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:28,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:28,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:28,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:28,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:28,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:28,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:28,855 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:28,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,860 INFO L229 MonitoredProcess]: Starting monitored process 30 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) [2023-02-15 14:16:28,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2023-02-15 14:16:28,864 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 [2023-02-15 14:16:28,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:28,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:28,873 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:28,873 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:28,873 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:28,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:28,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:28,883 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:28,886 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:28,887 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:16:28,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:28,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:28,891 INFO L229 MonitoredProcess]: Starting monitored process 31 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) [2023-02-15 14:16:28,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2023-02-15 14:16:28,916 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:28,916 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:28,916 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:28,916 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-15 14:16:28,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:28,920 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:28,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:28,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:28,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:28,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:28,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:28,980 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 [2023-02-15 14:16:28,980 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20 Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2023-02-15 14:16:29,012 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 54 transitions. cyclomatic complexity: 20. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) Result 101 states and 136 transitions. Complement of second has 7 states. [2023-02-15 14:16:29,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:29,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 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) [2023-02-15 14:16:29,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-15 14:16:29,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 4 letters. [2023-02-15 14:16:29,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 13 letters. Loop has 4 letters. [2023-02-15 14:16:29,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 9 letters. Loop has 8 letters. [2023-02-15 14:16:29,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,015 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 101 states and 136 transitions. [2023-02-15 14:16:29,016 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 19 [2023-02-15 14:16:29,017 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 101 states to 91 states and 122 transitions. [2023-02-15 14:16:29,017 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 39 [2023-02-15 14:16:29,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2023-02-15 14:16:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 122 transitions. [2023-02-15 14:16:29,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:29,017 INFO L218 hiAutomatonCegarLoop]: Abstraction has 91 states and 122 transitions. [2023-02-15 14:16:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 122 transitions. [2023-02-15 14:16:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2023-02-15 14:16:29,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 78 states have (on average 1.3974358974358974) internal successors, (109), 77 states have internal predecessors, (109), 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) [2023-02-15 14:16:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2023-02-15 14:16:29,022 INFO L240 hiAutomatonCegarLoop]: Abstraction has 78 states and 109 transitions. [2023-02-15 14:16:29,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:29,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 14:16:29,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-02-15 14:16:29,023 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:29,053 INFO L93 Difference]: Finished difference Result 139 states and 174 transitions. [2023-02-15 14:16:29,053 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 139 states and 174 transitions. [2023-02-15 14:16:29,054 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 30 [2023-02-15 14:16:29,055 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 139 states to 108 states and 137 transitions. [2023-02-15 14:16:29,055 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 56 [2023-02-15 14:16:29,055 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 56 [2023-02-15 14:16:29,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 108 states and 137 transitions. [2023-02-15 14:16:29,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:29,056 INFO L218 hiAutomatonCegarLoop]: Abstraction has 108 states and 137 transitions. [2023-02-15 14:16:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states and 137 transitions. [2023-02-15 14:16:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 86. [2023-02-15 14:16:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.2906976744186047) internal successors, (111), 85 states have internal predecessors, (111), 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) [2023-02-15 14:16:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2023-02-15 14:16:29,060 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-15 14:16:29,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 14:16:29,061 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 111 transitions. [2023-02-15 14:16:29,061 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2023-02-15 14:16:29,062 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 111 transitions. [2023-02-15 14:16:29,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:16:29,062 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:29,062 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:29,063 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2023-02-15 14:16:29,063 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:29,063 INFO L748 eck$LassoCheckResult]: Stem: 1075#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1076#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1079#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1088#L12 assume !(main_~i~0#1 >= 10); 1098#L12-2 assume !(main_~i~0#1 <= 0); 1097#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1095#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1092#L12 assume !(main_~i~0#1 >= 10); 1091#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1090#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-15 14:16:29,063 INFO L750 eck$LassoCheckResult]: Loop: 1070#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1071#L12 assume !(main_~i~0#1 >= 10); 1120#L12-2 assume !(main_~i~0#1 <= 0); 1081#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1070#L18-1 [2023-02-15 14:16:29,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1449615143, now seen corresponding path program 1 times [2023-02-15 14:16:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:29,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957054712] [2023-02-15 14:16:29,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:29,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:29,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,069 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,072 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:29,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1267306, now seen corresponding path program 2 times [2023-02-15 14:16:29,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:29,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803418782] [2023-02-15 14:16:29,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:29,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,076 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:29,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,078 INFO L85 PathProgramCache]: Analyzing trace with hash -130036926, now seen corresponding path program 2 times [2023-02-15 14:16:29,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:29,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247394672] [2023-02-15 14:16:29,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:29,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,083 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,087 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:29,110 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:29,110 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:29,111 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:29,111 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:29,111 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:29,111 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,111 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:29,111 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:29,111 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-15 14:16:29,111 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:29,111 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:29,112 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,118 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,120 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,122 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,155 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:29,155 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:29,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,157 INFO L229 MonitoredProcess]: Starting monitored process 32 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) [2023-02-15 14:16:29,165 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:29,165 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2023-02-15 14:16:29,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,187 INFO L229 MonitoredProcess]: Starting monitored process 33 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) [2023-02-15 14:16:29,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Waiting until timeout for monitored process [2023-02-15 14:16:29,195 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:29,195 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,201 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,213 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,221 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:29,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (33)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,226 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:29,226 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:29,226 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:29,226 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:29,226 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:29,226 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,226 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:29,226 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:29,226 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration7_Loop [2023-02-15 14:16:29,226 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:29,226 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:29,227 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,233 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,237 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,239 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,275 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:29,275 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:29,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,277 INFO L229 MonitoredProcess]: Starting monitored process 34 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) [2023-02-15 14:16:29,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Waiting until timeout for monitored process [2023-02-15 14:16:29,281 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 [2023-02-15 14:16:29,289 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:29,289 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:29,289 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:29,289 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:29,290 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:29,291 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:29,291 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:29,299 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:29,306 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:29,307 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2023-02-15 14:16:29,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,308 INFO L229 MonitoredProcess]: Starting monitored process 35 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) [2023-02-15 14:16:29,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Waiting until timeout for monitored process [2023-02-15 14:16:29,311 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:29,311 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:29,311 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:29,311 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = -2*ULTIMATE.start_main_~i~0#1 + 19 Supporting invariants [] [2023-02-15 14:16:29,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (34)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,318 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:29,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:29,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:29,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:29,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:29,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:29,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:29,374 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 [2023-02-15 14:16:29,374 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-15 14:16:29,390 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 111 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) Result 115 states and 145 transitions. Complement of second has 7 states. [2023-02-15 14:16:29,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:29,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2023-02-15 14:16:29,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 14:16:29,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 4 letters. [2023-02-15 14:16:29,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 14 letters. Loop has 4 letters. [2023-02-15 14:16:29,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 10 letters. Loop has 8 letters. [2023-02-15 14:16:29,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 115 states and 145 transitions. [2023-02-15 14:16:29,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:16:29,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 115 states to 97 states and 125 transitions. [2023-02-15 14:16:29,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2023-02-15 14:16:29,395 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 45 [2023-02-15 14:16:29,395 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 125 transitions. [2023-02-15 14:16:29,395 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:29,395 INFO L218 hiAutomatonCegarLoop]: Abstraction has 97 states and 125 transitions. [2023-02-15 14:16:29,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 125 transitions. [2023-02-15 14:16:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2023-02-15 14:16:29,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 86 states have (on average 1.302325581395349) internal successors, (112), 85 states have internal predecessors, (112), 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) [2023-02-15 14:16:29,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 112 transitions. [2023-02-15 14:16:29,399 INFO L240 hiAutomatonCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-15 14:16:29,399 INFO L428 stractBuchiCegarLoop]: Abstraction has 86 states and 112 transitions. [2023-02-15 14:16:29,399 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2023-02-15 14:16:29,399 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 86 states and 112 transitions. [2023-02-15 14:16:29,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:16:29,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:29,400 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:29,401 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 14:16:29,401 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:29,401 INFO L748 eck$LassoCheckResult]: Stem: 1341#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1342#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1347#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1370#L12 assume !(main_~i~0#1 >= 10); 1368#L12-2 assume !(main_~i~0#1 <= 0); 1367#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1365#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1362#L12 assume !(main_~i~0#1 >= 10); 1361#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1348#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1336#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1338#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-15 14:16:29,401 INFO L750 eck$LassoCheckResult]: Loop: 1332#L12-2 assume !(main_~i~0#1 <= 0); 1333#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1416#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1332#L12-2 [2023-02-15 14:16:29,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1510748164, now seen corresponding path program 1 times [2023-02-15 14:16:29,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:29,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159060941] [2023-02-15 14:16:29,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:29,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:29,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 14:16:29,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:29,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159060941] [2023-02-15 14:16:29,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159060941] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 14:16:29,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 14:16:29,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 14:16:29,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272514036] [2023-02-15 14:16:29,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 14:16:29,425 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:16:29,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 1 times [2023-02-15 14:16:29,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:29,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573134128] [2023-02-15 14:16:29,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:29,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:29,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:29,457 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:29,457 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:29,457 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:29,457 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:29,457 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:29,458 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,458 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:29,458 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:29,458 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-15 14:16:29,458 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:29,458 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:29,459 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,463 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,465 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,468 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,509 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:29,509 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:29,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,511 INFO L229 MonitoredProcess]: Starting monitored process 36 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) [2023-02-15 14:16:29,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Waiting until timeout for monitored process [2023-02-15 14:16:29,548 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:29,548 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,555 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:29,556 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~up~0#1=0} Honda state: {ULTIMATE.start_main_~up~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:29,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (36)] Ended with exit code 0 [2023-02-15 14:16:29,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,560 INFO L229 MonitoredProcess]: Starting monitored process 37 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) [2023-02-15 14:16:29,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Waiting until timeout for monitored process [2023-02-15 14:16:29,563 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:29,563 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,580 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:29,580 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_11=1} Honda state: {v_rep~unnamed0~0~true_11=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:29,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (37)] Ended with exit code 0 [2023-02-15 14:16:29,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,584 INFO L229 MonitoredProcess]: Starting monitored process 38 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) [2023-02-15 14:16:29,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Waiting until timeout for monitored process [2023-02-15 14:16:29,593 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:29,593 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,608 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2023-02-15 14:16:29,608 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_11=0} Honda state: {v_rep~unnamed0~0~false_11=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2023-02-15 14:16:29,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (38)] Ended with exit code 0 [2023-02-15 14:16:29,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,616 INFO L229 MonitoredProcess]: Starting monitored process 39 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) [2023-02-15 14:16:29,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Waiting until timeout for monitored process [2023-02-15 14:16:29,619 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:29,619 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (39)] Ended with exit code 0 [2023-02-15 14:16:29,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,649 INFO L229 MonitoredProcess]: Starting monitored process 40 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) [2023-02-15 14:16:29,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Waiting until timeout for monitored process [2023-02-15 14:16:29,654 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:29,654 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:29,721 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:29,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (40)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,725 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:29,725 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:29,725 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:29,725 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:29,725 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:29,725 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,725 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:29,725 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:29,725 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration8_Loop [2023-02-15 14:16:29,726 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:29,726 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:29,726 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,737 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,740 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,746 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:29,782 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:29,782 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:29,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,784 INFO L229 MonitoredProcess]: Starting monitored process 41 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) [2023-02-15 14:16:29,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Waiting until timeout for monitored process [2023-02-15 14:16:29,787 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 [2023-02-15 14:16:29,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:29,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:29,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:29,794 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:29,794 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:29,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:29,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:29,796 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:29,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (41)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,800 INFO L229 MonitoredProcess]: Starting monitored process 42 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) [2023-02-15 14:16:29,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Waiting until timeout for monitored process [2023-02-15 14:16:29,803 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 [2023-02-15 14:16:29,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:29,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:29,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:29,809 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:29,811 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2023-02-15 14:16:29,811 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2023-02-15 14:16:29,839 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2023-02-15 14:16:29,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (42)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,844 INFO L229 MonitoredProcess]: Starting monitored process 43 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) [2023-02-15 14:16:29,849 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 [2023-02-15 14:16:29,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:29,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:29,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:29,857 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:29,857 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:29,858 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:29,858 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:29,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Waiting until timeout for monitored process [2023-02-15 14:16:29,876 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:29,879 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:29,879 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:16:29,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:29,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:29,881 INFO L229 MonitoredProcess]: Starting monitored process 44 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) [2023-02-15 14:16:29,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:29,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:29,890 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:29,890 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-15 14:16:29,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Waiting until timeout for monitored process [2023-02-15 14:16:29,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (43)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:29,899 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:29,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:29,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:29,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:29,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:29,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:29,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:29,962 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 [2023-02-15 14:16:29,962 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32 Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-02-15 14:16:29,990 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 86 states and 112 transitions. cyclomatic complexity: 32. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 188 states and 256 transitions. Complement of second has 7 states. [2023-02-15 14:16:29,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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) [2023-02-15 14:16:29,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 14:16:29,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 4 letters. [2023-02-15 14:16:29,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 16 letters. Loop has 4 letters. [2023-02-15 14:16:29,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 12 letters. Loop has 8 letters. [2023-02-15 14:16:29,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:29,993 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 188 states and 256 transitions. [2023-02-15 14:16:29,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:16:29,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 188 states to 140 states and 182 transitions. [2023-02-15 14:16:29,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 45 [2023-02-15 14:16:30,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2023-02-15 14:16:30,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 140 states and 182 transitions. [2023-02-15 14:16:30,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:30,000 INFO L218 hiAutomatonCegarLoop]: Abstraction has 140 states and 182 transitions. [2023-02-15 14:16:30,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states and 182 transitions. [2023-02-15 14:16:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 94. [2023-02-15 14:16:30,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.3191489361702127) internal successors, (124), 93 states have internal predecessors, (124), 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) [2023-02-15 14:16:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 124 transitions. [2023-02-15 14:16:30,019 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 124 transitions. [2023-02-15 14:16:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 14:16:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 14:16:30,020 INFO L87 Difference]: Start difference. First operand 94 states and 124 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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) [2023-02-15 14:16:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:30,036 INFO L93 Difference]: Finished difference Result 105 states and 132 transitions. [2023-02-15 14:16:30,036 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 105 states and 132 transitions. [2023-02-15 14:16:30,037 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 26 [2023-02-15 14:16:30,038 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 105 states to 103 states and 130 transitions. [2023-02-15 14:16:30,038 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 43 [2023-02-15 14:16:30,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 43 [2023-02-15 14:16:30,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 130 transitions. [2023-02-15 14:16:30,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:30,038 INFO L218 hiAutomatonCegarLoop]: Abstraction has 103 states and 130 transitions. [2023-02-15 14:16:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 130 transitions. [2023-02-15 14:16:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2023-02-15 14:16:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 94 states have (on average 1.2872340425531914) internal successors, (121), 93 states have internal predecessors, (121), 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) [2023-02-15 14:16:30,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2023-02-15 14:16:30,049 INFO L240 hiAutomatonCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-15 14:16:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 14:16:30,050 INFO L428 stractBuchiCegarLoop]: Abstraction has 94 states and 121 transitions. [2023-02-15 14:16:30,050 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2023-02-15 14:16:30,050 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 94 states and 121 transitions. [2023-02-15 14:16:30,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 25 [2023-02-15 14:16:30,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:30,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:30,052 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 5, 5, 4, 2, 2, 1, 1, 1] [2023-02-15 14:16:30,052 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2023-02-15 14:16:30,053 INFO L748 eck$LassoCheckResult]: Stem: 1885#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 1886#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 1890#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1899#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1900#L12-2 assume !(main_~i~0#1 <= 0); 1921#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1920#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1919#L12 assume !(main_~i~0#1 >= 10); 1918#L12-2 assume !(main_~i~0#1 <= 0); 1917#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1916#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1915#L12 assume !(main_~i~0#1 >= 10); 1914#L12-2 assume !(main_~i~0#1 <= 0); 1913#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1912#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1911#L12 assume !(main_~i~0#1 >= 10); 1907#L12-2 assume !(main_~i~0#1 <= 0); 1910#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1909#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1906#L12 assume !(main_~i~0#1 >= 10); 1905#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 1904#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1892#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1883#L12 assume !(main_~i~0#1 >= 10); 1962#L12-2 assume !(main_~i~0#1 <= 0); 1889#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 1882#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1884#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-15 14:16:30,053 INFO L750 eck$LassoCheckResult]: Loop: 1876#L12-2 assume !(main_~i~0#1 <= 0); 1877#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 1896#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 1956#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 1876#L12-2 [2023-02-15 14:16:30,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1054469156, now seen corresponding path program 2 times [2023-02-15 14:16:30,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:30,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453787012] [2023-02-15 14:16:30,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:30,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:30,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 14:16:30,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453787012] [2023-02-15 14:16:30,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453787012] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:16:30,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410233697] [2023-02-15 14:16:30,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 14:16:30,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:16:30,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:30,153 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:16:30,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2023-02-15 14:16:30,192 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 14:16:30,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:16:30,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,224 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 14:16:30,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:16:30,286 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 41 proven. 28 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-15 14:16:30,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410233697] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:16:30,287 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:16:30,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2023-02-15 14:16:30,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569562909] [2023-02-15 14:16:30,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:16:30,287 INFO L753 eck$LassoCheckResult]: stem already infeasible [2023-02-15 14:16:30,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1606186, now seen corresponding path program 2 times [2023-02-15 14:16:30,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:30,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393749230] [2023-02-15 14:16:30,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:30,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,299 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:30,328 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:30,328 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:30,328 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:30,328 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:30,329 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2023-02-15 14:16:30,329 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,329 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:30,329 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:30,329 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-15 14:16:30,329 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:30,329 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:30,330 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,335 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,338 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,342 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,383 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:30,383 INFO L404 LassoAnalysis]: Checking for nontermination... [2023-02-15 14:16:30,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:30,386 INFO L229 MonitoredProcess]: Starting monitored process 46 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) [2023-02-15 14:16:30,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Waiting until timeout for monitored process [2023-02-15 14:16:30,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2023-02-15 14:16:30,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:30,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (46)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:30,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:30,401 INFO L229 MonitoredProcess]: Starting monitored process 47 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) [2023-02-15 14:16:30,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Waiting until timeout for monitored process [2023-02-15 14:16:30,404 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2023-02-15 14:16:30,404 INFO L160 nArgumentSynthesizer]: Using integer mode. [2023-02-15 14:16:30,469 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2023-02-15 14:16:30,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (47)] Ended with exit code 0 [2023-02-15 14:16:30,472 INFO L210 LassoAnalysis]: Preferences: [2023-02-15 14:16:30,472 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2023-02-15 14:16:30,472 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2023-02-15 14:16:30,472 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2023-02-15 14:16:30,472 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2023-02-15 14:16:30,472 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,472 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2023-02-15 14:16:30,472 INFO L132 ssoRankerPreferences]: Path of dumped script: [2023-02-15 14:16:30,472 INFO L133 ssoRankerPreferences]: Filename of dumped script: UpAndDownIneq.c_Iteration9_Loop [2023-02-15 14:16:30,472 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2023-02-15 14:16:30,472 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2023-02-15 14:16:30,473 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,478 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,488 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,490 INFO L117 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2023-02-15 14:16:30,531 INFO L294 LassoAnalysis]: Preprocessing complete. [2023-02-15 14:16:30,531 INFO L490 LassoAnalysis]: Using template 'affine'. [2023-02-15 14:16:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:30,532 INFO L229 MonitoredProcess]: Starting monitored process 48 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) [2023-02-15 14:16:30,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Waiting until timeout for monitored process [2023-02-15 14:16:30,544 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 [2023-02-15 14:16:30,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2023-02-15 14:16:30,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2023-02-15 14:16:30,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2023-02-15 14:16:30,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2023-02-15 14:16:30,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2023-02-15 14:16:30,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2023-02-15 14:16:30,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2023-02-15 14:16:30,555 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2023-02-15 14:16:30,558 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2023-02-15 14:16:30,558 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2023-02-15 14:16:30,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-02-15 14:16:30,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:30,560 INFO L229 MonitoredProcess]: Starting monitored process 49 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) [2023-02-15 14:16:30,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Waiting until timeout for monitored process [2023-02-15 14:16:30,564 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2023-02-15 14:16:30,564 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2023-02-15 14:16:30,565 INFO L513 LassoAnalysis]: Proved termination. [2023-02-15 14:16:30,565 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0#1) = 1*ULTIMATE.start_main_~i~0#1 Supporting invariants [] [2023-02-15 14:16:30,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (48)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:30,573 INFO L156 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2023-02-15 14:16:30,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,626 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,627 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:30,636 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 [2023-02-15 14:16:30,636 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,655 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 148 states and 200 transitions. Complement of second has 7 states. [2023-02-15 14:16:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:30,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2023-02-15 14:16:30,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-15 14:16:30,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:30,656 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:16:30,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (44)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:30,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (49)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:30,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (35)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:30,740 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:16:30,741 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,770 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 173 states and 212 transitions. Complement of second has 7 states. [2023-02-15 14:16:30,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:30,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2023-02-15 14:16:30,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-15 14:16:30,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:30,772 INFO L681 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2023-02-15 14:16:30,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,795 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:30,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:30,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 14:16:30,830 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2023-02-15 14:16:30,830 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,850 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 94 states and 121 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 163 states and 221 transitions. Complement of second has 8 states. [2023-02-15 14:16:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2023-02-15 14:16:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 14:16:30,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 17 transitions. [2023-02-15 14:16:30,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 4 letters. [2023-02-15 14:16:30,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:30,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 32 letters. Loop has 4 letters. [2023-02-15 14:16:30,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:30,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 17 transitions. Stem has 28 letters. Loop has 8 letters. [2023-02-15 14:16:30,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2023-02-15 14:16:30,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 163 states and 221 transitions. [2023-02-15 14:16:30,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 28 [2023-02-15 14:16:30,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 163 states to 115 states and 147 transitions. [2023-02-15 14:16:30,858 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2023-02-15 14:16:30,858 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2023-02-15 14:16:30,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 115 states and 147 transitions. [2023-02-15 14:16:30,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:30,859 INFO L218 hiAutomatonCegarLoop]: Abstraction has 115 states and 147 transitions. [2023-02-15 14:16:30,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states and 147 transitions. [2023-02-15 14:16:30,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 61. [2023-02-15 14:16:30,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 1.278688524590164) internal successors, (78), 60 states have internal predecessors, (78), 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) [2023-02-15 14:16:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 78 transitions. [2023-02-15 14:16:30,861 INFO L240 hiAutomatonCegarLoop]: Abstraction has 61 states and 78 transitions. [2023-02-15 14:16:30,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:30,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 14:16:30,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 14:16:30,862 INFO L87 Difference]: Start difference. First operand 61 states and 78 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 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) [2023-02-15 14:16:30,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:30,942 INFO L93 Difference]: Finished difference Result 195 states and 238 transitions. [2023-02-15 14:16:30,942 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 238 transitions. [2023-02-15 14:16:30,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 82 [2023-02-15 14:16:30,945 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 182 states and 225 transitions. [2023-02-15 14:16:30,945 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 60 [2023-02-15 14:16:30,945 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 96 [2023-02-15 14:16:30,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 225 transitions. [2023-02-15 14:16:30,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:30,946 INFO L218 hiAutomatonCegarLoop]: Abstraction has 182 states and 225 transitions. [2023-02-15 14:16:30,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 225 transitions. [2023-02-15 14:16:30,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 168. [2023-02-15 14:16:30,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.255952380952381) internal successors, (211), 167 states have internal predecessors, (211), 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) [2023-02-15 14:16:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 211 transitions. [2023-02-15 14:16:30,949 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-15 14:16:30,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 14:16:30,950 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 211 transitions. [2023-02-15 14:16:30,950 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2023-02-15 14:16:30,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 211 transitions. [2023-02-15 14:16:30,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-15 14:16:30,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:30,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:30,952 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [3, 2, 2, 1, 1, 1, 1] [2023-02-15 14:16:30,952 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-15 14:16:30,952 INFO L748 eck$LassoCheckResult]: Stem: 3216#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 3217#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 3220#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3224#L12 assume !(main_~i~0#1 >= 10); 3229#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3227#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3213#L12 assume !(main_~i~0#1 >= 10); 3320#L12-2 assume !(main_~i~0#1 <= 0); 3321#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3316#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-15 14:16:30,953 INFO L750 eck$LassoCheckResult]: Loop: 3274#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 3273#L12-2 assume !(main_~i~0#1 <= 0); 3211#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3214#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3215#L12 assume !(main_~i~0#1 >= 10); 3223#L12-2 assume !(main_~i~0#1 <= 0); 3315#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3314#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3313#L12 assume !(main_~i~0#1 >= 10); 3312#L12-2 assume !(main_~i~0#1 <= 0); 3311#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3310#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3309#L12 assume !(main_~i~0#1 >= 10); 3308#L12-2 assume !(main_~i~0#1 <= 0); 3307#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3306#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3305#L12 assume !(main_~i~0#1 >= 10); 3304#L12-2 assume !(main_~i~0#1 <= 0); 3303#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3302#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3301#L12 assume !(main_~i~0#1 >= 10); 3300#L12-2 assume !(main_~i~0#1 <= 0); 3299#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3298#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3297#L12 assume !(main_~i~0#1 >= 10); 3296#L12-2 assume !(main_~i~0#1 <= 0); 3295#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3294#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3293#L12 assume !(main_~i~0#1 >= 10); 3292#L12-2 assume !(main_~i~0#1 <= 0); 3291#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3290#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3289#L12 assume !(main_~i~0#1 >= 10); 3288#L12-2 assume !(main_~i~0#1 <= 0); 3287#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3286#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3285#L12 assume !(main_~i~0#1 >= 10); 3282#L12-2 assume !(main_~i~0#1 <= 0); 3284#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 3283#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3281#L12 assume !(main_~i~0#1 >= 10); 3278#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 3276#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3277#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3279#L12 assume !(main_~i~0#1 >= 10); 3280#L12-2 assume !(main_~i~0#1 <= 0); 3375#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3374#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3347#L12 assume !(main_~i~0#1 >= 10); 3208#L12-2 assume !(main_~i~0#1 <= 0); 3209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3226#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3348#L12 assume !(main_~i~0#1 >= 10); 3373#L12-2 assume !(main_~i~0#1 <= 0); 3372#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3371#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3370#L12 assume !(main_~i~0#1 >= 10); 3369#L12-2 assume !(main_~i~0#1 <= 0); 3368#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3367#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3366#L12 assume !(main_~i~0#1 >= 10); 3365#L12-2 assume !(main_~i~0#1 <= 0); 3364#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3363#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3362#L12 assume !(main_~i~0#1 >= 10); 3361#L12-2 assume !(main_~i~0#1 <= 0); 3360#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3359#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3358#L12 assume !(main_~i~0#1 >= 10); 3357#L12-2 assume !(main_~i~0#1 <= 0); 3356#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3355#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3354#L12 assume !(main_~i~0#1 >= 10); 3353#L12-2 assume !(main_~i~0#1 <= 0); 3352#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3351#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3350#L12 assume !(main_~i~0#1 >= 10); 3222#L12-2 assume !(main_~i~0#1 <= 0); 3349#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 3275#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 3274#L12 [2023-02-15 14:16:30,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,953 INFO L85 PathProgramCache]: Analyzing trace with hash 474307092, now seen corresponding path program 1 times [2023-02-15 14:16:30,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:30,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640359196] [2023-02-15 14:16:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,957 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 1 times [2023-02-15 14:16:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:30,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920245934] [2023-02-15 14:16:30,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:30,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,971 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:30,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:30,981 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:30,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:30,982 INFO L85 PathProgramCache]: Analyzing trace with hash -68907892, now seen corresponding path program 3 times [2023-02-15 14:16:30,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:30,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548031219] [2023-02-15 14:16:30,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:30,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:31,069 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:31,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:31,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548031219] [2023-02-15 14:16:31,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548031219] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:16:31,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540822961] [2023-02-15 14:16:31,070 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 14:16:31,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:16:31,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:31,071 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:16:31,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2023-02-15 14:16:31,112 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 14:16:31,112 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:16:31,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 14:16:31,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:31,130 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:31,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:16:31,160 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 202 proven. 3 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:31,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540822961] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:16:31,160 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:16:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-02-15 14:16:31,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964642124] [2023-02-15 14:16:31,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:16:31,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:31,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 14:16:31,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2023-02-15 14:16:31,636 INFO L87 Difference]: Start difference. First operand 168 states and 211 transitions. cyclomatic complexity: 46 Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 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) [2023-02-15 14:16:31,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:31,674 INFO L93 Difference]: Finished difference Result 179 states and 197 transitions. [2023-02-15 14:16:31,674 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 179 states and 197 transitions. [2023-02-15 14:16:31,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-15 14:16:31,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 179 states to 175 states and 193 transitions. [2023-02-15 14:16:31,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 85 [2023-02-15 14:16:31,676 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 85 [2023-02-15 14:16:31,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 193 transitions. [2023-02-15 14:16:31,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:31,677 INFO L218 hiAutomatonCegarLoop]: Abstraction has 175 states and 193 transitions. [2023-02-15 14:16:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 193 transitions. [2023-02-15 14:16:31,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 168. [2023-02-15 14:16:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 168 states have (on average 1.1011904761904763) internal successors, (185), 167 states have internal predecessors, (185), 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) [2023-02-15 14:16:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 185 transitions. [2023-02-15 14:16:31,679 INFO L240 hiAutomatonCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-15 14:16:31,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 14:16:31,680 INFO L428 stractBuchiCegarLoop]: Abstraction has 168 states and 185 transitions. [2023-02-15 14:16:31,680 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2023-02-15 14:16:31,680 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 168 states and 185 transitions. [2023-02-15 14:16:31,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-15 14:16:31,681 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:31,681 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:31,682 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [7, 6, 6, 5, 1, 1, 1] [2023-02-15 14:16:31,682 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-15 14:16:31,682 INFO L748 eck$LassoCheckResult]: Stem: 4116#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 4117#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 4121#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4133#L12 assume !(main_~i~0#1 >= 10); 4129#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4126#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4127#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4262#L12 assume !(main_~i~0#1 >= 10); 4261#L12-2 assume !(main_~i~0#1 <= 0); 4124#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4125#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4260#L12 assume !(main_~i~0#1 >= 10); 4258#L12-2 assume !(main_~i~0#1 <= 0); 4259#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4253#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4122#L12 assume !(main_~i~0#1 >= 10); 4108#L12-2 assume !(main_~i~0#1 <= 0); 4109#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4257#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4256#L12 assume !(main_~i~0#1 >= 10); 4255#L12-2 assume !(main_~i~0#1 <= 0); 4254#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4112#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4113#L12 assume !(main_~i~0#1 >= 10); 4275#L12-2 assume !(main_~i~0#1 <= 0); 4274#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4263#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-15 14:16:31,683 INFO L750 eck$LassoCheckResult]: Loop: 4176#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 4175#L12-2 assume !(main_~i~0#1 <= 0); 4120#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4114#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4115#L12 assume !(main_~i~0#1 >= 10); 4110#L12-2 assume !(main_~i~0#1 <= 0); 4111#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4252#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4251#L12 assume !(main_~i~0#1 >= 10); 4250#L12-2 assume !(main_~i~0#1 <= 0); 4249#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4248#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4247#L12 assume !(main_~i~0#1 >= 10); 4246#L12-2 assume !(main_~i~0#1 <= 0); 4245#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4244#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4243#L12 assume !(main_~i~0#1 >= 10); 4242#L12-2 assume !(main_~i~0#1 <= 0); 4241#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4240#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4239#L12 assume !(main_~i~0#1 >= 10); 4238#L12-2 assume !(main_~i~0#1 <= 0); 4237#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4236#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4235#L12 assume !(main_~i~0#1 >= 10); 4234#L12-2 assume !(main_~i~0#1 <= 0); 4233#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4232#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4231#L12 assume !(main_~i~0#1 >= 10); 4230#L12-2 assume !(main_~i~0#1 <= 0); 4229#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4228#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4227#L12 assume !(main_~i~0#1 >= 10); 4226#L12-2 assume !(main_~i~0#1 <= 0); 4225#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4224#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4223#L12 assume !(main_~i~0#1 >= 10); 4220#L12-2 assume !(main_~i~0#1 <= 0); 4222#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 4221#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4219#L12 assume !(main_~i~0#1 >= 10); 4218#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 4215#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4217#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4216#L12 assume !(main_~i~0#1 >= 10); 4214#L12-2 assume !(main_~i~0#1 <= 0); 4213#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4212#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4211#L12 assume !(main_~i~0#1 >= 10); 4210#L12-2 assume !(main_~i~0#1 <= 0); 4209#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4207#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4205#L12 assume !(main_~i~0#1 >= 10); 4203#L12-2 assume !(main_~i~0#1 <= 0); 4201#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4199#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4197#L12 assume !(main_~i~0#1 >= 10); 4195#L12-2 assume !(main_~i~0#1 <= 0); 4193#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4191#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4189#L12 assume !(main_~i~0#1 >= 10); 4187#L12-2 assume !(main_~i~0#1 <= 0); 4186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4178#L12 assume !(main_~i~0#1 >= 10); 4188#L12-2 assume !(main_~i~0#1 <= 0); 4208#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4206#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4204#L12 assume !(main_~i~0#1 >= 10); 4202#L12-2 assume !(main_~i~0#1 <= 0); 4200#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4198#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4196#L12 assume !(main_~i~0#1 >= 10); 4194#L12-2 assume !(main_~i~0#1 <= 0); 4192#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4190#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4183#L12 assume !(main_~i~0#1 >= 10); 4184#L12-2 assume !(main_~i~0#1 <= 0); 4264#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 4185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 4176#L12 [2023-02-15 14:16:31,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:31,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1514411024, now seen corresponding path program 2 times [2023-02-15 14:16:31,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:31,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766740338] [2023-02-15 14:16:31,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:31,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:31,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:31,689 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:31,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:31,692 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:31,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:31,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1617023097, now seen corresponding path program 2 times [2023-02-15 14:16:31,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:31,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235861171] [2023-02-15 14:16:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:31,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:31,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:31,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:31,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:31,713 INFO L85 PathProgramCache]: Analyzing trace with hash -883489176, now seen corresponding path program 4 times [2023-02-15 14:16:31,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:31,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305608054] [2023-02-15 14:16:31,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:31,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 14:16:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:31,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 14:16:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305608054] [2023-02-15 14:16:31,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305608054] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 14:16:31,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980270137] [2023-02-15 14:16:31,880 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 14:16:31,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 14:16:31,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 14:16:31,881 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 14:16:31,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2023-02-15 14:16:31,924 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 14:16:31,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 14:16:31,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 14:16:31,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 14:16:31,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:31,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 14:16:32,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 530 proven. 55 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2023-02-15 14:16:32,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980270137] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 14:16:32,042 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 14:16:32,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2023-02-15 14:16:32,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811078324] [2023-02-15 14:16:32,042 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 14:16:32,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 14:16:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 14:16:32,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2023-02-15 14:16:32,535 INFO L87 Difference]: Start difference. First operand 168 states and 185 transitions. cyclomatic complexity: 21 Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 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) [2023-02-15 14:16:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 14:16:32,620 INFO L93 Difference]: Finished difference Result 214 states and 229 transitions. [2023-02-15 14:16:32,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 229 transitions. [2023-02-15 14:16:32,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-15 14:16:32,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 208 states and 223 transitions. [2023-02-15 14:16:32,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2023-02-15 14:16:32,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2023-02-15 14:16:32,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 223 transitions. [2023-02-15 14:16:32,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2023-02-15 14:16:32,623 INFO L218 hiAutomatonCegarLoop]: Abstraction has 208 states and 223 transitions. [2023-02-15 14:16:32,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 223 transitions. [2023-02-15 14:16:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 167. [2023-02-15 14:16:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 167 states have (on average 1.089820359281437) internal successors, (182), 166 states have internal predecessors, (182), 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) [2023-02-15 14:16:32,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 182 transitions. [2023-02-15 14:16:32,626 INFO L240 hiAutomatonCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-15 14:16:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 14:16:32,626 INFO L428 stractBuchiCegarLoop]: Abstraction has 167 states and 182 transitions. [2023-02-15 14:16:32,626 INFO L335 stractBuchiCegarLoop]: ======== Iteration 12 ============ [2023-02-15 14:16:32,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 182 transitions. [2023-02-15 14:16:32,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 81 [2023-02-15 14:16:32,627 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-02-15 14:16:32,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-02-15 14:16:32,628 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2023-02-15 14:16:32,628 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [20, 19, 19, 10, 10, 1, 1] [2023-02-15 14:16:32,628 INFO L748 eck$LassoCheckResult]: Stem: 5151#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true; 5152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_~i~0#1, main_~up~0#1;havoc main_~i~0#1;havoc main_~up~0#1;main_~i~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~up~0#1 := 0; 5153#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5166#L12 assume !(main_~i~0#1 >= 10); 5164#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5162#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5161#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5204#L12 assume !(main_~i~0#1 >= 10); 5203#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-15 14:16:32,628 INFO L750 eck$LassoCheckResult]: Loop: 5202#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5201#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5200#L12 assume !(main_~i~0#1 >= 10); 5199#L12-2 assume !(main_~i~0#1 <= 0); 5198#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5197#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5196#L12 assume !(main_~i~0#1 >= 10); 5195#L12-2 assume !(main_~i~0#1 <= 0); 5194#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5193#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5192#L12 assume !(main_~i~0#1 >= 10); 5191#L12-2 assume !(main_~i~0#1 <= 0); 5190#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5189#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5188#L12 assume !(main_~i~0#1 >= 10); 5187#L12-2 assume !(main_~i~0#1 <= 0); 5186#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5185#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5184#L12 assume !(main_~i~0#1 >= 10); 5183#L12-2 assume !(main_~i~0#1 <= 0); 5182#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5181#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5180#L12 assume !(main_~i~0#1 >= 10); 5179#L12-2 assume !(main_~i~0#1 <= 0); 5178#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5177#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5176#L12 assume !(main_~i~0#1 >= 10); 5175#L12-2 assume !(main_~i~0#1 <= 0); 5174#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5173#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5172#L12 assume !(main_~i~0#1 >= 10); 5171#L12-2 assume !(main_~i~0#1 <= 0); 5170#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5169#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5168#L12 assume main_~i~0#1 >= 10;main_~up~0#1 := 0; 5165#L12-2 assume !(main_~i~0#1 <= 0); 5146#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5149#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5150#L12 assume !(main_~i~0#1 >= 10); 5245#L12-2 assume !(main_~i~0#1 <= 0); 5244#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5243#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5242#L12 assume !(main_~i~0#1 >= 10); 5241#L12-2 assume !(main_~i~0#1 <= 0); 5240#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5239#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5238#L12 assume !(main_~i~0#1 >= 10); 5237#L12-2 assume !(main_~i~0#1 <= 0); 5236#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5235#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5234#L12 assume !(main_~i~0#1 >= 10); 5233#L12-2 assume !(main_~i~0#1 <= 0); 5232#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5231#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5230#L12 assume !(main_~i~0#1 >= 10); 5229#L12-2 assume !(main_~i~0#1 <= 0); 5228#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5227#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5226#L12 assume !(main_~i~0#1 >= 10); 5225#L12-2 assume !(main_~i~0#1 <= 0); 5224#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5223#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5222#L12 assume !(main_~i~0#1 >= 10); 5221#L12-2 assume !(main_~i~0#1 <= 0); 5220#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5219#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5218#L12 assume !(main_~i~0#1 >= 10); 5217#L12-2 assume !(main_~i~0#1 <= 0); 5216#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5215#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5214#L12 assume !(main_~i~0#1 >= 10); 5213#L12-2 assume !(main_~i~0#1 <= 0); 5212#L15-1 assume !(main_~up~0#1 >= 1);main_~i~0#1 := main_~i~0#1 - 1; 5211#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5210#L12 assume !(main_~i~0#1 >= 10); 5208#L12-2 assume main_~i~0#1 <= 0;main_~up~0#1 := 1; 5207#L15-1 assume main_~up~0#1 >= 1;main_~i~0#1 := 1 + main_~i~0#1; 5205#L18-1 assume !!(0 <= main_~i~0#1 && main_~i~0#1 <= 10); 5206#L12 assume !(main_~i~0#1 >= 10); 5209#L12-2 assume !(main_~i~0#1 <= 0); 5202#L15-1 [2023-02-15 14:16:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:32,630 INFO L85 PathProgramCache]: Analyzing trace with hash 644068259, now seen corresponding path program 3 times [2023-02-15 14:16:32,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:32,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091980121] [2023-02-15 14:16:32,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:32,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,633 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,635 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:32,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1888138361, now seen corresponding path program 3 times [2023-02-15 14:16:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007482962] [2023-02-15 14:16:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,643 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 14:16:32,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1126640613, now seen corresponding path program 5 times [2023-02-15 14:16:32,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 14:16:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004646157] [2023-02-15 14:16:32,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 14:16:32,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 14:16:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:32,665 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-15 14:16:33,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:33,153 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 14:16:33,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 14:16:33,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.02 02:16:33 BoogieIcfgContainer [2023-02-15 14:16:33,182 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-02-15 14:16:33,182 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 14:16:33,182 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 14:16:33,183 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 14:16:33,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 02:16:25" (3/4) ... [2023-02-15 14:16:33,185 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2023-02-15 14:16:33,235 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 14:16:33,236 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 14:16:33,236 INFO L158 Benchmark]: Toolchain (without parser) took 7731.79ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 86.8MB in the beginning and 125.8MB in the end (delta: -39.0MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2023-02-15 14:16:33,236 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:16:33,237 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.44ms. Allocated memory is still 130.0MB. Free memory was 86.4MB in the beginning and 77.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 14:16:33,237 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.91ms. Allocated memory is still 130.0MB. Free memory was 77.4MB in the beginning and 76.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:16:33,237 INFO L158 Benchmark]: Boogie Preprocessor took 18.97ms. Allocated memory is still 130.0MB. Free memory was 76.0MB in the beginning and 75.3MB in the end (delta: 736.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-15 14:16:33,237 INFO L158 Benchmark]: RCFGBuilder took 237.65ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 66.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-15 14:16:33,238 INFO L158 Benchmark]: BuchiAutomizer took 7237.89ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 66.9MB in the beginning and 128.9MB in the end (delta: -62.1MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 14:16:33,238 INFO L158 Benchmark]: Witness Printer took 53.28ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 125.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-02-15 14:16:33,239 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 105.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.44ms. Allocated memory is still 130.0MB. Free memory was 86.4MB in the beginning and 77.4MB in the end (delta: 9.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.91ms. Allocated memory is still 130.0MB. Free memory was 77.4MB in the beginning and 76.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.97ms. Allocated memory is still 130.0MB. Free memory was 76.0MB in the beginning and 75.3MB in the end (delta: 736.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 237.65ms. Allocated memory is still 130.0MB. Free memory was 75.3MB in the beginning and 66.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7237.89ms. Allocated memory was 130.0MB in the beginning and 172.0MB in the end (delta: 41.9MB). Free memory was 66.9MB in the beginning and 128.9MB in the end (delta: -62.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 53.28ms. Allocated memory is still 172.0MB. Free memory was 128.9MB in the beginning and 125.8MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 15 terminating modules (8 trivial, 6 deterministic, 1 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -2 * i + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One deterministic module has affine ranking function -1 * i and consists of 4 locations. One deterministic module has affine ranking function -2 * i + 19 and consists of 4 locations. One deterministic module has affine ranking function i and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 4 locations. 8 modules have a trivial ranking function, the largest among these consists of 12 locations. The remainder module has 167 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 12 iterations. TraceHistogramMax:20. Analysis of lassos took 5.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 0. Minimization of nondet autom 15. Automata minimization 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 245 StatesRemovedByMinimization, 15 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 [6, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 172 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 164 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 538 IncrementalHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 135 mSDtfsCounter, 538 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT3 conc2 concLT1 SILN0 SILU0 SILI2 SILT3 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax165 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq143 hnf100 smp100 dnf94 smp100 tf110 neg96 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 29ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 10 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 18]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 18]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L6] int i; [L7] int up; [L8] i = __VERIFIER_nondet_int() [L9] up = 0 VAL [up=0] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=0, up=0] [L12] COND FALSE !(i >= 10) VAL [i=0, up=0] [L15] COND TRUE i <= 0 [L16] up = 1 VAL [i=0, up=1] [L18] COND TRUE up >= 1 [L19] i = i+1 VAL [i=1, up=1] [L11] COND TRUE 0 <= i && i <= 10 VAL [i=1, up=1] [L12] COND FALSE !(i >= 10) VAL [i=1, up=1] [L15] COND FALSE !(i <= 0) VAL [i=1, up=1] Loop: [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND TRUE i >= 10 [L13] up = 0 [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) [L18] COND FALSE !(up >= 1) [L21] i = i-1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND TRUE i <= 0 [L16] up = 1 [L18] COND TRUE up >= 1 [L19] i = i+1 [L11] COND TRUE 0 <= i && i <= 10 [L12] COND FALSE !(i >= 10) [L15] COND FALSE !(i <= 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-02-15 14:16:33,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2023-02-15 14:16:33,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:33,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Ended with exit code 0 [2023-02-15 14:16:33,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-02-15 14:16:34,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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)