./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_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-speedpldi4_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 f560e32afd5a40adf4a98abbf810cb377947c4f4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:40,048 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:33:40,049 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:33:40,061 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:33:40,062 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:33:40,063 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:33:40,064 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:33:40,073 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:33:40,075 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:33:40,076 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:33:40,077 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:33:40,077 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:33:40,078 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:33:40,079 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:33:40,080 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:33:40,081 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:33:40,082 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:33:40,084 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:33:40,086 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:33:40,087 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:33:40,088 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:33:40,089 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:33:40,092 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:33:40,098 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:33:40,098 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:33:40,099 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:33:40,100 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:33:40,101 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:33:40,105 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:33:40,107 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:33:40,108 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:33:40,108 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:33:40,108 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:33:40,112 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:33:40,113 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:33:40,114 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:33:40,114 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:40,137 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:33:40,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:33:40,139 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:33:40,139 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:33:40,139 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:33:40,139 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:33:40,140 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:33:40,140 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:33:40,140 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:33:40,140 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:33:40,140 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:33:40,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:33:40,141 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:33:40,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:33:40,141 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:33:40,141 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:33:40,141 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:33:40,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:33:40,142 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:33:40,142 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:33:40,142 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:33:40,142 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:33:40,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:33:40,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:33:40,143 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:33:40,143 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:33:40,143 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:33:40,143 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:33:40,145 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:33:40,145 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 -> f560e32afd5a40adf4a98abbf810cb377947c4f4 [2019-01-01 21:33:40,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:33:40,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:33:40,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:33:40,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:33:40,207 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:33:40,208 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-01 21:33:40,278 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01614757/51c8a3a5c8554688843f8cfcc38d8853/FLAGcc742ea00 [2019-01-01 21:33:40,694 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:33:40,695 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-01 21:33:40,701 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01614757/51c8a3a5c8554688843f8cfcc38d8853/FLAGcc742ea00 [2019-01-01 21:33:41,068 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f01614757/51c8a3a5c8554688843f8cfcc38d8853 [2019-01-01 21:33:41,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:33:41,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:33:41,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:41,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:33:41,079 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:33:41,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,084 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54ab2667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:33:41, skipping insertion in model container [2019-01-01 21:33:41,084 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:33:41" (1/1) ... [2019-01-01 21:33:41,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:33:41,111 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:33:41,341 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:41,347 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:33:41,368 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:33:41,386 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:33:41,387 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,387 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:33:41,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:41,388 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:33:41,389 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:33:41,400 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,407 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,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:33:41,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:33:41,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:33:41,434 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:33:41,445 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,446 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,446 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,447 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,450 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,457 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,460 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,461 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:33:41,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:33:41,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:33:41,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:33:41,463 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,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:33:41,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:33:41,916 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:33:41,917 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-01 21:33:41,917 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,917 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:33:41,918 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:33:41,918 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:33:41,922 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:33:41,923 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:33:41" (1/3) ... [2019-01-01 21:33:41,924 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2520366d 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,924 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,924 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,925 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2520366d 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,925 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:33:41,925 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,927 INFO L375 chiAutomizerObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c [2019-01-01 21:33:41,992 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:33:41,993 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:33:41,993 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:33:41,993 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:33:41,993 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:33:41,994 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:33:41,994 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:33:41,994 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:33:41,994 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:33:42,016 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:42,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:42,050 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:42,050 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:42,065 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:42,065 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:42,065 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:33:42,065 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8 states. [2019-01-01 21:33:42,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:42,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:42,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:42,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:33:42,071 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:42,093 INFO L794 eck$LassoCheckResult]: Stem: 3#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 6#L17true assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 8#L20-2true [2019-01-01 21:33:42,093 INFO L796 eck$LassoCheckResult]: Loop: 8#L20-2true assume !!(main_~i~0 > 0); 10#L20true assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 8#L20-2true [2019-01-01 21:33:42,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 996, now seen corresponding path program 1 times [2019-01-01 21:33:42,113 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:42,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:42,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:42,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:42,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:42,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 1 times [2019-01-01 21:33:42,244 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:42,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:42,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:42,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:42,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:42,256 INFO L82 PathProgramCache]: Analyzing trace with hash 957575, now seen corresponding path program 1 times [2019-01-01 21:33:42,256 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:42,256 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:42,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:42,374 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:42,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:33:42,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 21:33:42,441 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:42,442 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:42,442 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:42,442 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:42,442 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:42,442 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:42,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:42,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:42,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:42,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:42,468 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,513 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,554 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,691 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:42,691 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,702 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:42,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:42,744 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: [] [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe 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,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,751 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:42,772 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:42,772 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,779 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:42,779 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,805 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:42,805 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:42,831 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:42,833 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:42,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:42,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:42,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:42,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:42,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:42,834 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:42,834 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:42,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration1_Loop [2019-01-01 21:33:42,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:42,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:42,838 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,867 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,902 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,020 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-01 21:33:43,286 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:43,291 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:43,294 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,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:43,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:43,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:43,310 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,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:43,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:43,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:43,325 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,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:43,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:43,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:43,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:43,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:43,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:43,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:43,341 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:43,346 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:43,346 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:43,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:43,349 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:43,349 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:43,350 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:43,352 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:43,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:43,472 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:43,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:43,545 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,561 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:43,562 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 8 states. Second operand 3 states. [2019-01-01 21:33:43,643 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 8 states.. Second operand 3 states. Result 28 states and 35 transitions. Complement of second has 8 states. [2019-01-01 21:33:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:43,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:43,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-01-01 21:33:43,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 2 letters. [2019-01-01 21:33:43,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:43,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:33:43,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:43,651 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 35 transitions. [2019-01-01 21:33:43,655 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:43,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 8 states and 11 transitions. [2019-01-01 21:33:43,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-01 21:33:43,660 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:33:43,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 11 transitions. [2019-01-01 21:33:43,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:43,662 INFO L705 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:43,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states and 11 transitions. [2019-01-01 21:33:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-01 21:33:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-01 21:33:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2019-01-01 21:33:43,687 INFO L728 BuchiCegarLoop]: Abstraction has 8 states and 11 transitions. [2019-01-01 21:33:43,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 21:33:43,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 21:33:43,691 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 3 states. [2019-01-01 21:33:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:33:43,731 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-01-01 21:33:43,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 21:33:43,733 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 7 states and 8 transitions. [2019-01-01 21:33:43,733 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:43,734 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 7 states to 6 states and 7 transitions. [2019-01-01 21:33:43,734 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:43,734 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-01 21:33:43,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 7 transitions. [2019-01-01 21:33:43,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:43,735 INFO L705 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:33:43,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states and 7 transitions. [2019-01-01 21:33:43,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-01 21:33:43,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-01 21:33:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-01 21:33:43,737 INFO L728 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:33:43,738 INFO L608 BuchiCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-01 21:33:43,738 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:33:43,738 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 6 states and 7 transitions. [2019-01-01 21:33:43,738 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:43,739 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:43,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:43,740 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-01-01 21:33:43,740 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:43,741 INFO L794 eck$LassoCheckResult]: Stem: 92#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 93#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 94#L20-2 assume !!(main_~i~0 > 0); 97#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 95#L20-2 [2019-01-01 21:33:43,741 INFO L796 eck$LassoCheckResult]: Loop: 95#L20-2 assume !!(main_~i~0 > 0); 96#L20 assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 95#L20-2 [2019-01-01 21:33:43,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,741 INFO L82 PathProgramCache]: Analyzing trace with hash 957577, now seen corresponding path program 1 times [2019-01-01 21:33:43,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 2 times [2019-01-01 21:33:43,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:43,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:43,767 INFO L82 PathProgramCache]: Analyzing trace with hash 920231916, now seen corresponding path program 1 times [2019-01-01 21:33:43,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:43,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:43,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:43,891 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:43,891 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:43,891 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:43,892 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:43,892 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:43,892 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:43,892 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:43,892 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:43,892 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:43,893 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:43,893 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:43,894 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,921 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,942 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,047 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:44,048 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,052 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:44,053 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:44,074 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:44,074 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,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:44,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:44,100 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:44,100 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {v_rep~unnamed0~0~true_3=1} Honda state: {v_rep~unnamed0~0~true_3=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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,105 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:44,105 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:44,129 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:44,155 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:44,158 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:44,158 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:44,158 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:44,158 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:44,158 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:44,159 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:44,159 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:44,159 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:44,159 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration2_Loop [2019-01-01 21:33:44,160 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:44,160 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:44,162 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,178 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,183 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,409 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-01-01 21:33:44,411 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:44,411 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:44,411 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:44,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:44,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:44,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:44,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:44,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:44,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:44,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:44,420 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:44,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:44,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:44,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:44,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:44,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:44,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:44,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:44,430 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:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:44,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:44,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:44,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:44,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:44,436 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:44,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:44,446 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:44,454 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:44,454 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:44,455 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:44,455 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:44,455 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:44,455 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:44,456 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:44,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:44,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:44,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:44,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:44,890 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:44,891 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:44,891 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2 Second operand 3 states. [2019-01-01 21:33:44,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 6 states and 7 transitions. cyclomatic complexity: 2. Second operand 3 states. Result 10 states and 13 transitions. Complement of second has 5 states. [2019-01-01 21:33:44,945 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:44,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:44,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 2 letters. [2019-01-01 21:33:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:44,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 4 letters. Loop has 4 letters. [2019-01-01 21:33:44,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:44,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 10 states and 13 transitions. [2019-01-01 21:33:44,948 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:44,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:33:44,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-01 21:33:44,949 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:44,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 13 transitions. [2019-01-01 21:33:44,949 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:44,949 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:33:44,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 13 transitions. [2019-01-01 21:33:44,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-01 21:33:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:33:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:33:44,953 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:33:44,953 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:33:44,953 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:33:44,954 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:33:44,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:33:44,957 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:44,957 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:44,958 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1] [2019-01-01 21:33:44,958 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:44,958 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 148#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 149#L20-2 assume !!(main_~i~0 > 0); 156#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 155#L20-2 assume !!(main_~i~0 > 0); 154#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 150#L20-2 [2019-01-01 21:33:44,958 INFO L796 eck$LassoCheckResult]: Loop: 150#L20-2 assume !!(main_~i~0 > 0); 151#L20 assume main_~i~0 < main_~m~0;main_~i~0 := main_~i~0 - 1; 150#L20-2 [2019-01-01 21:33:44,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash 920231918, now seen corresponding path program 2 times [2019-01-01 21:33:44,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:44,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:44,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:44,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:44,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:44,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1380, now seen corresponding path program 3 times [2019-01-01 21:33:44,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:44,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:44,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:44,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:44,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:44,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,006 INFO L82 PathProgramCache]: Analyzing trace with hash -420389359, now seen corresponding path program 2 times [2019-01-01 21:33:45,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,007 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:45,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,071 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,071 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,071 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,071 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,071 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:45,071 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,072 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,072 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,072 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:45,072 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,072 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,074 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,101 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,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:45,179 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:45,179 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,184 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:45,184 INFO L163 nArgumentSynthesizer]: Using integer mode. 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,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:45,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:45,236 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:45,238 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,238 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,238 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,238 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,239 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:45,239 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,239 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,239 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,239 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration3_Loop [2019-01-01 21:33:45,239 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,239 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,242 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,258 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,263 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,332 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:45,333 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:45,333 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,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:45,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:45,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:45,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:45,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:45,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:45,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:45,342 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:45,345 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:33:45,345 INFO L444 ModelExtractionUtils]: 1 out of 4 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:33:45,346 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:45,346 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-01 21:33:45,346 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:45,346 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2019-01-01 21:33:45,347 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-01 21:33:45,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,435 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,436 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:45,436 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:45,470 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 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,472 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,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:45,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:45,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:45,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,523 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,524 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:45,524 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:45,537 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 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,538 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,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 6 transitions. [2019-01-01 21:33:45,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 6 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:45,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,539 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-01 21:33:45,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:45,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:45,622 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,623 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:33:45,623 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2019-01-01 21:33:45,675 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 14 states and 20 transitions. Complement of second has 4 states. [2019-01-01 21:33:45,677 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,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:33:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 8 transitions. [2019-01-01 21:33:45,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 2 letters. [2019-01-01 21:33:45,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:33:45,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 8 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:33:45,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:45,680 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 20 transitions. [2019-01-01 21:33:45,681 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:45,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 12 states and 16 transitions. [2019-01-01 21:33:45,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 6 [2019-01-01 21:33:45,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8 [2019-01-01 21:33:45,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2019-01-01 21:33:45,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:33:45,683 INFO L705 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-01-01 21:33:45,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2019-01-01 21:33:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 7. [2019-01-01 21:33:45,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-01 21:33:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2019-01-01 21:33:45,684 INFO L728 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:33:45,684 INFO L608 BuchiCegarLoop]: Abstraction has 7 states and 9 transitions. [2019-01-01 21:33:45,684 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:33:45,685 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 9 transitions. [2019-01-01 21:33:45,685 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-01 21:33:45,685 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:33:45,685 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:33:45,686 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:33:45,686 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:33:45,686 INFO L794 eck$LassoCheckResult]: Stem: 299#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_~i~0, main_~m~0, main_~n~0;havoc main_~i~0;havoc main_~m~0;havoc main_~n~0;main_~n~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~m~0 := main_#t~nondet1;havoc main_#t~nondet1; 300#L17 assume main_~m~0 > 0 && main_~n~0 > main_~m~0;main_~i~0 := main_~n~0; 301#L20-2 assume !!(main_~i~0 > 0); 302#L20 [2019-01-01 21:33:45,686 INFO L796 eck$LassoCheckResult]: Loop: 302#L20 assume !(main_~i~0 < main_~m~0);main_~i~0 := main_~i~0 - main_~m~0; 305#L20-2 assume !!(main_~i~0 > 0); 302#L20 [2019-01-01 21:33:45,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,686 INFO L82 PathProgramCache]: Analyzing trace with hash 30889, now seen corresponding path program 1 times [2019-01-01 21:33:45,687 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:33:45,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1532, now seen corresponding path program 1 times [2019-01-01 21:33:45,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 29684900, now seen corresponding path program 3 times [2019-01-01 21:33:45,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:33:45,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:33:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:33:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:33:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:33:45,824 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:45,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:45,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:45,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:45,825 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-01 21:33:45,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:45,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:45,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:45,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:33:45,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:45,826 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:45,828 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,832 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,848 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,850 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,867 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,869 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,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,016 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,021 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,024 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-01 21:33:46,024 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~nondet0=0} Honda state: {ULTIMATE.start_main_#t~nondet0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) 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,054 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-01 21:33:46,055 INFO L163 nArgumentSynthesizer]: Using integer mode. 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,082 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-01 21:33:46,082 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-01 21:33:46,297 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-01 21:33:46,299 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:33:46,299 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:33:46,299 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:33:46,299 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:33:46,300 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:33:46,300 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:33:46,300 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:33:46,300 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:33:46,300 INFO L131 ssoRankerPreferences]: Filename of dumped script: AliasDarteFeautrierGonnord-SAS2010-speedpldi4_true-termination_true-no-overflow.c_Iteration4_Lasso [2019-01-01 21:33:46,300 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:33:46,300 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:33:46,302 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,312 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,314 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,316 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,320 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,336 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,464 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:33:46,464 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:33:46,465 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,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:46,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:46,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:46,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:46,468 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,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:46,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:46,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:46,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:46,470 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,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:33:46,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,472 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:33:46,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:33:46,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:46,476 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,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:46,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:46,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:33:46,494 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,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:33:46,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:33:46,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:33:46,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:33:46,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:33:46,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:33:46,541 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:33:46,570 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:33:46,572 INFO L444 ModelExtractionUtils]: 5 out of 13 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-01 21:33:46,573 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:33:46,575 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-01 21:33:46,579 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:33:46,579 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~m~0) = 1*ULTIMATE.start_main_~i~0 - 1*ULTIMATE.start_main_~m~0 Supporting invariants [1*ULTIMATE.start_main_~m~0 - 1 >= 0] [2019-01-01 21:33:46,583 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-01 21:33:46,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:33:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:33:46,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:33:46,899 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,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:33:46,900 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3 Second operand 4 states. [2019-01-01 21:33:46,932 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 7 states and 9 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 13 states and 16 transitions. Complement of second has 5 states. [2019-01-01 21:33:46,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-01 21:33:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:33:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2019-01-01 21:33:46,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:33:46,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:33:46,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:33:46,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:33:46,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 16 transitions. [2019-01-01 21:33:46,935 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:46,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:33:46,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:33:46,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:33:46,936 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-01 21:33:46,936 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:33:46,936 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:33:46,937 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:33:46,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:33:46 BoogieIcfgContainer [2019-01-01 21:33:46,944 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:33:46,944 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:33:46,944 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:33:46,945 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:33:46,945 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:46,949 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:33:46,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:33:46,950 INFO L168 Benchmark]: Toolchain (without parser) took 5877.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 952.7 MB in the beginning and 857.2 MB in the end (delta: 95.5 MB). Peak memory consumption was 236.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:46,951 INFO L168 Benchmark]: CDTParser took 0.16 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:46,952 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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:46,953 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:46,953 INFO L168 Benchmark]: Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:46,954 INFO L168 Benchmark]: RCFGBuilder took 455.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:46,955 INFO L168 Benchmark]: BuchiAutomizer took 5025.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 268.8 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. [2019-01-01 21:33:46,955 INFO L168 Benchmark]: Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 857.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:33:46,960 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.16 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 313.09 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 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 44.97 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.73 ms. Allocated memory is still 1.0 GB. Free memory is still 942.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 455.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5025.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 857.2 MB in the end (delta: 268.8 MB). Peak memory consumption was 268.8 MB. Max. memory is 11.5 GB. * Witness Printer took 4.76 ms. Allocated memory is still 1.2 GB. Free memory is still 857.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 5 terminating modules (1 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function i and consists of 5 locations. One deterministic module has affine ranking function i and consists of 3 locations. One deterministic module has affine ranking function i + -1 * m and consists of 4 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.9s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.3s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 32 SDtfs, 29 SDslu, 6 SDs, 0 SdLazy, 47 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT2 conc0 concLT1 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital15 mio100 ax183 hnf98 lsp54 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq147 hnf94 smp100 dnf100 smp100 tf108 neg100 sie120 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 5 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...