./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-restricted-15/Log.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-restricted-15/Log.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 2d80b45a01c32727728c3a89e06c1e9a4dc4868b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:29:59,844 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:29:59,847 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:29:59,860 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:29:59,860 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:29:59,861 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:29:59,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:29:59,865 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:29:59,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:29:59,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:29:59,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:29:59,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:29:59,871 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:29:59,872 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:29:59,873 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:29:59,874 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:29:59,875 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:29:59,876 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:29:59,878 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:29:59,881 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:29:59,882 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:29:59,884 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:29:59,885 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:29:59,886 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:29:59,889 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:29:59,889 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:29:59,889 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:29:59,890 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:29:59,891 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:29:59,892 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:29:59,892 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:29:59,893 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:29:59,894 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:29:59,895 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:29:59,896 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:29:59,896 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:29:59,897 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:29:59,897 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:29:59,897 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:29:59,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:29:59,899 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:29:59,900 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:29:59,918 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:29:59,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:29:59,919 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:29:59,919 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:29:59,920 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:29:59,920 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:29:59,920 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:29:59,920 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:29:59,920 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:29:59,921 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:29:59,921 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:29:59,921 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:29:59,921 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:29:59,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:29:59,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:29:59,922 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:29:59,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:29:59,922 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:29:59,923 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:29:59,923 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:29:59,923 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:29:59,923 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:29:59,924 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:29:59,924 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:29:59,924 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:29:59,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:29:59,924 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:29:59,925 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:29:59,925 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:29:59,926 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:29:59,926 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 -> 2d80b45a01c32727728c3a89e06c1e9a4dc4868b [2020-07-29 01:30:00,241 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:30:00,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:30:00,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:30:00,259 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:30:00,259 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:30:00,260 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-restricted-15/Log.c [2020-07-29 01:30:00,332 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076ec0789/8c840f4b2af04b67bbcfe4525bd52145/FLAG718eb9c7c [2020-07-29 01:30:00,756 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:30:00,757 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-restricted-15/Log.c [2020-07-29 01:30:00,764 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076ec0789/8c840f4b2af04b67bbcfe4525bd52145/FLAG718eb9c7c [2020-07-29 01:30:01,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/076ec0789/8c840f4b2af04b67bbcfe4525bd52145 [2020-07-29 01:30:01,159 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:30:01,163 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:30:01,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:01,166 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:30:01,169 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:30:01,171 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,174 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11461533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01, skipping insertion in model container [2020-07-29 01:30:01,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:30:01,209 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:30:01,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:01,403 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:30:01,421 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:30:01,436 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:30:01,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01 WrapperNode [2020-07-29 01:30:01,437 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:30:01,438 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:01,438 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:30:01,438 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:30:01,448 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:30:01" (1/1) ... [2020-07-29 01:30:01,454 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:30:01" (1/1) ... [2020-07-29 01:30:01,476 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:30:01,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:30:01,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:30:01,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:30:01,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,546 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,558 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (1/1) ... [2020-07-29 01:30:01,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:30:01,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:30:01,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:30:01,560 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:30:01,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (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:30:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:30:01,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:30:01,833 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:30:01,834 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:30:01,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:01 BoogieIcfgContainer [2020-07-29 01:30:01,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:30:01,837 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:30:01,837 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:30:01,841 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:30:01,842 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:01,842 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:30:01" (1/3) ... [2020-07-29 01:30:01,843 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baab2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:01, skipping insertion in model container [2020-07-29 01:30:01,843 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:01,843 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:30:01" (2/3) ... [2020-07-29 01:30:01,844 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5baab2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:30:01, skipping insertion in model container [2020-07-29 01:30:01,844 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:30:01,844 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:01" (3/3) ... [2020-07-29 01:30:01,846 INFO L371 chiAutomizerObserver]: Analyzing ICFG Log.c [2020-07-29 01:30:01,912 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:30:01,912 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:30:01,912 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:30:01,913 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:30:01,913 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:30:01,913 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:30:01,913 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:30:01,913 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:30:01,938 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:01,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:01,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:01,980 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:01,987 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:01,987 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:01,987 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:30:01,988 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:30:01,992 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:01,992 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:01,992 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:01,992 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:01,993 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:30:02,003 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 6#L13-2true [2020-07-29 01:30:02,003 INFO L796 eck$LassoCheckResult]: Loop: 6#L13-2true assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; 3#L17-2true assume !(main_~xtmp~0 > 1); 10#L17-3true main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; 6#L13-2true [2020-07-29 01:30:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2020-07-29 01:30:02,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566889906] [2020-07-29 01:30:02,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,103 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,118 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,119 INFO L82 PathProgramCache]: Analyzing trace with hash 39951, now seen corresponding path program 1 times [2020-07-29 01:30:02,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,120 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622621614] [2020-07-29 01:30:02,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:02,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {16#(<= 2 ULTIMATE.start_main_~xtmp~0)} is VALID [2020-07-29 01:30:02,211 INFO L280 TraceCheckUtils]: 1: Hoare triple {16#(<= 2 ULTIMATE.start_main_~xtmp~0)} assume !(main_~xtmp~0 > 1); {15#false} is VALID [2020-07-29 01:30:02,211 INFO L280 TraceCheckUtils]: 2: Hoare triple {15#false} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {15#false} is VALID [2020-07-29 01:30:02,214 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:30:02,218 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622621614] [2020-07-29 01:30:02,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:30:02,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:30:02,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030477756] [2020-07-29 01:30:02,227 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-29 01:30:02,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:02,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:30:02,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:30:02,245 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 3 states. [2020-07-29 01:30:02,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:02,333 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:30:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:30:02,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:30:02,349 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:30:02,352 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:30:02,355 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:02,366 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 5 states and 6 transitions. [2020-07-29 01:30:02,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:30:02,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:30:02,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 6 transitions. [2020-07-29 01:30:02,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:02,369 INFO L688 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:30:02,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 6 transitions. [2020-07-29 01:30:02,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2020-07-29 01:30:02,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:02,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:30:02,402 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:30:02,404 INFO L87 Difference]: Start difference. First operand 5 states and 6 transitions. Second operand 5 states. [2020-07-29 01:30:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:02,407 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:30:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:30:02,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:02,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:02,409 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:30:02,409 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states and 6 transitions. [2020-07-29 01:30:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:02,415 INFO L93 Difference]: Finished difference Result 5 states and 6 transitions. [2020-07-29 01:30:02,416 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:30:02,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:02,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:02,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:02,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-29 01:30:02,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 6 transitions. [2020-07-29 01:30:02,422 INFO L711 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:30:02,422 INFO L591 BuchiCegarLoop]: Abstraction has 5 states and 6 transitions. [2020-07-29 01:30:02,422 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:30:02,423 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. [2020-07-29 01:30:02,424 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:30:02,424 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:02,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:02,426 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1] [2020-07-29 01:30:02,426 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 01:30:02,426 INFO L794 eck$LassoCheckResult]: Stem: 28#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 29#L13-2 [2020-07-29 01:30:02,426 INFO L796 eck$LassoCheckResult]: Loop: 29#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; 26#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 27#L17-2 assume !(main_~xtmp~0 > 1); 30#L17-3 main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; 29#L13-2 [2020-07-29 01:30:02,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,428 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2020-07-29 01:30:02,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349714284] [2020-07-29 01:30:02,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,443 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,451 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,455 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1240240, now seen corresponding path program 1 times [2020-07-29 01:30:02,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,457 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119267567] [2020-07-29 01:30:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,484 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,503 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,505 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash 29869391, now seen corresponding path program 1 times [2020-07-29 01:30:02,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:02,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591040831] [2020-07-29 01:30:02,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,516 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:02,524 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:02,526 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:02,649 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:02,650 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:02,650 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:02,650 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:02,651 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:02,651 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:02,651 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:02,651 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:02,651 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration2_Loop [2020-07-29 01:30:02,651 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:02,652 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:02,690 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:30:02,704 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:30:02,711 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:30:02,718 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:30:02,730 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:30:02,935 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:02,936 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:30:02,948 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:02,948 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:30:02,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:02,962 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:30:03,006 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,007 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:30:03,012 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:03,012 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:30:03,056 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,057 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 [2020-07-29 01:30:03,062 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:03,062 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~restmp~0=1} Honda state: {ULTIMATE.start_main_~restmp~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:30:03,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,101 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:03,147 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:03,147 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,170 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:03,170 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~res~0=0} Honda state: {ULTIMATE.start_main_~res~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~res~0=6}, {ULTIMATE.start_main_~res~0=1}, {ULTIMATE.start_main_~res~0=-6}] Lambdas: [1, 1, 1] Nus: [0, 0] 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) [2020-07-29 01:30:03,207 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:03,207 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 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 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,239 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:03,240 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:03,800 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:03,805 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:03,805 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:03,806 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:03,806 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:03,806 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:03,806 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:03,806 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:03,807 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:03,807 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration2_Loop [2020-07-29 01:30:03,807 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:03,807 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:03,839 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:30:03,847 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:30:03,853 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:30:03,860 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:30:03,876 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:30:04,065 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:04,071 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:04,078 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:30:04,081 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,082 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,087 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:04,088 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,094 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,138 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:30:04,140 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,140 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,144 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:04,144 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,151 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,203 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:30:04,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:04,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:04,209 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,212 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,263 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:30:04,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:04,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:04,266 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:04,266 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:04,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:04,270 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:04,270 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,274 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:04,283 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:04,283 INFO L444 ModelExtractionUtils]: 1 out of 4 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,297 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:04,297 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:04,297 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:04,298 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~x~0) = 1*ULTIMATE.start_main_~x~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,343 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:04,348 INFO L393 LassoCheck]: Loop: "assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0;" "assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0;" "assume !(main_~xtmp~0 > 1);" "main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0;" [2020-07-29 01:30:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:04,400 INFO L280 TraceCheckUtils]: 0: Hoare triple {50#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {50#unseeded} is VALID [2020-07-29 01:30:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,408 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 01:30:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:04,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:04,490 INFO L280 TraceCheckUtils]: 0: Hoare triple {53#(>= oldRank0 ULTIMATE.start_main_~x~0)} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {68#(<= 2 oldRank0)} is VALID [2020-07-29 01:30:04,491 INFO L280 TraceCheckUtils]: 1: Hoare triple {68#(<= 2 oldRank0)} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {68#(<= 2 oldRank0)} is VALID [2020-07-29 01:30:04,492 INFO L280 TraceCheckUtils]: 2: Hoare triple {68#(<= 2 oldRank0)} assume !(main_~xtmp~0 > 1); {75#(and (<= ULTIMATE.start_main_~xtmp~0 1) (<= 2 oldRank0))} is VALID [2020-07-29 01:30:04,493 INFO L280 TraceCheckUtils]: 3: Hoare triple {75#(and (<= ULTIMATE.start_main_~xtmp~0 1) (<= 2 oldRank0))} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {63#(or (and (> oldRank0 ULTIMATE.start_main_~x~0) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:30:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:04,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:04,504 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:30:04,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,510 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 01:30:04,512 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2 Second operand 4 states. [2020-07-29 01:30:04,608 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 6 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 9 states and 12 transitions. Complement of second has 6 states. [2020-07-29 01:30:04,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 01:30:04,609 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:04,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:04,610 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,610 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,610 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:30:04,611 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:04,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 12 transitions. [2020-07-29 01:30:04,613 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:04,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,616 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 5 states and 6 transitions. cyclomatic complexity: 2 [2020-07-29 01:30:04,617 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 01:30:04,618 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:30:04,619 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 01:30:04,619 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:04,619 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:04,620 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:04,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:04,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:04,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 9 letters. Loop has 9 letters. [2020-07-29 01:30:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:04,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:04,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:30:04,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:30:04,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:30:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:30:04,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:30:04,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 3 letters. [2020-07-29 01:30:04,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 6 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 12 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:04,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,641 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:04,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:30:04,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5 transitions. [2020-07-29 01:30:04,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 1 letters. Loop has 4 letters. [2020-07-29 01:30:04,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:30:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 5 transitions. Stem has 1 letters. Loop has 8 letters. [2020-07-29 01:30:04,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:04,645 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 12 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:04,646 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:04,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 11 transitions. [2020-07-29 01:30:04,648 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:04,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4 [2020-07-29 01:30:04,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2020-07-29 01:30:04,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:04,648 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:30:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2020-07-29 01:30:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2020-07-29 01:30:04,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:04,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:30:04,650 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:30:04,651 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 7 states. [2020-07-29 01:30:04,651 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:04,654 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:30:04,654 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:30:04,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:04,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:04,655 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states and 11 transitions. [2020-07-29 01:30:04,655 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states and 11 transitions. [2020-07-29 01:30:04,656 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:04,657 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:30:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:30:04,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:04,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:04,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:04,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:04,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:04,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 10 transitions. [2020-07-29 01:30:04,660 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:04,660 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 10 transitions. [2020-07-29 01:30:04,660 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:30:04,661 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. [2020-07-29 01:30:04,661 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:04,661 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:04,662 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:04,662 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:30:04,662 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:04,662 INFO L794 eck$LassoCheckResult]: Stem: 102#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 103#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; 99#L17-2 [2020-07-29 01:30:04,663 INFO L796 eck$LassoCheckResult]: Loop: 99#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 99#L17-2 [2020-07-29 01:30:04,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1002, now seen corresponding path program 1 times [2020-07-29 01:30:04,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828749451] [2020-07-29 01:30:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,674 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,675 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2020-07-29 01:30:04,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,676 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773046348] [2020-07-29 01:30:04,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,684 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,685 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:04,686 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2020-07-29 01:30:04,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:04,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959833717] [2020-07-29 01:30:04,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:04,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:04,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:04,722 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:04,723 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:04,723 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:04,723 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:04,723 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:04,723 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,724 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:04,724 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:04,724 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration3_Loop [2020-07-29 01:30:04,724 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:04,724 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:04,733 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:30:04,739 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:30:04,745 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:30:04,750 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:30:04,867 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:04,867 INFO L404 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:04,879 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,879 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:30:04,883 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:04,883 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,933 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:04,934 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:04,991 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:04,991 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,014 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:05,015 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~restmp~0=0} Honda state: {ULTIMATE.start_main_~restmp~0=0} Generalized eigenvectors: [{ULTIMATE.start_main_~restmp~0=5}, {ULTIMATE.start_main_~restmp~0=-2}, {ULTIMATE.start_main_~restmp~0=-2}] Lambdas: [1, 0, 1] Nus: [0, 1] 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) [2020-07-29 01:30:05,062 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,063 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,067 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:05,067 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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) [2020-07-29 01:30:05,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,116 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 18 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:05,168 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,210 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:05,212 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:05,213 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:05,213 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:05,213 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:05,213 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:05,213 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,214 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:05,214 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:05,214 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration3_Loop [2020-07-29 01:30:05,214 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:05,214 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:05,225 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:30:05,231 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:30:05,237 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:30:05,244 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:30:05,416 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:05,417 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:05,420 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:30:05,422 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:05,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:05,423 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:05,423 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:05,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:05,425 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,430 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,466 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 Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,468 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:05,469 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:05,469 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:05,469 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:05,469 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:05,470 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:05,470 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:05,475 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,504 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:30:05,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:05,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:05,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:05,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:05,509 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:05,509 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,515 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:30:05,543 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:30:05,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:05,545 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:05,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:05,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:05,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:05,546 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:05,546 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:30:05,549 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:05,564 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-29 01:30:05,564 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,567 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:05,567 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:05,568 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:05,568 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,596 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:05,599 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0;" [2020-07-29 01:30:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 11 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {151#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {151#unseeded} is VALID [2020-07-29 01:30:05,652 INFO L280 TraceCheckUtils]: 1: Hoare triple {151#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {151#unseeded} is VALID [2020-07-29 01:30:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,658 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:05,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {154#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {164#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:05,663 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:30:05,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:05,668 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:30:05,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,669 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:05,669 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5 Second operand 2 states. [2020-07-29 01:30:05,706 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 10 transitions. cyclomatic complexity: 5. Second operand 2 states. Result 15 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:30:05,706 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:30:05,707 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:05,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,707 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,707 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:05,708 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,708 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,708 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:30:05,709 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,709 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,710 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,710 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 10 transitions. cyclomatic complexity: 5 [2020-07-29 01:30:05,710 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:05,711 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:05,712 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:05,712 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:05,712 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:05,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:30:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,717 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:30:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,717 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:30:05,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:05,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 10 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 20 transitions. cyclomatic complexity: 9 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:05,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,720 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:05,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:05,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:30:05,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 3 letters. Loop has 1 letters. [2020-07-29 01:30:05,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:30:05,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:05,722 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:30:05,724 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,725 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 11 states and 15 transitions. [2020-07-29 01:30:05,725 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3 [2020-07-29 01:30:05,725 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3 [2020-07-29 01:30:05,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2020-07-29 01:30:05,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:30:05,725 INFO L688 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2020-07-29 01:30:05,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2020-07-29 01:30:05,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 7. [2020-07-29 01:30:05,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:30:05,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:30:05,727 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:30:05,727 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. Second operand 7 states. [2020-07-29 01:30:05,727 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:05,729 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:30:05,729 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:30:05,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:05,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:05,729 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:30:05,730 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 11 states and 15 transitions. [2020-07-29 01:30:05,730 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:30:05,732 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-29 01:30:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:30:05,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:30:05,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:30:05,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:30:05,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:30:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:30:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:30:05,733 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:30:05,733 INFO L591 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:30:05,734 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:30:05,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2020-07-29 01:30:05,734 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:05,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:05,734 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:05,735 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1] [2020-07-29 01:30:05,735 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1] [2020-07-29 01:30:05,735 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; 198#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; 195#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 196#L17-2 assume !(main_~xtmp~0 > 1); 200#L17-3 main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; 199#L13-2 assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; 194#L17-2 [2020-07-29 01:30:05,735 INFO L796 eck$LassoCheckResult]: Loop: 194#L17-2 assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; 194#L17-2 [2020-07-29 01:30:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash 925951131, now seen corresponding path program 2 times [2020-07-29 01:30:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:05,736 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823288980] [2020-07-29 01:30:05,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:05,767 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {262#true} is VALID [2020-07-29 01:30:05,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#true} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {262#true} is VALID [2020-07-29 01:30:05,768 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#true} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {262#true} is VALID [2020-07-29 01:30:05,768 INFO L280 TraceCheckUtils]: 3: Hoare triple {262#true} assume !(main_~xtmp~0 > 1); {264#(<= ULTIMATE.start_main_~xtmp~0 1)} is VALID [2020-07-29 01:30:05,769 INFO L280 TraceCheckUtils]: 4: Hoare triple {264#(<= ULTIMATE.start_main_~xtmp~0 1)} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {265#(<= ULTIMATE.start_main_~x~0 1)} is VALID [2020-07-29 01:30:05,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {265#(<= ULTIMATE.start_main_~x~0 1)} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {263#false} is VALID [2020-07-29 01:30:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-29 01:30:05,771 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823288980] [2020-07-29 01:30:05,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:30:05,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-29 01:30:05,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555951865] [2020-07-29 01:30:05,772 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:30:05,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:05,772 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 2 times [2020-07-29 01:30:05,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:30:05,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346035651] [2020-07-29 01:30:05,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:30:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,776 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:30:05,778 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:30:05,780 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:30:05,799 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:05,799 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:05,799 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:05,799 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:05,799 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:30:05,799 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,800 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:05,800 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:05,800 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration4_Loop [2020-07-29 01:30:05,800 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:05,800 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:05,808 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:30:05,812 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:30:05,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:30:05,824 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:30:05,930 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:05,930 INFO L404 LassoAnalysis]: Checking for nontermination... 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) [2020-07-29 01:30:05,934 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,934 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:05,938 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:30:05,938 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:05,978 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:30:05,978 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:06,018 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:30:06,018 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:06,056 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:30:06,058 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:30:06,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:30:06,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:30:06,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:30:06,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:30:06,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:06,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:30:06,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:30:06,059 INFO L133 ssoRankerPreferences]: Filename of dumped script: Log.c_Iteration4_Loop [2020-07-29 01:30:06,059 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:30:06,059 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:30:06,067 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:30:06,072 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:30:06,080 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:30:06,086 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:30:06,205 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:30:06,205 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:30:06,209 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:30:06,211 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:06,211 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:06,211 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:06,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:06,214 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:30:06,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:30:06,220 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 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:06,255 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:30:06,257 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:30:06,258 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:30:06,258 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:30:06,258 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:30:06,258 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:30:06,259 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:30:06,259 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:06,262 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:30:06,266 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:30:06,267 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 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:30:06,270 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:30:06,270 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:30:06,271 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:30:06,271 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~xtmp~0) = 1*ULTIMATE.start_main_~xtmp~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:30:06,305 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:30:06,308 INFO L393 LassoCheck]: Loop: "assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0;" [2020-07-29 01:30:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,339 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,340 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,341 INFO L280 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {268#unseeded} is VALID [2020-07-29 01:30:06,341 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#unseeded} assume !(main_~xtmp~0 > 1); {268#unseeded} is VALID [2020-07-29 01:30:06,342 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#unseeded} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {268#unseeded} is VALID [2020-07-29 01:30:06,343 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,346 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,351 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {281#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:06,351 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:30:06,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:06,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:06,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,359 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:06,359 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:30:06,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:30:06,390 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:30:06,390 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:06,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:30:06,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,392 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,393 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,393 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:06,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,393 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,394 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:06,394 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,401 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:06,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:06,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,402 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,430 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {268#unseeded} is VALID [2020-07-29 01:30:06,432 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#unseeded} assume !(main_~xtmp~0 > 1); {268#unseeded} is VALID [2020-07-29 01:30:06,432 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#unseeded} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {268#unseeded} is VALID [2020-07-29 01:30:06,433 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,436 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,440 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {281#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:06,441 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:30:06,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:06,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:06,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,447 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:06,447 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:30:06,465 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 13 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:30:06,465 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:30:06,466 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:06,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:30:06,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,468 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,469 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,469 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:06,469 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,470 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,470 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 13 states and 17 transitions. cyclomatic complexity: 7 [2020-07-29 01:30:06,470 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 13 letters. Loop has 13 letters. [2020-07-29 01:30:06,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 17 transitions. cyclomatic complexity: 7 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,483 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:06,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5 transitions. [2020-07-29 01:30:06,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 5 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,484 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:30:06,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:30:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,518 INFO L280 TraceCheckUtils]: 0: Hoare triple {268#unseeded} havoc main_#res;havoc main_#t~nondet0, main_~x~0, main_~xtmp~0, main_~res~0, main_~restmp~0;havoc main_~x~0;havoc main_~xtmp~0;havoc main_~res~0;havoc main_~restmp~0;main_~x~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~res~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {268#unseeded} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {268#unseeded} is VALID [2020-07-29 01:30:06,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {268#unseeded} assume !(main_~xtmp~0 > 1); {268#unseeded} is VALID [2020-07-29 01:30:06,521 INFO L280 TraceCheckUtils]: 4: Hoare triple {268#unseeded} main_~x~0 := main_~xtmp~0;main_~res~0 := 1 + main_~res~0; {268#unseeded} is VALID [2020-07-29 01:30:06,522 INFO L280 TraceCheckUtils]: 5: Hoare triple {268#unseeded} assume !!(main_~x~0 > 1);main_~xtmp~0 := main_~x~0;main_~restmp~0 := 0; {268#unseeded} is VALID [2020-07-29 01:30:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,525 WARN L261 TraceCheckSpWp]: Trace formula consists of 7 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:30:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:30:06,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:30:06,536 INFO L280 TraceCheckUtils]: 0: Hoare triple {271#(>= oldRank0 ULTIMATE.start_main_~xtmp~0)} assume !!(main_~xtmp~0 > 1);main_~xtmp~0 := main_~xtmp~0 - 2;main_~restmp~0 := 1 + main_~restmp~0; {281#(or unseeded (and (> oldRank0 ULTIMATE.start_main_~xtmp~0) (>= oldRank0 0)))} is VALID [2020-07-29 01:30:06,537 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:30:06,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-29 01:30:06,541 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:30:06,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,542 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2020-07-29 01:30:06,542 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4 Second operand 2 states. [2020-07-29 01:30:06,574 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 4. Second operand 2 states. Result 10 states and 12 transitions. Complement of second has 4 states. [2020-07-29 01:30:06,574 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:30:06,574 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,575 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2 states. [2020-07-29 01:30:06,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:30:06,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:30:06,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2020-07-29 01:30:06,581 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:06,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:06,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 7 states and 9 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,582 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,582 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 2 states. [2020-07-29 01:30:06,584 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2020-07-29 01:30:06,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:30:06,584 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,584 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:06,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:30:06,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:06,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:06,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 10 letters. Loop has 10 letters. [2020-07-29 01:30:06,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 7 letters. Loop has 7 letters. [2020-07-29 01:30:06,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:30:06,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 9 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 2 states. Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 12 transitions. cyclomatic complexity: 4 Stem has 1 letters. Loop has 1 letters. [2020-07-29 01:30:06,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,591 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:30:06,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-29 01:30:06,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 9 transitions. [2020-07-29 01:30:06,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 1 letters. [2020-07-29 01:30:06,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 7 letters. Loop has 1 letters. [2020-07-29 01:30:06,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:30:06,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:30:06,594 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 12 transitions. cyclomatic complexity: 4 [2020-07-29 01:30:06,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:06,595 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 0 states and 0 transitions. [2020-07-29 01:30:06,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:06,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:06,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:06,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:06,596 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:06,596 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:06,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:30:06,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:30:06,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:30:06,597 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 4 states. [2020-07-29 01:30:06,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:30:06,597 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-29 01:30:06,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-29 01:30:06,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:30:06,605 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:30:06,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2020-07-29 01:30:06,605 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:06,606 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2020-07-29 01:30:06,606 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:30:06,606 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:30:06,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:30:06,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:30:06,606 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:06,606 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:06,607 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:30:06,607 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:30:06,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:30:06,607 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:30:06,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:30:06,614 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:30:06 BoogieIcfgContainer [2020-07-29 01:30:06,614 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:30:06,615 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:30:06,615 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:30:06,615 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:30:06,616 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:30:01" (3/4) ... [2020-07-29 01:30:06,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:30:06,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:30:06,623 INFO L168 Benchmark]: Toolchain (without parser) took 5461.83 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 207.1 MB). Free memory was 961.6 MB in the beginning and 994.8 MB in the end (delta: -33.2 MB). Peak memory consumption was 173.9 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:06,624 INFO L168 Benchmark]: CDTParser took 0.28 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:30:06,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:06,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:06,626 INFO L168 Benchmark]: Boogie Preprocessor took 83.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:06,626 INFO L168 Benchmark]: RCFGBuilder took 276.70 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:06,627 INFO L168 Benchmark]: BuchiAutomizer took 4777.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 994.8 MB in the end (delta: 116.3 MB). Peak memory consumption was 188.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:30:06,628 INFO L168 Benchmark]: Witness Printer took 5.21 ms. Allocated memory is still 1.2 GB. Free memory is still 994.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:30:06,632 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.28 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 271.99 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.33 ms. Allocated memory is still 1.0 GB. Free memory is still 950.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 83.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.70 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: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4777.36 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 72.4 MB). Free memory was 1.1 GB in the beginning and 994.8 MB in the end (delta: 116.3 MB). Peak memory consumption was 188.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.21 ms. Allocated memory is still 1.2 GB. Free memory is still 994.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 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function x and consists of 4 locations. One deterministic module has affine ranking function xtmp and consists of 3 locations. One nondeterministic module has affine ranking function xtmp and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 7 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 1/1 HoareTripleCheckerStatistics: 26 SDtfs, 33 SDslu, 6 SDs, 0 SdLazy, 35 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital19 mio100 ax168 hnf99 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq158 hnf93 smp100 dnf100 smp100 tf111 neg100 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 3 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...