./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.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 500cb8735f650eb0e7c33062ddc23c2166b17f19 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:28:21,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:28:21,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:28:21,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:28:21,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:28:21,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:28:21,679 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:28:21,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:28:21,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:28:21,697 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:28:21,698 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:28:21,699 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:28:21,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:28:21,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:28:21,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:28:21,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:28:21,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:28:21,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:28:21,709 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:28:21,713 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:28:21,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:28:21,721 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:28:21,723 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:28:21,724 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:28:21,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:28:21,727 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:28:21,727 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:28:21,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:28:21,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:28:21,730 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:28:21,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:28:21,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:28:21,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:28:21,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:28:21,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:28:21,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:28:21,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:28:21,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:28:21,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:28:21,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:28:21,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:28:21,739 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:28:21,780 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:28:21,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:28:21,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:28:21,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:28:21,783 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:28:21,784 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:28:21,784 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:28:21,784 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:28:21,784 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:28:21,785 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:28:21,785 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:28:21,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:28:21,787 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:28:21,787 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:28:21,787 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:28:21,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:28:21,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:28:21,788 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:28:21,788 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:28:21,788 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:28:21,788 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:28:21,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:28:21,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:28:21,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:28:21,790 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:28:21,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:28:21,790 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:28:21,790 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:28:21,790 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:28:21,791 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:28:21,792 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 -> 500cb8735f650eb0e7c33062ddc23c2166b17f19 [2020-07-29 01:28:22,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:28:22,109 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:28:22,112 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:28:22,114 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:28:22,114 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:28:22,115 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2020-07-29 01:28:22,194 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1346413d/58eade47180f42f1ae65a4eb77555ecd/FLAG804e73edc [2020-07-29 01:28:22,622 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:28:22,623 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2020-07-29 01:28:22,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1346413d/58eade47180f42f1ae65a4eb77555ecd/FLAG804e73edc [2020-07-29 01:28:23,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1346413d/58eade47180f42f1ae65a4eb77555ecd [2020-07-29 01:28:23,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:28:23,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:28:23,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:23,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:28:23,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:28:23,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bbcdde0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23, skipping insertion in model container [2020-07-29 01:28:23,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:28:23,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:28:23,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:23,246 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:28:23,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:28:23,286 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:28:23,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23 WrapperNode [2020-07-29 01:28:23,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:28:23,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:23,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:28:23,289 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:28:23,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,305 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,421 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:28:23,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:28:23,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:28:23,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:28:23,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,434 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,434 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,447 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... [2020-07-29 01:28:23,448 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:28:23,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:28:23,449 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:28:23,449 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:28:23,450 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:23,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:28:23,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:28:23,690 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:28:23,691 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-29 01:28:23,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:23 BoogieIcfgContainer [2020-07-29 01:28:23,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:28:23,695 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:28:23,695 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:28:23,705 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:28:23,706 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:23,706 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:28:23" (1/3) ... [2020-07-29 01:28:23,707 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782862fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:23, skipping insertion in model container [2020-07-29 01:28:23,708 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:23,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:28:23" (2/3) ... [2020-07-29 01:28:23,708 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@782862fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:28:23, skipping insertion in model container [2020-07-29 01:28:23,708 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:28:23,708 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:23" (3/3) ... [2020-07-29 01:28:23,710 INFO L371 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c [2020-07-29 01:28:23,759 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:28:23,760 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:28:23,760 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:28:23,760 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:28:23,760 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:28:23,760 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:28:23,760 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:28:23,760 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:28:23,772 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:23,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:23,794 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:23,794 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:23,799 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:23,799 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:23,799 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:28:23,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:23,802 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:23,802 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:23,802 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:23,802 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:23,802 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:23,808 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; 9#L21-2true [2020-07-29 01:28:23,809 INFO L796 eck$LassoCheckResult]: Loop: 9#L21-2true assume !!(main_~i~0 < main_~n~0); 3#L21true assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; 9#L21-2true [2020-07-29 01:28:23,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:23,813 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2020-07-29 01:28:23,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:23,822 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912630041] [2020-07-29 01:28:23,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,911 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,925 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:23,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:23,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2020-07-29 01:28:23,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:23,927 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272994134] [2020-07-29 01:28:23,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,934 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,940 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,941 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:23,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2020-07-29 01:28:23,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:23,944 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049132890] [2020-07-29 01:28:23,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,956 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:23,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:23,967 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:24,049 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:24,050 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:24,050 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:24,050 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:24,051 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:24,051 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,052 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:24,052 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:24,052 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration1_Loop [2020-07-29 01:28:24,053 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:24,053 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:24,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,369 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:24,370 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,385 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,385 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,397 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:24,397 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~false_1=0} Honda state: {v_rep~unnamed0~0~false_1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,443 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,443 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,449 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:24,449 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_1=1} Honda state: {v_rep~unnamed0~0~true_1=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,494 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,495 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:28:24,500 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:24,500 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~i~0=0} Honda state: {ULTIMATE.start_main_~n~0=1, ULTIMATE.start_main_~i~0=0} 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,540 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:24,541 INFO L160 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,568 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:24,568 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:24,713 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:24,715 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:24,715 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:24,716 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:24,716 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:24,716 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:24,716 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,717 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:24,717 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:24,717 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration1_Loop [2020-07-29 01:28:24,717 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:24,718 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:24,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,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:28:24,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:24,891 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:24,897 INFO L489 LassoAnalysis]: Using template 'affine'. 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:28:24,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:24,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:24,905 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:24,905 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:24,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:24,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:24,909 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:24,909 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,947 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:24,950 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:24,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:24,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:24,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:24,956 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:24,957 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:24,962 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:24,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:25,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:25,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:25,001 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:25,001 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:25,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:25,005 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:28:25,010 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) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:25,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:25,053 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:25,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:25,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:25,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:25,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:25,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:25,059 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:25,065 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:25,066 INFO L444 ModelExtractionUtils]: 1 out of 4 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:25,082 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:25,083 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:25,083 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:25,084 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,125 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:25,137 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);" "assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0;" [2020-07-29 01:28:25,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:25,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:25,208 INFO L280 TraceCheckUtils]: 0: Hoare triple {18#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {18#unseeded} is VALID [2020-07-29 01:28:25,209 INFO L280 TraceCheckUtils]: 1: Hoare triple {18#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {18#unseeded} is VALID [2020-07-29 01:28:25,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,215 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:25,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume !!(main_~i~0 < main_~n~0); {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} is VALID [2020-07-29 01:28:25,228 INFO L280 TraceCheckUtils]: 1: Hoare triple {21#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {31#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))) unseeded)} is VALID [2020-07-29 01:28:25,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:25,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:25,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:25,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,261 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:28:25,262 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2020-07-29 01:28:25,344 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2020-07-29 01:28:25,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:25,345 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:25,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2020-07-29 01:28:25,349 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:25,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:25,353 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:25,354 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,354 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 35 transitions. [2020-07-29 01:28:25,356 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:25,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,357 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,359 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states. [2020-07-29 01:28:25,361 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:25,362 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:25,362 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:25,364 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:28:25,365 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:25,365 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:25,366 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:25,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:25,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:25,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 28 letters. Loop has 28 letters. [2020-07-29 01:28:25,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:25,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:25,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:25,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:25,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:25,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:25,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 2 letters. [2020-07-29 01:28:25,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:25,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:25,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:28:25,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:25,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:25,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:25,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 28 states and 35 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:25,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,387 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:25,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2020-07-29 01:28:25,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:28:25,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:25,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:25,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:25,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:25,400 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:25,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2020-07-29 01:28:25,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:25,407 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2020-07-29 01:28:25,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2020-07-29 01:28:25,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:25,408 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2020-07-29 01:28:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-29 01:28:25,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:25,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:25,438 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:25,440 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 8 states. [2020-07-29 01:28:25,444 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:25,446 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:25,447 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:25,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:25,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:25,449 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:25,449 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states and 11 transitions. [2020-07-29 01:28:25,449 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:25,451 INFO L93 Difference]: Finished difference Result 8 states and 11 transitions. [2020-07-29 01:28:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:25,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:25,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:25,452 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:25,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-29 01:28:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-29 01:28:25,455 INFO L711 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:25,455 INFO L591 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-29 01:28:25,455 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:28:25,456 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2020-07-29 01:28:25,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:25,456 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:25,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:25,457 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 01:28:25,457 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:25,458 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 83#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; 84#L21-2 assume !!(main_~i~0 < main_~n~0); 78#L21 assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; 79#L21-2 [2020-07-29 01:28:25,458 INFO L796 eck$LassoCheckResult]: Loop: 79#L21-2 assume !!(main_~i~0 < main_~n~0); 85#L21 assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; 79#L21-2 [2020-07-29 01:28:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2020-07-29 01:28:25,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:25,459 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8545078] [2020-07-29 01:28:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:25,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:25,533 INFO L280 TraceCheckUtils]: 0: Hoare triple {129#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {129#true} is VALID [2020-07-29 01:28:25,534 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {131#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:25,535 INFO L280 TraceCheckUtils]: 2: Hoare triple {131#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {131#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:25,539 INFO L280 TraceCheckUtils]: 3: Hoare triple {131#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {130#false} is VALID [2020-07-29 01:28:25,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:25,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8545078] [2020-07-29 01:28:25,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:28:25,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-29 01:28:25,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237317296] [2020-07-29 01:28:25,549 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:28:25,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:25,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2020-07-29 01:28:25,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:25,551 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912532466] [2020-07-29 01:28:25,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,567 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:25,574 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:25,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:25,616 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:25,616 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:25,616 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:25,617 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:25,617 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:25,617 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,617 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:25,617 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:25,617 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration2_Loop [2020-07-29 01:28:25,617 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:25,618 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:25,627 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:25,766 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:25,766 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:25,771 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,771 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,776 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:25,776 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:25,814 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,814 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2020-07-29 01:28:25,818 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 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:28:25,843 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:25,843 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,875 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:25,875 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:25,997 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:25,999 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:25,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:25,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:25,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:25,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:25,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:25,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:26,000 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:26,000 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration2_Loop [2020-07-29 01:28:26,002 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:26,003 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:26,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,144 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:26,144 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,150 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:26,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:28:26,159 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:26,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:28:26,212 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,212 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,212 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,212 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,221 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:28:26,221 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,232 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:26,289 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:26,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:26,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:26,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:26,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:26,292 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:26,293 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:26,293 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,296 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:26,300 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:26,300 INFO L444 ModelExtractionUtils]: 0 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:28:26,312 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:26,312 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:26,312 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:26,313 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,350 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:26,353 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);" "assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0;" [2020-07-29 01:28:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:26,391 INFO L280 TraceCheckUtils]: 0: Hoare triple {134#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {134#unseeded} is VALID [2020-07-29 01:28:26,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {134#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {134#unseeded} is VALID [2020-07-29 01:28:26,392 INFO L280 TraceCheckUtils]: 2: Hoare triple {134#unseeded} assume !!(main_~i~0 < main_~n~0); {134#unseeded} is VALID [2020-07-29 01:28:26,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {134#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {134#unseeded} is VALID [2020-07-29 01:28:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,402 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:26,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {137#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume !!(main_~i~0 < main_~n~0); {137#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} is VALID [2020-07-29 01:28:26,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {137#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {147#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))) unseeded)} is VALID [2020-07-29 01:28:26,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:26,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:26,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:26,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,418 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:28:26,418 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 01:28:26,451 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 17 transitions. Complement of second has 5 states. [2020-07-29 01:28:26,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:26,451 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:26,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:26,451 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,451 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,452 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:26,454 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,454 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,454 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,455 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:26,456 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,457 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,457 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 8 states and 11 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:26,459 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:26,459 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:26,460 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,463 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:26,463 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:26,464 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 8 letters. Loop has 8 letters. [2020-07-29 01:28:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:26,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 5 letters. Loop has 2 letters. [2020-07-29 01:28:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 11 transitions. cyclomatic complexity: 5 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 17 transitions. cyclomatic complexity: 8 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:28:26,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,484 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:26,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:26,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 01:28:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 01:28:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:28:26,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:26,489 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. cyclomatic complexity: 8 [2020-07-29 01:28:26,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,496 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:28:26,497 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2020-07-29 01:28:26,497 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:26,497 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-07-29 01:28:26,497 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:26,498 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:26,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-07-29 01:28:26,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:28:26,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:26,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,504 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,504 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,505 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,507 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:28:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:26,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,508 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:28:26,509 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:28:26,510 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,513 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:28:26,514 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:28:26,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:26,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:26,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:28:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:28:26,518 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:28:26,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-29 01:28:26,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-29 01:28:26,522 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2020-07-29 01:28:26,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:26,539 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-29 01:28:26,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-29 01:28:26,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:26,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:26,548 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2020-07-29 01:28:26,549 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,550 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2020-07-29 01:28:26,550 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:28:26,550 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:26,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2020-07-29 01:28:26,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:26,551 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-29 01:28:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2020-07-29 01:28:26,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-29 01:28:26,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:26,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,552 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,552 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand 12 states. [2020-07-29 01:28:26,553 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,554 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:28:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:28:26,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,555 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 13 states and 17 transitions. [2020-07-29 01:28:26,555 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 13 states and 17 transitions. [2020-07-29 01:28:26,556 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:26,557 INFO L93 Difference]: Finished difference Result 13 states and 17 transitions. [2020-07-29 01:28:26,557 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2020-07-29 01:28:26,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:26,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:26,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:26,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:26,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:28:26,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:28:26,559 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:28:26,559 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:28:26,559 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:28:26,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:28:26,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:26,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:26,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:26,561 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2020-07-29 01:28:26,561 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:28:26,561 INFO L794 eck$LassoCheckResult]: Stem: 269#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 270#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; 271#L21-2 assume !!(main_~i~0 < main_~n~0); 267#L21 assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; 268#L21-2 assume !!(main_~i~0 < main_~n~0); 265#L21 assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; 266#L21-2 assume !!(main_~i~0 < main_~n~0); 274#L21 assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; 272#L21-2 [2020-07-29 01:28:26,561 INFO L796 eck$LassoCheckResult]: Loop: 272#L21-2 assume !!(main_~i~0 < main_~n~0); 273#L21 assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; 272#L21-2 [2020-07-29 01:28:26,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,562 INFO L82 PathProgramCache]: Analyzing trace with hash -422236399, now seen corresponding path program 1 times [2020-07-29 01:28:26,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:26,562 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333314136] [2020-07-29 01:28:26,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {342#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {342#true} is VALID [2020-07-29 01:28:26,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {342#true} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,610 INFO L280 TraceCheckUtils]: 2: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,611 INFO L280 TraceCheckUtils]: 3: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,611 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {345#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,613 INFO L280 TraceCheckUtils]: 6: Hoare triple {345#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {345#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,614 INFO L280 TraceCheckUtils]: 7: Hoare triple {345#(<= (+ ULTIMATE.start_main_~j~0 1) ULTIMATE.start_main_~m~0)} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {343#false} is VALID [2020-07-29 01:28:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:28:26,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333314136] [2020-07-29 01:28:26,615 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627835636] [2020-07-29 01:28:26,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:28:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-29 01:28:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:26,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:26,697 INFO L280 TraceCheckUtils]: 0: Hoare triple {342#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {342#true} is VALID [2020-07-29 01:28:26,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {342#true} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,701 INFO L280 TraceCheckUtils]: 3: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !!(main_~i~0 < main_~n~0); {344#(<= 1 ULTIMATE.start_main_~m~0)} is VALID [2020-07-29 01:28:26,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {344#(<= 1 ULTIMATE.start_main_~m~0)} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {364#(and (<= 1 ULTIMATE.start_main_~m~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:28:26,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {364#(and (<= 1 ULTIMATE.start_main_~m~0) (<= ULTIMATE.start_main_~j~0 0))} assume !!(main_~i~0 < main_~n~0); {364#(and (<= 1 ULTIMATE.start_main_~m~0) (<= ULTIMATE.start_main_~j~0 0))} is VALID [2020-07-29 01:28:26,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {364#(and (<= 1 ULTIMATE.start_main_~m~0) (<= ULTIMATE.start_main_~j~0 0))} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {343#false} is VALID [2020-07-29 01:28:26,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-29 01:28:26,706 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-29 01:28:26,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2020-07-29 01:28:26,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88813510] [2020-07-29 01:28:26,707 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:28:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2020-07-29 01:28:26,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:26,709 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551761485] [2020-07-29 01:28:26,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:26,723 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:26,725 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:26,745 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:26,745 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:26,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:26,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:26,745 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:26,746 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:26,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:26,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:26,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration3_Loop [2020-07-29 01:28:26,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:26,746 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:26,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:26,952 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:26,952 INFO L404 LassoAnalysis]: Checking for nontermination... 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:28:26,964 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:26,964 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,005 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:27,005 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:27,134 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:27,136 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:27,136 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:27,136 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:27,136 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:27,136 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:27,136 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,137 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:27,137 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:27,137 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration3_Loop [2020-07-29 01:28:27,137 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:27,137 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:27,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,259 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:27,260 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-07-29 01:28:27,265 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,266 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:27,266 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:27,267 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:27,267 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:27,267 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:27,268 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:27,268 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:27,271 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:27,274 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-07-29 01:28:27,274 INFO L444 ModelExtractionUtils]: 1 out of 4 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,277 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:27,277 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:27,277 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:27,277 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~j~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2020-07-29 01:28:27,304 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:27,306 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);" "assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0;" [2020-07-29 01:28:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,344 INFO L280 TraceCheckUtils]: 0: Hoare triple {370#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {370#unseeded} is VALID [2020-07-29 01:28:27,344 INFO L280 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {370#unseeded} is VALID [2020-07-29 01:28:27,345 INFO L280 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,345 INFO L280 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {370#unseeded} is VALID [2020-07-29 01:28:27,346 INFO L280 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,346 INFO L280 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,347 INFO L280 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,347 INFO L280 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,352 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,364 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume !!(main_~i~0 < main_~n~0); {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} is VALID [2020-07-29 01:28:27,365 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {383#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))) unseeded)} is VALID [2020-07-29 01:28:27,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:27,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:27,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,371 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:28:27,372 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:28:27,393 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:28:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,393 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,393 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,394 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:27,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:28:27,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,396 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,397 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,397 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:27,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,397 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,397 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:27,398 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,406 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:27,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,407 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:27,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,445 INFO L280 TraceCheckUtils]: 0: Hoare triple {370#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {370#unseeded} is VALID [2020-07-29 01:28:27,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {370#unseeded} is VALID [2020-07-29 01:28:27,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,446 INFO L280 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {370#unseeded} is VALID [2020-07-29 01:28:27,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,449 INFO L280 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,450 INFO L280 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,455 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,461 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume !!(main_~i~0 < main_~n~0); {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} is VALID [2020-07-29 01:28:27,462 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {383#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))) unseeded)} is VALID [2020-07-29 01:28:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:27,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:27,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,469 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:28:27,469 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:28:27,493 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 5 states. [2020-07-29 01:28:27,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,494 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:27,497 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,497 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,497 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-07-29 01:28:27,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,499 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:27,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,500 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,500 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 14 states and 20 transitions. cyclomatic complexity: 9 [2020-07-29 01:28:27,503 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 14 letters. [2020-07-29 01:28:27,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 20 transitions. cyclomatic complexity: 9 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,515 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:27,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-07-29 01:28:27,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,517 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-07-29 01:28:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,554 INFO L280 TraceCheckUtils]: 0: Hoare triple {370#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {370#unseeded} is VALID [2020-07-29 01:28:27,555 INFO L280 TraceCheckUtils]: 1: Hoare triple {370#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {370#unseeded} is VALID [2020-07-29 01:28:27,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {370#unseeded} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {370#unseeded} is VALID [2020-07-29 01:28:27,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,561 INFO L280 TraceCheckUtils]: 5: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,562 INFO L280 TraceCheckUtils]: 6: Hoare triple {370#unseeded} assume !!(main_~i~0 < main_~n~0); {370#unseeded} is VALID [2020-07-29 01:28:27,562 INFO L280 TraceCheckUtils]: 7: Hoare triple {370#unseeded} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {370#unseeded} is VALID [2020-07-29 01:28:27,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,567 WARN L261 TraceCheckSpWp]: Trace formula consists of 6 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:27,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:27,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:27,572 INFO L280 TraceCheckUtils]: 0: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume !!(main_~i~0 < main_~n~0); {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} is VALID [2020-07-29 01:28:27,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {373#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {383#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~j~0) ULTIMATE.start_main_~m~0))) unseeded)} is VALID [2020-07-29 01:28:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:28:27,573 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:27,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:27,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,583 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:28:27,583 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-07-29 01:28:27,606 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 16 states and 23 transitions. Complement of second has 4 states. [2020-07-29 01:28:27,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:28:27,606 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,607 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,607 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,607 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:27,608 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,608 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,608 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2020-07-29 01:28:27,609 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:27,609 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,609 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 7 [2020-07-29 01:28:27,609 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:27,609 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:27,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:27,610 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,610 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 23 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:27,611 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:27,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:28:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:28:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 9 letters. Loop has 2 letters. [2020-07-29 01:28:27,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 7 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 23 transitions. cyclomatic complexity: 10 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,618 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:27,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:27,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2020-07-29 01:28:27,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:28:27,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:28:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2020-07-29 01:28:27,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:27,620 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. cyclomatic complexity: 10 [2020-07-29 01:28:27,621 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:27,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2020-07-29 01:28:27,622 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2020-07-29 01:28:27,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2020-07-29 01:28:27,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 01:28:27,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:27,623 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:28:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 01:28:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2020-07-29 01:28:27,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:27,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 7 states. [2020-07-29 01:28:27,624 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 7 states. [2020-07-29 01:28:27,624 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 7 states. [2020-07-29 01:28:27,625 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,626 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:28:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:28:27,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,627 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 14 states and 19 transitions. [2020-07-29 01:28:27,627 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 14 states and 19 transitions. [2020-07-29 01:28:27,627 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,628 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 01:28:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 01:28:27,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:27,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-29 01:28:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2020-07-29 01:28:27,630 INFO L711 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2020-07-29 01:28:27,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:28:27,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:28:27,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-29 01:28:27,631 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2020-07-29 01:28:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:28:27,645 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2020-07-29 01:28:27,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:28:27,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:28:27,655 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:28:27,656 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2020-07-29 01:28:27,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-29 01:28:27,657 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 9 transitions. [2020-07-29 01:28:27,657 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2020-07-29 01:28:27,658 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2020-07-29 01:28:27,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2020-07-29 01:28:27,658 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:28:27,658 INFO L688 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-29 01:28:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2020-07-29 01:28:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2020-07-29 01:28:27,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:28:27,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states and 9 transitions. Second operand 6 states. [2020-07-29 01:28:27,659 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states and 9 transitions. Second operand 6 states. [2020-07-29 01:28:27,659 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 6 states. [2020-07-29 01:28:27,660 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,660 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:27,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,661 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 8 states and 9 transitions. [2020-07-29 01:28:27,661 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 8 states and 9 transitions. [2020-07-29 01:28:27,662 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:28:27,662 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-29 01:28:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-29 01:28:27,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:28:27,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:28:27,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:28:27,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:28:27,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-29 01:28:27,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2020-07-29 01:28:27,664 INFO L711 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:27,664 INFO L591 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2020-07-29 01:28:27,664 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:28:27,664 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2020-07-29 01:28:27,665 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 01:28:27,665 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:27,665 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:27,665 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-29 01:28:27,665 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:28:27,666 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 618#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; 614#L21-2 [2020-07-29 01:28:27,666 INFO L796 eck$LassoCheckResult]: Loop: 614#L21-2 assume !!(main_~i~0 < main_~n~0); 615#L21 assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; 616#L21-2 assume !!(main_~i~0 < main_~n~0); 613#L21 assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; 614#L21-2 [2020-07-29 01:28:27,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,666 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2020-07-29 01:28:27,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777517462] [2020-07-29 01:28:27,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,674 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,676 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1326601, now seen corresponding path program 1 times [2020-07-29 01:28:27,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759586570] [2020-07-29 01:28:27,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,685 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,686 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:27,687 INFO L82 PathProgramCache]: Analyzing trace with hash 920229996, now seen corresponding path program 2 times [2020-07-29 01:28:27,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:28:27,687 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50756695] [2020-07-29 01:28:27,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:28:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,693 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:28:27,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:28:27,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:28:27,786 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:27,786 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:27,786 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:27,786 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:27,786 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2020-07-29 01:28:27,786 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,786 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:27,787 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:27,787 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration4_Loop [2020-07-29 01:28:27,787 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:27,787 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:27,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,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:28:27,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:27,928 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:27,928 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:28:27,931 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2020-07-29 01:28:27,931 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 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:27,959 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2020-07-29 01:28:27,959 INFO L160 nArgumentSynthesizer]: Using integer mode. [2020-07-29 01:28:28,085 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2020-07-29 01:28:28,087 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:28:28,087 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:28:28,087 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:28:28,087 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:28:28,087 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:28:28,087 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,087 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:28:28,088 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:28:28,088 INFO L133 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi3.c_Iteration4_Loop [2020-07-29 01:28:28,088 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:28:28,088 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:28:28,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:28:28,238 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:28:28,238 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,242 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 01:28:28,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:28:28,244 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:28:28,244 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:28:28,244 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:28:28,244 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:28:28,245 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:28:28,245 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:28:28,247 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:28:28,253 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-07-29 01:28:28,253 INFO L444 ModelExtractionUtils]: 0 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:28:28,256 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:28:28,256 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-29 01:28:28,257 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:28:28,257 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~n~0, ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~n~0 - 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-07-29 01:28:28,279 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2020-07-29 01:28:28,282 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~n~0);" "assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0;" "assume !!(main_~i~0 < main_~n~0);" "assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0;" [2020-07-29 01:28:28,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:28:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:28:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:28,317 INFO L280 TraceCheckUtils]: 0: Hoare triple {671#unseeded} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~j~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~j~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; {671#unseeded} is VALID [2020-07-29 01:28:28,319 INFO L280 TraceCheckUtils]: 1: Hoare triple {671#unseeded} assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := 0;main_~j~0 := 0; {671#unseeded} is VALID [2020-07-29 01:28:28,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:28:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:28:28,327 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:28:28,353 INFO L280 TraceCheckUtils]: 0: Hoare triple {674#(>= oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0)))} assume !!(main_~i~0 < main_~n~0); {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:28,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume main_~j~0 < main_~m~0;main_~j~0 := 1 + main_~j~0; {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:28,355 INFO L280 TraceCheckUtils]: 2: Hoare triple {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !!(main_~i~0 < main_~n~0); {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} is VALID [2020-07-29 01:28:28,356 INFO L280 TraceCheckUtils]: 3: Hoare triple {692#(and (<= ULTIMATE.start_main_~n~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~n~0))} assume !(main_~j~0 < main_~m~0);main_~j~0 := 0;main_~i~0 := 1 + main_~i~0; {684#(or (and (> oldRank0 (+ ULTIMATE.start_main_~n~0 (* (- 1) ULTIMATE.start_main_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 01:28:28,356 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:28:28,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:28:28,363 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:28:28,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,364 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 01:28:28,364 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 3 states. [2020-07-29 01:28:28,389 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 11 states and 14 transitions. Complement of second has 4 states. [2020-07-29 01:28:28,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:28:28,390 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:28,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:28,390 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,390 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,390 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:28:28,391 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:28,391 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:28:28,391 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:28:28,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. [2020-07-29 01:28:28,392 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:28,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:28,392 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 6 states and 7 transitions. cyclomatic complexity: 2 [2020-07-29 01:28:28,393 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:28:28,393 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:28:28,394 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:28:28,394 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:28:28,394 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:28,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:28,394 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:28,394 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2020-07-29 01:28:28,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 11 letters. [2020-07-29 01:28:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:28,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 6 letters. Loop has 6 letters. [2020-07-29 01:28:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:28:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 5 letters. Loop has 4 letters. [2020-07-29 01:28:28,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 7 transitions. cyclomatic complexity: 2 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 14 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:28:28,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,401 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:28:28,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:28:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2020-07-29 01:28:28,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 4 letters. [2020-07-29 01:28:28,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 4 letters. [2020-07-29 01:28:28,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 2 letters. Loop has 8 letters. [2020-07-29 01:28:28,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:28:28,403 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 14 transitions. cyclomatic complexity: 5 [2020-07-29 01:28:28,404 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:28,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 0 states and 0 transitions. [2020-07-29 01:28:28,404 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-29 01:28:28,404 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-29 01:28:28,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-29 01:28:28,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:28:28,404 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:28,405 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:28,405 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-29 01:28:28,405 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:28:28,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-29 01:28:28,405 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-29 01:28:28,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-29 01:28:28,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:28:28 BoogieIcfgContainer [2020-07-29 01:28:28,413 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:28:28,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:28:28,413 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:28:28,413 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:28:28,414 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:28:23" (3/4) ... [2020-07-29 01:28:28,418 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-07-29 01:28:28,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:28:28,421 INFO L168 Benchmark]: Toolchain (without parser) took 5386.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 217.1 MB). Free memory was 954.9 MB in the beginning and 978.9 MB in the end (delta: -24.0 MB). Peak memory consumption was 193.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:28,422 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:28,422 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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:28:28,423 INFO L168 Benchmark]: Boogie Procedure Inliner took 133.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:28,424 INFO L168 Benchmark]: Boogie Preprocessor took 26.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:28,425 INFO L168 Benchmark]: RCFGBuilder took 246.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:28,425 INFO L168 Benchmark]: BuchiAutomizer took 4717.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 154.4 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:28:28,426 INFO L168 Benchmark]: Witness Printer took 4.94 ms. Allocated memory is still 1.2 GB. Free memory is still 978.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:28:28,430 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 251.46 ms. Allocated memory is still 1.0 GB. Free memory was 954.9 MB in the beginning and 944.1 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 133.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 944.1 MB in the beginning and 1.2 GB in the end (delta: -208.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 246.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4717.43 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 978.9 MB in the end (delta: 154.4 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.94 ms. Allocated memory is still 1.2 GB. Free memory is still 978.9 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 6 terminating modules (2 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -1 * j + m and consists of 4 locations. One deterministic module has affine ranking function -1 * j + m and consists of 3 locations. One deterministic module has affine ranking function n + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function -1 * j + m 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.6s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 3.6s. Construction of modules took 0.0s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/2 HoareTripleCheckerStatistics: 45 SDtfs, 40 SDslu, 11 SDs, 0 SdLazy, 32 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax182 hnf99 lsp39 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 19ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.7s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...