./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2.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 0d6528b7cc69fe4ab1ae178e84639571fa28bd084493b226ea467e9ac1e22d5f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:25:08,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:25:08,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:25:08,765 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:25:08,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:25:08,768 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:25:08,769 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:25:08,771 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:25:08,773 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:25:08,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:25:08,776 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:25:08,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:25:08,778 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:25:08,779 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:25:08,780 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:25:08,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:25:08,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:25:08,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:25:08,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:25:08,790 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:25:08,790 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:25:08,791 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:25:08,792 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:25:08,793 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:25:08,798 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:25:08,798 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:25:08,798 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:25:08,800 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:25:08,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:25:08,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:25:08,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:25:08,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:25:08,803 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:25:08,803 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:25:08,804 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:25:08,805 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:25:08,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:25:08,806 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:25:08,806 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:25:08,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:25:08,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:25:08,808 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2022-02-21 03:25:08,834 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:25:08,834 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:25:08,835 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:25:08,835 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:25:08,836 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:25:08,836 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:25:08,836 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:25:08,836 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:25:08,837 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:25:08,837 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:25:08,837 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:25:08,838 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:25:08,838 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:25:08,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:25:08,838 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:25:08,838 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:25:08,838 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:25:08,839 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:25:08,840 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:25:08,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:25:08,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:25:08,841 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:25:08,841 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:25:08,842 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:25:08,842 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 -> 0d6528b7cc69fe4ab1ae178e84639571fa28bd084493b226ea467e9ac1e22d5f [2022-02-21 03:25:09,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:25:09,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:25:09,164 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:25:09,165 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:25:09,166 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:25:09,168 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2.c [2022-02-21 03:25:09,208 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fe37ac/643b2e6ca0424c21a3c3a5d88c3b4493/FLAG14785c246 [2022-02-21 03:25:09,565 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:25:09,566 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/PodelskiRybalchenko-TACAS2011-Fig2.c [2022-02-21 03:25:09,582 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fe37ac/643b2e6ca0424c21a3c3a5d88c3b4493/FLAG14785c246 [2022-02-21 03:25:09,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/872fe37ac/643b2e6ca0424c21a3c3a5d88c3b4493 [2022-02-21 03:25:09,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:25:09,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:25:09,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:09,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:25:09,964 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:25:09,965 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:09" (1/1) ... [2022-02-21 03:25:09,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132e3edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:09, skipping insertion in model container [2022-02-21 03:25:09,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:25:09" (1/1) ... [2022-02-21 03:25:09,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:25:09,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:25:10,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:10,138 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:25:10,146 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:25:10,156 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:25:10,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10 WrapperNode [2022-02-21 03:25:10,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:25:10,157 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:10,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:25:10,158 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:25:10,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,167 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,182 INFO L137 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-02-21 03:25:10,183 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:25:10,184 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:25:10,184 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:25:10,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:25:10,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,190 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,190 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,197 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,197 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:25:10,199 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:25:10,199 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:25:10,199 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:25:10,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (1/1) ... [2022-02-21 03:25:10,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,233 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) [2022-02-21 03:25:10,255 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 [2022-02-21 03:25:10,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:25:10,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:25:10,306 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:25:10,308 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:25:10,383 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:25:10,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:25:10,389 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 03:25:10,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:10 BoogieIcfgContainer [2022-02-21 03:25:10,391 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:25:10,392 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:25:10,392 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:25:10,394 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:25:10,395 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:10,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:25:09" (1/3) ... [2022-02-21 03:25:10,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dc8a3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:10, skipping insertion in model container [2022-02-21 03:25:10,396 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:10,396 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:25:10" (2/3) ... [2022-02-21 03:25:10,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4dc8a3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:25:10, skipping insertion in model container [2022-02-21 03:25:10,399 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:25:10,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:10" (3/3) ... [2022-02-21 03:25:10,400 INFO L388 chiAutomizerObserver]: Analyzing ICFG PodelskiRybalchenko-TACAS2011-Fig2.c [2022-02-21 03:25:10,447 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:25:10,447 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:25:10,447 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:25:10,447 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:25:10,447 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:25:10,447 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:25:10,448 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:25:10,448 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:25:10,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2022-02-21 03:25:10,474 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:10,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:10,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:10,477 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:10,477 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:10,477 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:25:10,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2022-02-21 03:25:10,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:10,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:10,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:10,480 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2022-02-21 03:25:10,480 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:25:10,484 INFO L791 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 5#L17-2true [2022-02-21 03:25:10,484 INFO L793 eck$LassoCheckResult]: Loop: 5#L17-2true assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; 3#L19-2true assume !(main_~y~0#1 < main_~x~0#1); 10#L19-3true main_~x~0#1 := main_~x~0#1 - 1; 5#L17-2true [2022-02-21 03:25:10,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:10,487 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-02-21 03:25:10,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:10,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527046899] [2022-02-21 03:25:10,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:10,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:10,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,549 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:10,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,569 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:10,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:10,572 INFO L85 PathProgramCache]: Analyzing trace with hash 40944, now seen corresponding path program 1 times [2022-02-21 03:25:10,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:10,574 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869324241] [2022-02-21 03:25:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,591 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:10,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,603 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:10,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:10,606 INFO L85 PathProgramCache]: Analyzing trace with hash 28699886, now seen corresponding path program 1 times [2022-02-21 03:25:10,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:10,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585193887] [2022-02-21 03:25:10,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:10,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,621 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:10,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:10,631 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:10,734 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:10,739 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:10,739 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:10,739 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:10,739 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:10,739 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,739 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:10,739 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:10,740 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration1_Loop [2022-02-21 03:25:10,740 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:10,740 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:10,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:10,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:10,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:10,854 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:10,855 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:10,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,858 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) [2022-02-21 03:25:10,862 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:10,862 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:10,874 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 [2022-02-21 03:25:10,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:10,883 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: [] [2022-02-21 03:25:10,910 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 [2022-02-21 03:25:10,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,912 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) [2022-02-21 03:25:10,913 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 [2022-02-21 03:25:10,915 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:10,915 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:10,936 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:10,937 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: [] [2022-02-21 03:25:10,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 03:25:10,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:10,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:10,966 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) [2022-02-21 03:25:10,970 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:10,970 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:10,979 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 [2022-02-21 03:25:11,006 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 [2022-02-21 03:25:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,008 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) [2022-02-21 03:25:11,036 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 [2022-02-21 03:25:11,037 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:11,037 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,073 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:11,076 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 [2022-02-21 03:25:11,076 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,076 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,076 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,076 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,076 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:11,077 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,077 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,077 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,077 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration1_Loop [2022-02-21 03:25:11,077 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,077 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,171 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:11,173 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:11,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,176 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) [2022-02-21 03:25:11,177 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 [2022-02-21 03:25:11,178 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 [2022-02-21 03:25:11,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:11,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:11,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:11,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:11,187 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:11,187 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:11,204 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:11,219 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 [2022-02-21 03:25:11,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,221 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) [2022-02-21 03:25:11,225 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 [2022-02-21 03:25:11,226 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 [2022-02-21 03:25:11,232 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:11,232 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:11,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:11,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:11,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:11,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:11,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:11,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:11,268 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:11,268 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:11,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,275 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) [2022-02-21 03:25:11,275 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 [2022-02-21 03:25:11,314 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:11,314 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:11,314 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:11,314 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0#1) = 2*ULTIMATE.start_main_~x~0#1 + 1 Supporting invariants [] [2022-02-21 03:25:11,329 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 [2022-02-21 03:25:11,337 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:11,341 INFO L390 LassoCheck]: Loop: "assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1;" "assume !(main_~y~0#1 < main_~x~0#1);" "main_~x~0#1 := main_~x~0#1 - 1;" [2022-02-21 03:25:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 4 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:11,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:11,403 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 [2022-02-21 03:25:11,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#unseeded} assume { :begin_inline_ULTIMATE.init } true; {19#unseeded} is VALID [2022-02-21 03:25:11,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {19#unseeded} is VALID [2022-02-21 03:25:11,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,414 WARN L261 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:11,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:11,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#(>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1))} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {40#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1)))} is VALID [2022-02-21 03:25:11,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1)))} assume !(main_~y~0#1 < main_~x~0#1); {40#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1)))} is VALID [2022-02-21 03:25:11,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#(and (<= 0 |ULTIMATE.start_main_~x~0#1|) (>= oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1)))} main_~x~0#1 := main_~x~0#1 - 1; {32#(or unseeded (and (> oldRank0 (+ (* 2 |ULTIMATE.start_main_~x~0#1|) 1)) (>= oldRank0 0)))} is VALID [2022-02-21 03:25:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:11,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:11,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:11,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,480 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 03:25:11,481 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:11,552 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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). Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 24 states and 36 transitions. Complement of second has 7 states. [2022-02-21 03:25:11,552 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 [2022-02-21 03:25:11,552 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,553 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2022-02-21 03:25:11,554 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,554 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,554 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:11,556 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:11,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 36 transitions. [2022-02-21 03:25:11,557 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:11,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,558 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,559 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) [2022-02-21 03:25:11,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:25:11,560 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:25:11,560 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:11,562 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:25:11,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:25:11,562 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 24 states and 36 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:11,562 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:11,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:11,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 24 letters. Loop has 24 letters. [2022-02-21 03:25:11,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:11,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:11,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 9 letters. Loop has 9 letters. [2022-02-21 03:25:11,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:11,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:11,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 5 letters. Loop has 5 letters. [2022-02-21 03:25:11,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:11,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:11,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:11,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:11,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:11,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:25:11,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:11,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 2 letters. Loop has 1 letters. [2022-02-21 03:25:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:25:11,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 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) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 24 states and 36 transitions. cyclomatic complexity: 15 Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:11,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,575 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:11,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:11,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2022-02-21 03:25:11,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 3 letters. [2022-02-21 03:25:11,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:25:11,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 2 letters. Loop has 6 letters. [2022-02-21 03:25:11,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:11,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 36 transitions. cyclomatic complexity: 15 [2022-02-21 03:25:11,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:11,585 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 8 states and 11 transitions. [2022-02-21 03:25:11,586 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:25:11,586 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2022-02-21 03:25:11,587 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2022-02-21 03:25:11,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:11,587 INFO L681 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2022-02-21 03:25:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2022-02-21 03:25:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2022-02-21 03:25:11,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:11,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) [2022-02-21 03:25:11,602 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) [2022-02-21 03:25:11,604 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) [2022-02-21 03:25:11,605 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,606 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2022-02-21 03:25:11,607 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2022-02-21 03:25:11,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) Second operand 8 states and 11 transitions. [2022-02-21 03:25:11,608 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) Second operand 8 states and 11 transitions. [2022-02-21 03:25:11,608 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:11,609 INFO L93 Difference]: Finished difference Result 9 states and 13 transitions. [2022-02-21 03:25:11,609 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 13 transitions. [2022-02-21 03:25:11,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:11,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:11,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:11,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 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) [2022-02-21 03:25:11,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2022-02-21 03:25:11,611 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2022-02-21 03:25:11,611 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2022-02-21 03:25:11,611 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:25:11,611 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2022-02-21 03:25:11,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:11,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:11,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:11,612 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-02-21 03:25:11,612 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:11,612 INFO L791 eck$LassoCheckResult]: Stem: 86#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 87#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 84#L17-2 assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; 81#L19-2 [2022-02-21 03:25:11,612 INFO L793 eck$LassoCheckResult]: Loop: 81#L19-2 assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; 81#L19-2 [2022-02-21 03:25:11,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,613 INFO L85 PathProgramCache]: Analyzing trace with hash 29864, now seen corresponding path program 1 times [2022-02-21 03:25:11,613 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,613 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100204363] [2022-02-21 03:25:11,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,617 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,619 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 1 times [2022-02-21 03:25:11,619 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,620 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693375516] [2022-02-21 03:25:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,623 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,625 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash 925804, now seen corresponding path program 1 times [2022-02-21 03:25:11,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:11,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615735059] [2022-02-21 03:25:11,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:11,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,630 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:11,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:11,633 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:11,644 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,644 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,644 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,644 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,645 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:11,645 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,645 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,645 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,645 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration2_Loop [2022-02-21 03:25:11,645 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,645 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,689 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:11,690 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,716 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) [2022-02-21 03:25:11,717 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 [2022-02-21 03:25:11,720 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,720 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,731 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,731 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: [] [2022-02-21 03:25:11,748 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 [2022-02-21 03:25:11,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,749 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) [2022-02-21 03:25:11,750 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 [2022-02-21 03:25:11,751 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:11,765 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:25:11,780 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 [2022-02-21 03:25:11,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,781 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) [2022-02-21 03:25:11,783 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 [2022-02-21 03:25:11,802 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:11,802 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,827 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 [2022-02-21 03:25:11,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:11,843 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) [2022-02-21 03:25:11,867 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 [2022-02-21 03:25:11,868 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:11,868 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:11,990 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:11,993 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 [2022-02-21 03:25:11,994 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:11,994 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:11,994 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:11,994 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:11,994 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:11,994 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:11,994 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:11,994 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:11,994 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration2_Loop [2022-02-21 03:25:11,994 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:11,994 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:11,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:11,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,044 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,045 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:12,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,068 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) [2022-02-21 03:25:12,090 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 [2022-02-21 03:25:12,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,097 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,099 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,102 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 [2022-02-21 03:25:12,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,128 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 [2022-02-21 03:25:12,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,130 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) [2022-02-21 03:25:12,131 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 [2022-02-21 03:25:12,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:25:12,137 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,140 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,140 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,152 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,167 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 [2022-02-21 03:25:12,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,169 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) [2022-02-21 03:25:12,169 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 [2022-02-21 03:25:12,171 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 [2022-02-21 03:25:12,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:12,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:12,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:12,193 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:12,195 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:25:12,195 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:25:12,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,196 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) [2022-02-21 03:25:12,197 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 [2022-02-21 03:25:12,198 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:12,198 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:12,198 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:12,198 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:25:12,213 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 [2022-02-21 03:25:12,218 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:12,222 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1;" [2022-02-21 03:25:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {137#unseeded} assume { :begin_inline_ULTIMATE.init } true; {137#unseeded} is VALID [2022-02-21 03:25:12,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {137#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {137#unseeded} is VALID [2022-02-21 03:25:12,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {137#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {137#unseeded} is VALID [2022-02-21 03:25:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,247 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {150#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:25:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:12,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:12,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:12,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,254 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:12,254 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:12,271 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 14 states and 19 transitions. Complement of second has 5 states. [2022-02-21 03:25:12,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:12,271 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,271 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:12,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:12,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:12,272 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,272 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2022-02-21 03:25:12,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:12,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,273 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2022-02-21 03:25:12,273 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:12,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:12,274 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:12,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:12,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:12,274 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:12,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2022-02-21 03:25:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:12,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:12,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 19 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:12,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,281 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:12,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:12,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:12,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 1 letters. [2022-02-21 03:25:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 1 letters. [2022-02-21 03:25:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2022-02-21 03:25:12,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:12,282 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. cyclomatic complexity: 9 [2022-02-21 03:25:12,283 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:12,283 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 10 states and 14 transitions. [2022-02-21 03:25:12,283 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2022-02-21 03:25:12,283 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2022-02-21 03:25:12,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2022-02-21 03:25:12,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:25:12,284 INFO L681 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2022-02-21 03:25:12,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2022-02-21 03:25:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2022-02-21 03:25:12,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:25:12,284 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2022-02-21 03:25:12,285 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2022-02-21 03:25:12,285 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2022-02-21 03:25:12,285 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:12,286 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:25:12,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:25:12,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:12,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:12,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) Second operand 10 states and 14 transitions. [2022-02-21 03:25:12,286 INFO L87 Difference]: Start difference. First operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) Second operand 10 states and 14 transitions. [2022-02-21 03:25:12,287 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:25:12,287 INFO L93 Difference]: Finished difference Result 10 states and 14 transitions. [2022-02-21 03:25:12,287 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 14 transitions. [2022-02-21 03:25:12,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:25:12,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:25:12,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:25:12,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:25:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 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) [2022-02-21 03:25:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2022-02-21 03:25:12,288 INFO L704 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:25:12,288 INFO L587 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2022-02-21 03:25:12,288 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:25:12,289 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2022-02-21 03:25:12,289 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:12,289 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:12,289 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:12,289 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2022-02-21 03:25:12,289 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1] [2022-02-21 03:25:12,289 INFO L791 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true; 188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; 185#L17-2 assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; 183#L19-2 assume !(main_~y~0#1 < main_~x~0#1); 184#L19-3 main_~x~0#1 := main_~x~0#1 - 1; 186#L17-2 assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; 182#L19-2 [2022-02-21 03:25:12,290 INFO L793 eck$LassoCheckResult]: Loop: 182#L19-2 assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; 182#L19-2 [2022-02-21 03:25:12,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,290 INFO L85 PathProgramCache]: Analyzing trace with hash 889696477, now seen corresponding path program 2 times [2022-02-21 03:25:12,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296646181] [2022-02-21 03:25:12,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,298 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:12,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 51, now seen corresponding path program 2 times [2022-02-21 03:25:12,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570705007] [2022-02-21 03:25:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,301 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:25:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:25:12,303 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:25:12,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:12,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1810787031, now seen corresponding path program 1 times [2022-02-21 03:25:12,303 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:25:12,303 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311336969] [2022-02-21 03:25:12,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:25:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,343 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true; {248#true} is VALID [2022-02-21 03:25:12,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {248#true} is VALID [2022-02-21 03:25:12,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {250#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:25:12,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {250#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 < main_~x~0#1); {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:25:12,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {252#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:25:12,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {253#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} is VALID [2022-02-21 03:25:12,346 INFO L290 TraceCheckUtils]: 6: Hoare triple {253#(<= (+ |ULTIMATE.start_main_~x~0#1| 1) |ULTIMATE.start_main_~y~0#1|)} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {249#false} is VALID [2022-02-21 03:25:12,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:12,347 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:25:12,347 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311336969] [2022-02-21 03:25:12,348 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311336969] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:25:12,348 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995908096] [2022-02-21 03:25:12,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:25:12,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:25:12,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,368 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:25:12,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-02-21 03:25:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-21 03:25:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:12,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:12,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true; {248#true} is VALID [2022-02-21 03:25:12,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {248#true} is VALID [2022-02-21 03:25:12,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {250#(<= |ULTIMATE.start_main_~y~0#1| 1)} is VALID [2022-02-21 03:25:12,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {250#(<= |ULTIMATE.start_main_~y~0#1| 1)} assume !(main_~y~0#1 < main_~x~0#1); {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:25:12,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} main_~x~0#1 := main_~x~0#1 - 1; {252#(<= |ULTIMATE.start_main_~x~0#1| 0)} is VALID [2022-02-21 03:25:12,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {252#(<= |ULTIMATE.start_main_~x~0#1| 0)} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {272#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))} is VALID [2022-02-21 03:25:12,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(and (<= 1 |ULTIMATE.start_main_~y~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 0))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {249#false} is VALID [2022-02-21 03:25:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:12,452 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:25:12,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {276#(not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {249#false} is VALID [2022-02-21 03:25:12,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {276#(not (< |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~x~0#1|))} is VALID [2022-02-21 03:25:12,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {283#(<= |ULTIMATE.start_main_~x~0#1| 2)} main_~x~0#1 := main_~x~0#1 - 1; {251#(<= |ULTIMATE.start_main_~x~0#1| 1)} is VALID [2022-02-21 03:25:12,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {287#(<= |ULTIMATE.start_main_~y~0#1| 2)} assume !(main_~y~0#1 < main_~x~0#1); {283#(<= |ULTIMATE.start_main_~x~0#1| 2)} is VALID [2022-02-21 03:25:12,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {248#true} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {287#(<= |ULTIMATE.start_main_~y~0#1| 2)} is VALID [2022-02-21 03:25:12,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {248#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {248#true} is VALID [2022-02-21 03:25:12,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {248#true} assume { :begin_inline_ULTIMATE.init } true; {248#true} is VALID [2022-02-21 03:25:12,510 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:12,510 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995908096] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:25:12,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:25:12,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-21 03:25:12,511 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129898892] [2022-02-21 03:25:12,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:25:12,525 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:12,525 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:12,525 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:12,525 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:12,525 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:25:12,525 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,525 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:12,526 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:12,526 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration3_Loop [2022-02-21 03:25:12,526 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:12,526 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:12,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,572 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,572 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:25:12,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,586 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) [2022-02-21 03:25:12,598 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,598 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,609 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 [2022-02-21 03:25:12,616 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:25:12,616 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: [] [2022-02-21 03:25:12,633 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 [2022-02-21 03:25:12,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,634 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) [2022-02-21 03:25:12,656 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 [2022-02-21 03:25:12,667 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:25:12,667 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,688 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 [2022-02-21 03:25:12,709 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 [2022-02-21 03:25:12,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,710 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) [2022-02-21 03:25:12,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:25:12,716 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:25:12,743 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 [2022-02-21 03:25:12,843 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:25:12,847 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 [2022-02-21 03:25:12,847 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:25:12,847 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:25:12,847 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:25:12,847 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:25:12,847 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:25:12,847 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,847 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:25:12,847 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:25:12,848 INFO L133 ssoRankerPreferences]: Filename of dumped script: PodelskiRybalchenko-TACAS2011-Fig2.c_Iteration3_Loop [2022-02-21 03:25:12,848 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:25:12,848 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:25:12,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:25:12,903 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:25:12,903 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:25:12,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,920 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) [2022-02-21 03:25:12,921 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 [2022-02-21 03:25:12,922 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 [2022-02-21 03:25:12,927 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,927 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,927 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,927 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,936 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-02-21 03:25:12,936 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-02-21 03:25:12,961 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:25:12,980 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 [2022-02-21 03:25:12,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:12,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:12,981 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) [2022-02-21 03:25:12,982 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 [2022-02-21 03:25:12,984 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 [2022-02-21 03:25:12,989 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:25:12,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:25:12,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:25:12,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:25:12,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:25:12,990 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:25:12,990 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:25:12,992 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:25:13,009 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-02-21 03:25:13,009 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2022-02-21 03:25:13,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:25:13,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:25:13,010 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) [2022-02-21 03:25:13,011 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 [2022-02-21 03:25:13,012 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:25:13,012 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:25:13,012 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:25:13,012 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0#1, ULTIMATE.start_main_~x~0#1) = -1*ULTIMATE.start_main_~y~0#1 + 1*ULTIMATE.start_main_~x~0#1 Supporting invariants [] [2022-02-21 03:25:13,030 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 [2022-02-21 03:25:13,042 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:25:13,047 INFO L390 LassoCheck]: Loop: "assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1;" [2022-02-21 03:25:13,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#unseeded} assume { :begin_inline_ULTIMATE.init } true; {294#unseeded} is VALID [2022-02-21 03:25:13,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {294#unseeded} is VALID [2022-02-21 03:25:13,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#unseeded} assume !(main_~y~0#1 < main_~x~0#1); {294#unseeded} is VALID [2022-02-21 03:25:13,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {294#unseeded} is VALID [2022-02-21 03:25:13,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,088 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {307#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:25:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:13,093 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:13,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,096 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:13,096 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,117 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 12 states and 16 transitions. Complement of second has 5 states. [2022-02-21 03:25:13,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:13,118 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,118 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:25:13,118 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,118 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,118 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,119 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,119 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,119 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:25:13,119 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,122 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:13,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,123 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#unseeded} assume { :begin_inline_ULTIMATE.init } true; {294#unseeded} is VALID [2022-02-21 03:25:13,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {294#unseeded} is VALID [2022-02-21 03:25:13,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#unseeded} assume !(main_~y~0#1 < main_~x~0#1); {294#unseeded} is VALID [2022-02-21 03:25:13,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {294#unseeded} is VALID [2022-02-21 03:25:13,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,167 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {307#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:25:13,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:13,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:13,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,174 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:13,174 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,189 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 12 states and 16 transitions. Complement of second has 5 states. [2022-02-21 03:25:13,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:13,190 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,190 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2022-02-21 03:25:13,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,190 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,190 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,191 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2022-02-21 03:25:13,191 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,194 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2022-02-21 03:25:13,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,194 INFO L634 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2022-02-21 03:25:13,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:25:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {294#unseeded} assume { :begin_inline_ULTIMATE.init } true; {294#unseeded} is VALID [2022-02-21 03:25:13,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {294#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet0#1, main_#t~nondet1#1, main_~x~0#1, main_~y~0#1;havoc main_~x~0#1;havoc main_~y~0#1;main_~x~0#1 := main_#t~nondet0#1;havoc main_#t~nondet0#1;main_~y~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1; {294#unseeded} is VALID [2022-02-21 03:25:13,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {294#unseeded} assume !(main_~y~0#1 < main_~x~0#1); {294#unseeded} is VALID [2022-02-21 03:25:13,243 INFO L290 TraceCheckUtils]: 4: Hoare triple {294#unseeded} main_~x~0#1 := main_~x~0#1 - 1; {294#unseeded} is VALID [2022-02-21 03:25:13,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {294#unseeded} assume !!(main_~x~0#1 >= 0);main_~y~0#1 := 1; {294#unseeded} is VALID [2022-02-21 03:25:13,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,246 WARN L261 TraceCheckSpWp]: Trace formula consists of 5 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:25:13,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:25:13,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:25:13,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {297#(>= oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))} assume !!(main_~y~0#1 < main_~x~0#1);main_~y~0#1 := 1 + main_~y~0#1; {307#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) |ULTIMATE.start_main_~x~0#1|))) unseeded)} is VALID [2022-02-21 03:25:13,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:25:13,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:13,259 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,260 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:25:13,260 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,289 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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 10 states and 12 transitions. Complement of second has 4 states. [2022-02-21 03:25:13,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:25:13,290 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,290 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:25:13,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:25:13,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2022-02-21 03:25:13,291 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:13,291 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:13,291 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,291 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,291 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2022-02-21 03:25:13,291 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:25:13,291 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,291 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,292 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:13,292 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2022-02-21 03:25:13,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:25:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,294 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:25:13,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 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) [2022-02-21 03:25:13,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2022-02-21 03:25:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2022-02-21 03:25:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 7 letters. Loop has 1 letters. [2022-02-21 03:25:13,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 2 letters. [2022-02-21 03:25:13,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:25:13,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2022-02-21 03:25:13,295 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:13,295 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2022-02-21 03:25:13,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:13,295 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:13,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:13,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:13,295 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:13,295 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:13,295 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:25:13,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-21 03:25:13,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-21 03:25:13,297 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:25:13,297 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:25:13,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:25:13,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:25:13,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:25:13,325 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:13,325 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:25:13,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:25:13,325 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:25:13,325 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:25:13,325 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:25:13,325 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:25:13,325 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:25:13,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:25:13 BoogieIcfgContainer [2022-02-21 03:25:13,330 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:25:13,330 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:25:13,330 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:25:13,330 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:25:13,331 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:25:10" (3/4) ... [2022-02-21 03:25:13,332 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:25:13,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:25:13,333 INFO L158 Benchmark]: Toolchain (without parser) took 3385.27ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 116.2MB in the beginning and 118.3MB in the end (delta: -2.1MB). Peak memory consumption was 44.3MB. Max. memory is 16.1GB. [2022-02-21 03:25:13,333 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 61.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:13,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 206.09ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:13,334 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.76ms. Allocated memory is still 138.4MB. Free memory was 114.7MB in the beginning and 113.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:13,334 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 138.4MB. Free memory was 113.3MB in the beginning and 112.6MB in the end (delta: 686.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:25:13,334 INFO L158 Benchmark]: RCFGBuilder took 191.87ms. Allocated memory is still 138.4MB. Free memory was 112.6MB in the beginning and 104.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:25:13,335 INFO L158 Benchmark]: BuchiAutomizer took 2938.16ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 103.7MB in the beginning and 118.3MB in the end (delta: -14.6MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. [2022-02-21 03:25:13,335 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 184.5MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:25:13,336 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 94.3MB in the beginning and 94.2MB in the end (delta: 61.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 206.09ms. Allocated memory is still 138.4MB. Free memory was 115.8MB in the beginning and 114.7MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.76ms. Allocated memory is still 138.4MB. Free memory was 114.7MB in the beginning and 113.3MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 138.4MB. Free memory was 113.3MB in the beginning and 112.6MB in the end (delta: 686.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 191.87ms. Allocated memory is still 138.4MB. Free memory was 112.6MB in the beginning and 104.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 2938.16ms. Allocated memory was 138.4MB in the beginning and 184.5MB in the end (delta: 46.1MB). Free memory was 103.7MB in the beginning and 118.3MB in the end (delta: -14.6MB). Peak memory consumption was 33.5MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 184.5MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * x + 1 and consists of 5 locations. One deterministic module has affine ranking function -1 * y + x and consists of 3 locations. One nondeterministic module has affine ranking function -1 * y + x and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:2. Analysis of lassos took 2.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 26 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 39 IncrementalHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 39 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital12 mio100 ax203 hnf100 lsp49 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq159 hnf93 smp100 dnf100 smp100 tf111 neg98 sie107 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:25:13,393 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 [2022-02-21 03:25:13,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-02-21 03:25:13,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE