./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.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 e334e85dd18553afecc96b27cf49a003304cbca8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:33:39,816 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:39,818 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:39,833 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:39,834 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:39,836 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:39,838 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:39,840 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:39,842 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:39,844 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:39,845 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:39,845 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:39,847 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:39,848 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:39,850 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:39,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:39,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:39,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:39,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:39,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:39,861 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:39,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:39,865 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:39,866 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:39,866 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:39,867 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:39,869 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:39,870 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:39,872 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:39,873 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:39,873 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:39,874 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:39,874 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:39,875 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:39,876 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:39,877 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:39,878 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:33:39,896 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:39,896 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:39,898 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:39,898 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:39,898 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:39,899 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:39,899 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:39,899 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:39,899 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:39,899 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:39,899 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:39,900 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:39,900 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:39,900 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:39,900 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:39,900 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:39,902 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:39,902 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:39,902 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:39,903 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:39,903 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:39,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:39,904 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:39,904 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:39,904 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:39,904 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:39,905 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:39,906 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:39,907 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:39,907 INFO L133 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 -> e334e85dd18553afecc96b27cf49a003304cbca8 [2019-01-01 21:33:39,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:39,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:39,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:39,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:39,987 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:39,988 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2019-01-01 21:33:40,073 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b46ce3f/28cde303e15a48edb73203f3a7402c1d/FLAGee9a0a40d [2019-01-01 21:33:40,616 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:40,617 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2019-01-01 21:33:40,625 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b46ce3f/28cde303e15a48edb73203f3a7402c1d/FLAGee9a0a40d [2019-01-01 21:33:40,932 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b46ce3f/28cde303e15a48edb73203f3a7402c1d [2019-01-01 21:33:40,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:40,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:40,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:40,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:40,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:40,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:40" (1/1) ... [2019-01-01 21:33:40,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@161817f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:40, skipping insertion in model container [2019-01-01 21:33:40,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:40" (1/1) ... [2019-01-01 21:33:40,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:40,976 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:41,173 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:41,179 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:41,199 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:41,212 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:41,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41 WrapperNode [2019-01-01 21:33:41,213 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:41,214 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:41,214 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:41,214 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:41,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,265 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:41,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:41,266 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:41,266 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:41,279 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:41,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:41,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:41,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:41,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (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 [2019-01-01 21:33:41,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:41,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:41,635 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:41,635 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:41,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:41 BoogieIcfgContainer [2019-01-01 21:33:41,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:41,637 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:41,637 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:41,641 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:41,642 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,642 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:40" (1/3) ... [2019-01-01 21:33:41,644 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135721cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:41, skipping insertion in model container [2019-01-01 21:33:41,644 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,644 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41" (2/3) ... [2019-01-01 21:33:41,645 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@135721cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:33:41, skipping insertion in model container [2019-01-01 21:33:41,645 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,645 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:41" (3/3) ... [2019-01-01 21:33:41,648 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c [2019-01-01 21:33:41,715 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:41,716 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:41,716 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:41,716 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:41,716 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:41,717 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:41,717 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:41,717 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:41,717 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:41,735 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:41,758 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:41,759 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:41,759 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:41,768 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:41,768 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:41,768 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:41,769 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:41,770 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:41,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:41,770 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:41,771 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:41,771 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:41,782 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~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_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 9#L21-2true [2019-01-01 21:33:41,783 INFO L796 eck$LassoCheckResult]: Loop: 9#L21-2true assume !!(main_~v1~0 > 0); 3#L21true assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 9#L21-2true [2019-01-01 21:33:41,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:41,791 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-01 21:33:41,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:41,796 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:41,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:41,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:41,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:41,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2019-01-01 21:33:41,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:41,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:41,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:41,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:41,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:41,942 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-01 21:33:41,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:41,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:41,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:41,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:41,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:42,165 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:42,193 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:42,194 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:42,194 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:42,194 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:42,194 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:42,195 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,195 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:42,195 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:42,195 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:42,195 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:42,197 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:42,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:42,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:42,317 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:42,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:42,827 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:42,828 INFO L412 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,833 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,834 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:42,861 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:42,861 INFO L448 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 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,871 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,871 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:42,896 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:42,896 INFO L448 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 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,903 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:33:42,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:42,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:43,060 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:43,062 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:43,062 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:43,062 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:43,062 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:43,063 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:43,063 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,063 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:43,063 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:43,063 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:43,063 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:43,064 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:43,066 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:43,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:43,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:43,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:43,463 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:43,469 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:43,471 INFO L122 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 [2019-01-01 21:33:43,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,481 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:43,481 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:43,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:43,490 INFO L122 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 [2019-01-01 21:33:43,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:43,496 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:43,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:43,507 INFO L122 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 [2019-01-01 21:33:43,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:43,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:43,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:43,518 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:43,527 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:43,528 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:43,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:43,533 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:43,534 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:43,534 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v2~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~v2~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2019-01-01 21:33:43,537 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:43,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:43,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:43,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:43,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:43,698 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 [2019-01-01 21:33:43,700 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:33:43,802 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 6 states. [2019-01-01 21:33:43,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:43,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:43,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-01-01 21:33:43,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:33:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:43,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:43,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:33:43,822 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:43,828 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:33:43,830 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:43,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:33:43,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:33:43,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:43,831 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:33:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:33:43,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:33:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:33:43,864 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:43,864 INFO L608 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:43,864 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:43,864 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states and 11 transitions. [2019-01-01 21:33:43,865 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:43,865 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:43,865 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:43,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:33:43,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:43,866 INFO L794 eck$LassoCheckResult]: Stem: 76#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 77#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 78#L21-2 assume !!(main_~v1~0 > 0); 72#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 73#L21-2 [2019-01-01 21:33:43,866 INFO L796 eck$LassoCheckResult]: Loop: 73#L21-2 assume !!(main_~v1~0 > 0); 79#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 73#L21-2 [2019-01-01 21:33:43,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2019-01-01 21:33:43,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:43,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:33:43,976 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:43,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2019-01-01 21:33:43,977 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:44,092 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-01 21:33:44,117 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:44,117 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:44,117 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:44,117 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:44,117 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:44,117 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,118 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:44,118 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:44,118 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:44,118 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:44,118 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:44,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,294 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:44,294 INFO L412 LassoAnalysis]: Checking for nontermination... 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 [2019-01-01 21:33:44,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:44,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:44,320 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:44,321 INFO L448 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:44,326 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,360 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:44,360 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:44,512 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:44,514 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:44,515 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:44,515 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:44,515 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:44,515 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:44,515 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,515 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:44,516 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:44,516 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:44,516 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:44,516 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:44,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:44,873 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-01 21:33:45,210 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:45,211 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:45,211 INFO L122 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 [2019-01-01 21:33:45,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:45,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:45,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:45,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:45,215 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:45,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:45,220 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:45,221 INFO L122 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 [2019-01-01 21:33:45,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:45,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:45,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:45,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:45,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:45,223 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:45,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:45,228 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:45,235 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:45,236 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:45,236 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:45,236 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:45,237 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:45,237 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~m~0, ULTIMATE.start_main_~v2~0) = 1*ULTIMATE.start_main_~m~0 - 1*ULTIMATE.start_main_~v2~0 Supporting invariants [] [2019-01-01 21:33:45,237 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:45,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:45,313 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 [2019-01-01 21:33:45,313 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states and 11 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:45,347 INFO L76 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. [2019-01-01 21:33:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:45,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:45,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:45,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:45,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:45,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:33:45,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,351 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 17 transitions. [2019-01-01 21:33:45,352 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:45,353 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:45,353 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:45,353 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:45,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2019-01-01 21:33:45,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:45,354 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:45,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2019-01-01 21:33:45,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-01 21:33:45,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2019-01-01 21:33:45,357 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2019-01-01 21:33:45,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:33:45,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:33:45,362 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 3 states. [2019-01-01 21:33:45,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:45,387 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2019-01-01 21:33:45,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:33:45,388 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 18 transitions. [2019-01-01 21:33:45,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:45,390 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 13 states and 17 transitions. [2019-01-01 21:33:45,390 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:33:45,390 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:45,390 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 17 transitions. [2019-01-01 21:33:45,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:45,391 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2019-01-01 21:33:45,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 17 transitions. [2019-01-01 21:33:45,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-01-01 21:33:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-01 21:33:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-01-01 21:33:45,393 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:33:45,394 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:33:45,394 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:45,394 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-01-01 21:33:45,395 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:45,395 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:45,395 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:45,396 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 1, 1, 1] [2019-01-01 21:33:45,396 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:45,396 INFO L794 eck$LassoCheckResult]: Stem: 159#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 160#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 161#L21-2 assume !!(main_~v1~0 > 0); 157#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 158#L21-2 assume !!(main_~v1~0 > 0); 155#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 156#L21-2 assume !!(main_~v1~0 > 0); 164#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 162#L21-2 [2019-01-01 21:33:45,396 INFO L796 eck$LassoCheckResult]: Loop: 162#L21-2 assume !!(main_~v1~0 > 0); 163#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 162#L21-2 [2019-01-01 21:33:45,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,397 INFO L82 PathProgramCache]: Analyzing trace with hash -422236399, now seen corresponding path program 1 times [2019-01-01 21:33:45,397 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:45,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:33:45,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 21:33:45,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 21:33:45,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 21:33:45,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 21:33:45,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-01-01 21:33:45,526 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-01 21:33:45,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2019-01-01 21:33:45,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,632 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,632 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,633 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,633 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,633 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:45,633 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,633 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,633 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,634 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:45,634 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,634 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,753 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:45,753 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,757 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:45,757 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:45,779 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:45,779 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_5=1} Honda state: {v_rep~unnamed0~0~true_5=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,789 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:45,789 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,815 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:45,816 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:45,944 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:45,948 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,948 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,948 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,948 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,948 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:45,949 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,949 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,950 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,950 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:45,950 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,950 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:45,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,094 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:46,096 INFO L122 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 [2019-01-01 21:33:46,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:46,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:46,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:46,120 INFO L122 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 [2019-01-01 21:33:46,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:46,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,124 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,125 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:46,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:46,134 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:46,142 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:33:46,143 INFO L444 ModelExtractionUtils]: 0 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:46,143 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:46,143 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:46,144 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:46,144 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v2~0, ULTIMATE.start_main_~m~0) = -1*ULTIMATE.start_main_~v2~0 + 1*ULTIMATE.start_main_~m~0 Supporting invariants [] [2019-01-01 21:33:46,145 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:46,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:46,239 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 [2019-01-01 21:33:46,240 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:33:46,283 INFO L76 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. [2019-01-01 21:33:46,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:46,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:46,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:46,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,285 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:46,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,328 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:46,329 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 [2019-01-01 21:33:46,329 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:33:46,342 INFO L76 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. [2019-01-01 21:33:46,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:46,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:46,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2019-01-01 21:33:46,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:46,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,347 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:46,401 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 [2019-01-01 21:33:46,401 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 7 Second operand 3 states. [2019-01-01 21:33:46,416 INFO L76 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. [2019-01-01 21:33:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:46,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:46,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:46,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:46,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:33:46,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:33:46,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,420 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 23 transitions. [2019-01-01 21:33:46,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:46,422 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 14 states and 19 transitions. [2019-01-01 21:33:46,422 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:46,422 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:46,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-01-01 21:33:46,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:46,424 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-01-01 21:33:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-01-01 21:33:46,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 7. [2019-01-01 21:33:46,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:33:46,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:33:46,426 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:33:46,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 21:33:46,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-01 21:33:46,429 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 5 states. [2019-01-01 21:33:46,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:46,446 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-01 21:33:46,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 21:33:46,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2019-01-01 21:33:46,448 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:33:46,449 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 8 states and 9 transitions. [2019-01-01 21:33:46,449 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:46,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-01 21:33:46,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 9 transitions. [2019-01-01 21:33:46,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:46,450 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-01 21:33:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 9 transitions. [2019-01-01 21:33:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 6. [2019-01-01 21:33:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:33:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:33:46,452 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:33:46,452 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:33:46,452 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:46,453 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 21:33:46,453 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:46,453 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:46,453 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:46,454 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:46,454 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2019-01-01 21:33:46,454 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~m~0, main_~n~0, main_~v1~0, main_~v2~0;havoc main_~m~0;havoc main_~n~0;havoc main_~v1~0;havoc main_~v2~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 373#L17 assume main_~n~0 >= 0 && main_~m~0 > 0;main_~v1~0 := main_~n~0;main_~v2~0 := 0; 369#L21-2 [2019-01-01 21:33:46,454 INFO L796 eck$LassoCheckResult]: Loop: 369#L21-2 assume !!(main_~v1~0 > 0); 370#L21 assume main_~v2~0 < main_~m~0;main_~v2~0 := 1 + main_~v2~0;main_~v1~0 := main_~v1~0 - 1; 371#L21-2 assume !!(main_~v1~0 > 0); 368#L21 assume !(main_~v2~0 < main_~m~0);main_~v2~0 := 0; 369#L21-2 [2019-01-01 21:33:46,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,455 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 2 times [2019-01-01 21:33:46,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,459 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:46,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1326601, now seen corresponding path program 1 times [2019-01-01 21:33:46,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,471 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:46,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 920229996, now seen corresponding path program 2 times [2019-01-01 21:33:46,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:46,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:46,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:46,605 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-01-01 21:33:46,622 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:46,622 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:46,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:46,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:46,623 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:46,623 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,623 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:46,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:46,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:46,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:46,624 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:46,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,745 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,745 INFO L412 LassoAnalysis]: Checking for nontermination... 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,759 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,759 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~v2~0=0, ULTIMATE.start_main_~m~0=1} Honda state: {ULTIMATE.start_main_~v2~0=0, ULTIMATE.start_main_~m~0=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 [2019-01-01 21:33:46,781 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,781 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,802 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,802 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_7=1} Honda state: {v_rep~unnamed0~0~true_7=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-01-01 21:33:46,807 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,808 INFO L163 nArgumentSynthesizer]: Using integer mode. 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 [2019-01-01 21:33:46,835 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:46,835 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,894 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:46,896 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:46,896 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:46,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:46,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:46,897 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:46,897 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,897 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:46,897 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:46,897 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi2_true-termination_true-no-overflow.c_Iteration4_Loop [2019-01-01 21:33:46,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:46,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:46,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:46,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:33:47,017 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:47,017 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:47,018 INFO L122 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 [2019-01-01 21:33:47,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:47,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:47,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:47,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:47,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:47,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:47,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:47,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:47,026 INFO L122 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 [2019-01-01 21:33:47,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:47,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:47,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:47,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:47,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:47,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:47,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:47,035 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:47,039 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:47,039 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:47,039 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:47,040 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:47,040 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:47,040 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~v1~0) = 1*ULTIMATE.start_main_~v1~0 Supporting invariants [] [2019-01-01 21:33:47,040 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:47,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:47,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:47,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:33:47,142 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:33:47,142 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 5 states. [2019-01-01 21:33:47,166 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 5 states. Result 13 states and 15 transitions. Complement of second has 6 states. [2019-01-01 21:33:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:47,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:33:47,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:47,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:47,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:47,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:33:47,169 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:47,169 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 15 transitions. [2019-01-01 21:33:47,170 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:47,171 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-01 21:33:47,171 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:47,171 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:47,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:47,171 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,171 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,171 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:47,172 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:47,172 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:47,172 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:47,172 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:47,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:47 BoogieIcfgContainer [2019-01-01 21:33:47,183 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:47,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:47,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:47,184 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:47,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:33:41" (3/4) ... [2019-01-01 21:33:47,189 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:47,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:47,190 INFO L168 Benchmark]: Toolchain (without parser) took 6252.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 842.2 MB in the end (delta: 109.2 MB). Peak memory consumption was 241.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,192 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,194 INFO L168 Benchmark]: Boogie Preprocessor took 32.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,194 INFO L168 Benchmark]: RCFGBuilder took 336.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,195 INFO L168 Benchmark]: BuchiAutomizer took 5546.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.2 MB in the end (delta: 274.4 MB). Peak memory consumption was 274.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:47,196 INFO L168 Benchmark]: Witness Printer took 5.65 ms. Allocated memory is still 1.2 GB. Free memory is still 842.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:47,201 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.32 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 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 51.97 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.80 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 336.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5546.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 842.2 MB in the end (delta: 274.4 MB). Peak memory consumption was 274.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.65 ms. Allocated memory is still 1.2 GB. Free memory is still 842.2 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 * v2 + m and consists of 4 locations. One deterministic module has affine ranking function m + -1 * v2 and consists of 3 locations. One deterministic module has affine ranking function v1 and consists of 4 locations. One nondeterministic module has affine ranking function -1 * v2 + m and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.4s and 5 iterations. TraceHistogramMax:3. Analysis of lassos took 4.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. 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, 35 SDslu, 12 SDs, 0 SdLazy, 34 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT0 SILN0 SILU0 SILI0 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital18 mio100 ax164 hnf100 lsp34 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq152 hnf93 smp100 dnf100 smp100 tf113 neg100 sie111 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 6 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...