./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig1.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/CookSeeZuleger-TACAS2013-Fig1.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 7e9d7ee8b64b2fe79b2fb3806ae1ecb1089e2e41 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:40,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:40,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:40,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:40,867 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:40,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:40,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:40,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:40,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:40,875 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:40,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:40,878 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:40,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:40,880 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:40,881 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:40,882 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:40,883 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:40,884 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:40,887 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:40,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:40,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:40,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:40,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:40,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:40,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:40,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:40,900 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:40,901 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:40,902 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:40,903 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:40,903 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:40,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:40,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:40,908 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:40,909 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:40,909 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:40,910 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:40,910 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:40,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:40,912 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:40,913 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:40,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:40,933 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:40,934 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:40,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:40,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:40,935 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:40,936 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:40,936 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:40,936 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:40,936 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:40,937 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:40,937 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:40,937 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:40,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:40,938 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:40,938 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:40,938 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:40,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:40,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:40,939 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:40,939 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:40,939 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:40,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:40,940 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:40,940 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:40,940 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:40,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:40,941 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:40,941 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:40,941 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:40,942 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:40,942 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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 -> 7e9d7ee8b64b2fe79b2fb3806ae1ecb1089e2e41 [2020-07-29 01:28:41,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:41,276 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:41,280 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:41,281 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:41,281 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:41,282 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig1.c [2020-07-29 01:28:41,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610176dea/4c27d156fe784e99ad23464d0daf5f26/FLAG3e0674214 [2020-07-29 01:28:41,837 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:41,838 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/CookSeeZuleger-TACAS2013-Fig1.c [2020-07-29 01:28:41,844 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610176dea/4c27d156fe784e99ad23464d0daf5f26/FLAG3e0674214 [2020-07-29 01:28:42,204 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/610176dea/4c27d156fe784e99ad23464d0daf5f26 [2020-07-29 01:28:42,208 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:42,211 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:42,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:42,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:42,216 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:42,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20f0de78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42, skipping insertion in model container [2020-07-29 01:28:42,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:42,249 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:42,431 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:42,438 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:42,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:42,474 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:42,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42 WrapperNode [2020-07-29 01:28:42,474 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:42,475 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:42,475 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:42,475 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:42,483 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,487 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,568 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:42,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:42,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:42,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:42,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... [2020-07-29 01:28:42,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:42,586 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:42,586 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:42,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:42,587 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:42,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:42,837 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:42,837 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:42,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:42 BoogieIcfgContainer [2020-07-29 01:28:42,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:42,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:42,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:42,845 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:42,846 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:42,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:42" (1/3) ... [2020-07-29 01:28:42,847 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cca8e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:42, skipping insertion in model container [2020-07-29 01:28:42,847 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:42,847 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:42" (2/3) ... [2020-07-29 01:28:42,848 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cca8e59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:42, skipping insertion in model container [2020-07-29 01:28:42,848 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:42,848 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:42" (3/3) ... [2020-07-29 01:28:42,850 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-TACAS2013-Fig1.c [2020-07-29 01:28:42,904 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:42,905 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:42,905 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:42,905 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:42,906 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:42,906 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:42,906 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:42,906 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:42,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:42,952 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:42,953 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:42,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:42,965 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:42,966 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:42,968 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:42,969 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:42,969 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:42,969 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:42,970 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:42,982 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L19-2true [2020-07-29 01:28:42,983 INFO L796 eck$LassoCheckResult]: Loop: 6#L19-2true assume !!(main_~x~0 > 0 && main_~y~0 > 0); 8#L19true assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; 6#L19-2true [2020-07-29 01:28:42,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:28:43,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,006 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467573668] [2020-07-29 01:28:43,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,119 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:43,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 1 times [2020-07-29 01:28:43,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,122 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764142761] [2020-07-29 01:28:43,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,138 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,140 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:43,142 INFO L82 PathProgramCache]: Analyzing trace with hash 31075, now seen corresponding path program 1 times [2020-07-29 01:28:43,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:43,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916275022] [2020-07-29 01:28:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,151 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:43,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:43,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:43,310 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:43,312 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:43,312 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:43,312 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:43,313 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:43,313 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,313 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:43,314 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:43,314 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:43,314 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:43,314 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:43,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,599 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:43,600 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:43,615 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,616 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,627 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:43,627 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:43,669 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,669 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,675 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:43,675 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:43,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:43,715 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,764 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:43,765 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:43,804 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:43,806 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:43,807 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:43,807 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:43,807 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:43,807 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:43,807 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:43,808 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:43,808 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:43,808 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration1_Loop [2020-07-29 01:28:43,809 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:43,809 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:43,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:43,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,031 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:44,037 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:44,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:44,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:44,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:44,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:44,055 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:44,065 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:44,065 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,108 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:44,110 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:44,110 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:44,110 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:44,111 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:44,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:44,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:44,134 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:44,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:44,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:44,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:44,190 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:44,190 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:44,191 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:44,192 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:44,192 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,196 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:44,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:44,202 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:44,213 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:44,213 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:44,214 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:28:44,245 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:44,249 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:44,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,300 INFO L280 TraceCheckUtils]: 0: Hoare triple {17#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {17#unseeded} is VALID [2020-07-29 01:28:44,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,306 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:44,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:44,310 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:44,335 INFO L280 TraceCheckUtils]: 0: Hoare triple {20#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {35#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:44,338 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; {30#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:44,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:44,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:44,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:44,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,366 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 [2020-07-29 01:28:44,367 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states. Second operand 3 states. [2020-07-29 01:28:44,464 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states.. Second operand 3 states. Result 23 states and 30 transitions. Complement of second has 8 states. [2020-07-29 01:28:44,465 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 [2020-07-29 01:28:44,465 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states. [2020-07-29 01:28:44,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,469 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,470 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,470 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:44,474 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:44,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,475 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 30 transitions. [2020-07-29 01:28:44,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,478 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,483 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states. [2020-07-29 01:28:44,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:44,490 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:44,493 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:44,493 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:44,494 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:44,494 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:44,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:44,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:44,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:28:44,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:44,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:44,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:44,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:44,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:44,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:44,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:44,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:44,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:44,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:44,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:44,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:44,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:44,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:44,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 30 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,537 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:44,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2020-07-29 01:28:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:44,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:44,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:44,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:44,546 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 30 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:44,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,565 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 7 states and 10 transitions. [2020-07-29 01:28:44,566 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4 [2020-07-29 01:28:44,567 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:44,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 10 transitions. [2020-07-29 01:28:44,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:44,568 INFO L688 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 10 transitions. [2020-07-29 01:28:44,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-29 01:28:44,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:44,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:44,603 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:44,605 INFO L87 Difference]: Start difference. First operand 7 states and 10 transitions. Second operand 7 states. [2020-07-29 01:28:44,609 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:44,611 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:44,612 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:44,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:44,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:44,613 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:44,613 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states and 10 transitions. [2020-07-29 01:28:44,614 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:44,615 INFO L93 Difference]: Finished difference Result 7 states and 10 transitions. [2020-07-29 01:28:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:44,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:44,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:44,616 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:44,616 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:28:44,619 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:44,619 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:28:44,619 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:44,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:28:44,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:44,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:44,621 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:44,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-07-29 01:28:44,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:44,622 INFO L794 eck$LassoCheckResult]: Stem: 73#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 74#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 79#L19 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; 75#L19-2 [2020-07-29 01:28:44,622 INFO L796 eck$LassoCheckResult]: Loop: 75#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 76#L19 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; 75#L19-2 [2020-07-29 01:28:44,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 1 times [2020-07-29 01:28:44,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,624 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957169975] [2020-07-29 01:28:44,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,638 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,647 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,651 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:44,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 2 times [2020-07-29 01:28:44,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,654 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254582349] [2020-07-29 01:28:44,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,675 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,679 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,684 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:44,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:44,686 INFO L82 PathProgramCache]: Analyzing trace with hash 29865320, now seen corresponding path program 1 times [2020-07-29 01:28:44,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:44,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037890112] [2020-07-29 01:28:44,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,705 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:44,726 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:44,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:44,755 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:44,755 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:44,755 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:44,755 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:44,755 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:44,756 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,756 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:44,756 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:44,756 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:44,756 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:44,756 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:44,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:44,953 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:44,954 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:44,966 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:44,966 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:44,973 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:44,973 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,020 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,020 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,081 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:45,081 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,129 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:45,133 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,134 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,134 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,134 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,134 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:45,135 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,135 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,136 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,136 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration2_Loop [2020-07-29 01:28:45,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,298 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:45,298 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,310 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:45,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:45,313 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:45,313 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:45,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:45,316 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:45,317 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,321 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:45,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:45,370 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:45,370 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:45,371 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:45,371 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:45,371 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:45,372 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:45,372 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,375 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:45,378 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:28:45,378 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,387 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:45,387 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:45,387 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:45,387 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:28:45,422 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:45,425 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:45,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:45,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:45,452 INFO L280 TraceCheckUtils]: 0: Hoare triple {123#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {123#unseeded} is VALID [2020-07-29 01:28:45,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {123#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {123#unseeded} is VALID [2020-07-29 01:28:45,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {123#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {123#unseeded} is VALID [2020-07-29 01:28:45,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:45,457 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:45,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:45,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:45,481 INFO L280 TraceCheckUtils]: 0: Hoare triple {126#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {147#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:45,482 INFO L280 TraceCheckUtils]: 1: Hoare triple {147#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; {136#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:45,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:45,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:45,489 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:45,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,489 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 [2020-07-29 01:28:45,489 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:28:45,515 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 11 states and 16 transitions. Complement of second has 5 states. [2020-07-29 01:28:45,515 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 [2020-07-29 01:28:45,515 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:45,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:45,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:45,517 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,519 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,519 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:45,520 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:45,520 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:45,521 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,521 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:45,521 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:45,522 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:45,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:45,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:45,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:45,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:45,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:45,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:28:45,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:45,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:45,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:45,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:45,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:45,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:45,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:45,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:45,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:45,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:45,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,538 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:45,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:45,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:45,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:45,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:45,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 3 letters. Loop has 4 letters. [2020-07-29 01:28:45,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:45,541 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:45,542 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,543 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:45,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:45,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:45,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:45,544 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:45,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-29 01:28:45,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:45,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:45,546 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:45,546 INFO L87 Difference]: Start difference. First operand 11 states and 16 transitions. Second operand 11 states. [2020-07-29 01:28:45,547 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:45,548 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:45,548 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:45,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:45,549 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:45,549 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states and 16 transitions. [2020-07-29 01:28:45,550 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:45,551 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2020-07-29 01:28:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:45,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:45,553 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:45,553 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-29 01:28:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 16 transitions. [2020-07-29 01:28:45,554 INFO L711 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:45,554 INFO L591 BuchiCegarLoop]: Abstraction has 11 states and 16 transitions. [2020-07-29 01:28:45,554 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:45,555 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. [2020-07-29 01:28:45,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:45,556 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:45,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:45,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1] [2020-07-29 01:28:45,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:45,557 INFO L794 eck$LassoCheckResult]: Stem: 169#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 170#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 175#L19 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; 176#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 177#L19 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; 171#L19-2 [2020-07-29 01:28:45,557 INFO L796 eck$LassoCheckResult]: Loop: 171#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 172#L19 assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; 171#L19-2 [2020-07-29 01:28:45,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,557 INFO L82 PathProgramCache]: Analyzing trace with hash 29865322, now seen corresponding path program 2 times [2020-07-29 01:28:45,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091263378] [2020-07-29 01:28:45,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,565 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,572 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1284, now seen corresponding path program 3 times [2020-07-29 01:28:45,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211927879] [2020-07-29 01:28:45,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,577 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,579 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,580 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1364196307, now seen corresponding path program 2 times [2020-07-29 01:28:45,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:45,582 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727428903] [2020-07-29 01:28:45,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,589 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:45,595 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:45,597 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:45,620 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:45,620 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:45,620 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:45,620 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:45,620 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:45,620 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,620 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:45,621 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:45,621 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:45,621 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:45,621 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:45,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:45,828 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:45,828 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,846 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,852 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,852 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=7} Honda state: {ULTIMATE.start_main_#t~nondet2=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,877 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,877 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,880 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,880 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: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,903 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,904 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,907 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,907 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~y~0=1} Honda state: {ULTIMATE.start_main_~y~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,930 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:45,933 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:45,934 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_5=0} Honda state: {v_rep~unnamed0~0~false_5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,958 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:45,958 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:45,983 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:45,983 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:46,008 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:46,010 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,010 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,011 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,011 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,011 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:46,011 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,011 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,011 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,011 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration3_Loop [2020-07-29 01:28:46,012 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,012 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,169 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,170 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:46,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,179 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:46,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,180 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2020-07-29 01:28:46,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,182 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2020-07-29 01:28:46,182 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:46,185 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,214 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:46,216 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,217 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,217 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,217 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,219 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:46,219 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:46,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:46,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:46,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,248 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:46,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:46,250 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:46,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:46,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:46,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,306 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:46,307 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:46,307 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:46,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:46,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:46,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:46,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:46,309 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:46,311 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:46,314 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:46,315 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,320 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:46,320 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:46,321 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:46,321 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] [2020-07-29 01:28:46,344 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:46,347 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1;" [2020-07-29 01:28:46,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,376 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,381 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {237#unseeded} is VALID [2020-07-29 01:28:46,382 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,383 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,383 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,384 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,389 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,416 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {267#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,417 INFO L280 TraceCheckUtils]: 1: Hoare triple {267#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; {250#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:46,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:46,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:46,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,429 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 [2020-07-29 01:28:46,429 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:28:46,457 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:28:46,457 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 [2020-07-29 01:28:46,457 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,458 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:46,458 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,459 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 01:28:46,459 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,459 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,459 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,460 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,461 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,461 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:46,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,462 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:46,462 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:46,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,476 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:46,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:46,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,477 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:46,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,504 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {237#unseeded} is VALID [2020-07-29 01:28:46,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,513 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,514 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,514 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,518 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,537 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {307#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,538 INFO L280 TraceCheckUtils]: 1: Hoare triple {307#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; {250#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:46,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:46,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:46,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,545 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:46,545 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:28:46,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:28:46,575 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 [2020-07-29 01:28:46,575 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:46,576 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 20 transitions. [2020-07-29 01:28:46,577 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,578 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,578 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,579 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,579 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,579 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:46,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,580 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:46,580 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 20 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:46,581 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:28:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 20 transitions. cyclomatic complexity: 10 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,597 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:46,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:46,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,598 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,636 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {237#unseeded} is VALID [2020-07-29 01:28:46,637 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,638 INFO L280 TraceCheckUtils]: 2: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,640 INFO L280 TraceCheckUtils]: 3: Hoare triple {237#unseeded} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {237#unseeded} is VALID [2020-07-29 01:28:46,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {237#unseeded} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {237#unseeded} is VALID [2020-07-29 01:28:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,646 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:46,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:46,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:46,671 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {347#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} is VALID [2020-07-29 01:28:46,672 INFO L280 TraceCheckUtils]: 1: Hoare triple {347#(and (<= ULTIMATE.start_main_~x~0 oldRank0) (< 0 ULTIMATE.start_main_~x~0))} assume 0 != main_#t~nondet2;havoc main_#t~nondet2;main_~x~0 := main_~x~0 - 1; {250#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:46,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:46,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:46,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,681 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 2 loop predicates [2020-07-29 01:28:46,681 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8 Second operand 3 states. [2020-07-29 01:28:46,713 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 16 transitions. cyclomatic complexity: 8. Second operand 3 states. Result 15 states and 23 transitions. Complement of second has 4 states. [2020-07-29 01:28:46,714 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 [2020-07-29 01:28:46,714 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:46,715 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,716 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,716 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 23 transitions. [2020-07-29 01:28:46,716 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:46,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 16 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:46,717 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:46,717 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:46,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:46,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:46,718 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 23 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:46,718 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:28:46,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:28:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:28:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:46,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:46,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 16 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 23 transitions. cyclomatic complexity: 11 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,730 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:46,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:46,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:46,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:46,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:46,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:46,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 23 transitions. cyclomatic complexity: 11 [2020-07-29 01:28:46,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:46,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 13 states and 19 transitions. [2020-07-29 01:28:46,736 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:46,736 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2020-07-29 01:28:46,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 19 transitions. [2020-07-29 01:28:46,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:46,736 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 19 transitions. [2020-07-29 01:28:46,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 19 transitions. [2020-07-29 01:28:46,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 5. [2020-07-29 01:28:46,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:46,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:28:46,738 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:28:46,738 INFO L87 Difference]: Start difference. First operand 13 states and 19 transitions. Second operand 5 states. [2020-07-29 01:28:46,739 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,740 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:28:46,740 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:28:46,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,741 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 13 states and 19 transitions. [2020-07-29 01:28:46,741 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 13 states and 19 transitions. [2020-07-29 01:28:46,741 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:46,743 INFO L93 Difference]: Finished difference Result 13 states and 19 transitions. [2020-07-29 01:28:46,743 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 19 transitions. [2020-07-29 01:28:46,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:46,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:46,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:46,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:28:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2020-07-29 01:28:46,745 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 01:28:46,745 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2020-07-29 01:28:46,745 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:46,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2020-07-29 01:28:46,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:46,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:46,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:46,747 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:28:46,747 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:46,747 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; 373#L19-2 [2020-07-29 01:28:46,747 INFO L796 eck$LassoCheckResult]: Loop: 373#L19-2 assume !!(main_~x~0 > 0 && main_~y~0 > 0); 374#L19 assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; 373#L19-2 [2020-07-29 01:28:46,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,748 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:28:46,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824451629] [2020-07-29 01:28:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,754 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1286, now seen corresponding path program 1 times [2020-07-29 01:28:46,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,756 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443039280] [2020-07-29 01:28:46,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,760 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,763 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,764 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:46,765 INFO L82 PathProgramCache]: Analyzing trace with hash 31077, now seen corresponding path program 3 times [2020-07-29 01:28:46,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:46,766 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541461899] [2020-07-29 01:28:46,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:46,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:46,773 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:46,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:46,805 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:46,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:46,805 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:46,805 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:46,805 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:46,805 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,805 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:46,805 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:46,806 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration4_Loop [2020-07-29 01:28:46,806 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:46,806 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:46,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:46,968 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:46,968 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:46,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:46,977 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:46,980 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:46,980 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_main_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,008 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,008 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:47,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:47,011 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,035 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:47,035 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,060 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:47,061 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:47,086 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:47,088 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:47,088 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:47,088 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:47,088 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:47,088 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:47,088 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,088 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:47,089 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:47,089 INFO L133 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-TACAS2013-Fig1.c_Iteration4_Loop [2020-07-29 01:28:47,089 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:47,089 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:47,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:47,276 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:47,276 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,279 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,280 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,281 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,281 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,281 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,281 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:47,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,311 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,311 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,313 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:47,313 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:47,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,342 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:47,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:47,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:47,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:47,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:47,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:47,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:47,346 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:47,355 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:47,359 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:47,359 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:47,364 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:47,364 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:47,364 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:47,364 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~y~0) = 1*ULTIMATE.start_main_~y~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:47,396 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:47,399 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 0 && main_~y~0 > 0);" "assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1;" [2020-07-29 01:28:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {434#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~nondet2, main_#t~nondet3, main_~x~0, main_~y~0;havoc main_~x~0;havoc main_~y~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~y~0 := main_#t~nondet1;havoc main_#t~nondet1; {434#unseeded} is VALID [2020-07-29 01:28:47,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:47,432 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:47,450 INFO L280 TraceCheckUtils]: 0: Hoare triple {437#(>= oldRank0 ULTIMATE.start_main_~y~0)} assume !!(main_~x~0 > 0 && main_~y~0 > 0); {452#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} is VALID [2020-07-29 01:28:47,451 INFO L280 TraceCheckUtils]: 1: Hoare triple {452#(and (< 0 ULTIMATE.start_main_~y~0) (<= ULTIMATE.start_main_~y~0 oldRank0))} assume !(0 != main_#t~nondet2);havoc main_#t~nondet2;main_~x~0 := main_#t~nondet3;havoc main_#t~nondet3;main_~y~0 := main_~y~0 - 1; {447#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_main_~y~0)) unseeded)} is VALID [2020-07-29 01:28:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:47,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:47,455 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:47,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,456 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 [2020-07-29 01:28:47,456 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2020-07-29 01:28:47,483 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 11 states and 17 transitions. Complement of second has 4 states. [2020-07-29 01:28:47,484 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 [2020-07-29 01:28:47,484 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:47,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:47,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:47,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:47,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. [2020-07-29 01:28:47,485 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:47,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:47,486 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 7 transitions. cyclomatic complexity: 3 [2020-07-29 01:28:47,486 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:47,487 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:47,487 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:47,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:47,488 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,488 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:47,488 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:47,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:47,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:47,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:47,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:28:47,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:47,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:47,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 7 transitions. cyclomatic complexity: 3 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,497 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:28:47,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:47,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:47,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:28:47,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:47,499 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:47,500 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:47,500 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:28:47,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:47,501 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:47,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:47,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:47,501 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:47,501 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:47,502 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:47,502 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:47,502 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:47,502 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:47,502 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:47,508 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:47 BoogieIcfgContainer [2020-07-29 01:28:47,508 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:47,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:47,509 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:47,509 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:47,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:42" (3/4) ... [2020-07-29 01:28:47,513 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:47,513 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:47,516 INFO L168 Benchmark]: Toolchain (without parser) took 5305.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.3 MB). Free memory was 960.2 MB in the beginning and 922.8 MB in the end (delta: 37.4 MB). Peak memory consumption was 238.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:47,516 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:47,517 INFO L168 Benchmark]: CACSL2BoogieTranslator took 262.32 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:47,518 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:47,519 INFO L168 Benchmark]: Boogie Preprocessor took 18.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:47,520 INFO L168 Benchmark]: RCFGBuilder took 253.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:47,521 INFO L168 Benchmark]: BuchiAutomizer took 4667.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 183.9 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:47,521 INFO L168 Benchmark]: Witness Printer took 4.19 ms. Allocated memory is still 1.2 GB. Free memory is still 922.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:47,526 INFO L336 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 262.32 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -176.3 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.04 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 253.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4667.58 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 922.8 MB in the end (delta: 183.9 MB). Peak memory consumption was 257.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.19 ms. Allocated memory is still 1.2 GB. Free memory is still 922.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (0 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 5 locations. One deterministic module has affine ranking function x and consists of 3 locations. One deterministic module has affine ranking function y and consists of 3 locations. One nondeterministic module has affine ranking function x and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.6s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 11 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 27 SDtfs, 26 SDslu, 7 SDs, 0 SdLazy, 33 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT4 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital17 mio100 ax168 hnf100 lsp33 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq160 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 33ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 9 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...