./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 7408fe5ba42f5c474832c90e26f3e7ef2342554c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 03:50:16,097 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 03:50:16,100 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 03:50:16,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 03:50:16,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 03:50:16,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 03:50:16,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 03:50:16,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 03:50:16,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 03:50:16,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 03:50:16,128 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 03:50:16,128 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 03:50:16,130 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 03:50:16,131 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 03:50:16,132 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 03:50:16,133 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 03:50:16,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 03:50:16,138 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 03:50:16,140 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 03:50:16,147 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 03:50:16,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 03:50:16,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 03:50:16,158 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 03:50:16,161 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 03:50:16,161 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 03:50:16,162 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 03:50:16,164 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 03:50:16,168 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 03:50:16,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 03:50:16,175 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 03:50:16,176 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 03:50:16,177 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 03:50:16,177 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 03:50:16,177 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 03:50:16,180 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 03:50:16,182 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 03:50:16,184 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 03:50:16,220 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 03:50:16,223 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 03:50:16,225 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 03:50:16,225 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 03:50:16,225 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 03:50:16,226 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 03:50:16,228 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 03:50:16,228 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 03:50:16,228 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 03:50:16,228 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 03:50:16,228 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 03:50:16,229 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 03:50:16,230 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 03:50:16,230 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 03:50:16,230 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 03:50:16,232 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 03:50:16,233 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 03:50:16,233 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 03:50:16,233 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 03:50:16,233 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 03:50:16,234 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 03:50:16,234 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 03:50:16,234 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 03:50:16,234 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 03:50:16,234 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 03:50:16,234 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 03:50:16,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 03:50:16,235 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 03:50:16,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 03:50:16,235 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 03:50:16,235 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 03:50:16,239 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 03:50:16,240 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7408fe5ba42f5c474832c90e26f3e7ef2342554c [2019-01-14 03:50:16,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 03:50:16,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 03:50:16,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 03:50:16,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 03:50:16,336 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 03:50:16,337 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2019-01-14 03:50:16,406 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2761cfc4/07a208207f2842438e690fdf8033a82b/FLAGcbfa80eeb [2019-01-14 03:50:16,844 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 03:50:16,845 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-lit/cggmp2005b_true-unreach-call_true-termination.c.i [2019-01-14 03:50:16,850 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2761cfc4/07a208207f2842438e690fdf8033a82b/FLAGcbfa80eeb [2019-01-14 03:50:17,237 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2761cfc4/07a208207f2842438e690fdf8033a82b [2019-01-14 03:50:17,240 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 03:50:17,242 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 03:50:17,243 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 03:50:17,243 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 03:50:17,247 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 03:50:17,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,251 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c433c7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17, skipping insertion in model container [2019-01-14 03:50:17,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 03:50:17,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 03:50:17,513 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:50:17,520 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 03:50:17,539 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 03:50:17,561 INFO L195 MainTranslator]: Completed translation [2019-01-14 03:50:17,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17 WrapperNode [2019-01-14 03:50:17,561 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 03:50:17,564 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 03:50:17,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 03:50:17,564 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 03:50:17,575 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 03:50:17,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 03:50:17,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 03:50:17,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 03:50:17,625 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,627 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,628 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (1/1) ... [2019-01-14 03:50:17,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 03:50:17,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 03:50:17,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 03:50:17,651 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 03:50:17,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (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-14 03:50:17,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 03:50:17,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 03:50:18,171 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 03:50:18,172 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-14 03:50:18,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:18 BoogieIcfgContainer [2019-01-14 03:50:18,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 03:50:18,174 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 03:50:18,174 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 03:50:18,178 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 03:50:18,179 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:50:18,179 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 03:50:17" (1/3) ... [2019-01-14 03:50:18,181 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399f87a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:50:18, skipping insertion in model container [2019-01-14 03:50:18,181 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:50:18,181 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 03:50:17" (2/3) ... [2019-01-14 03:50:18,182 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@399f87a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 03:50:18, skipping insertion in model container [2019-01-14 03:50:18,182 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 03:50:18,182 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:18" (3/3) ... [2019-01-14 03:50:18,184 INFO L375 chiAutomizerObserver]: Analyzing ICFG cggmp2005b_true-unreach-call_true-termination.c.i [2019-01-14 03:50:18,264 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 03:50:18,265 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 03:50:18,265 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 03:50:18,265 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 03:50:18,266 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 03:50:18,266 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 03:50:18,266 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 03:50:18,267 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 03:50:18,267 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 03:50:18,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 03:50:18,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:50:18,326 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:18,326 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:18,349 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 03:50:18,349 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:50:18,350 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 03:50:18,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2019-01-14 03:50:18,357 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:50:18,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:18,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:18,358 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 03:50:18,359 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:50:18,383 INFO L794 eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 8#L21-3true [2019-01-14 03:50:18,383 INFO L796 eck$LassoCheckResult]: Loop: 8#L21-3true assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 3#L17-2true assume !(main_~j~0 < 20); 13#L17-3true main_~k~0 := 4; 11#L21-2true assume !true; 8#L21-3true [2019-01-14 03:50:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:18,402 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 1 times [2019-01-14 03:50:18,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:18,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1238515, now seen corresponding path program 1 times [2019-01-14 03:50:18,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:18,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:18,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:18,541 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-14 03:50:18,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:50:18,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-01-14 03:50:18,549 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-01-14 03:50:18,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 03:50:18,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 03:50:18,567 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2019-01-14 03:50:18,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:50:18,578 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-14 03:50:18,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:50:18,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 14 transitions. [2019-01-14 03:50:18,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:50:18,587 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 5 states and 7 transitions. [2019-01-14 03:50:18,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 03:50:18,589 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 03:50:18,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 7 transitions. [2019-01-14 03:50:18,590 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:50:18,590 INFO L706 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 03:50:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states and 7 transitions. [2019-01-14 03:50:18,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-14 03:50:18,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-14 03:50:18,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2019-01-14 03:50:18,623 INFO L729 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 03:50:18,623 INFO L609 BuchiCegarLoop]: Abstraction has 5 states and 7 transitions. [2019-01-14 03:50:18,624 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 03:50:18,625 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 5 states and 7 transitions. [2019-01-14 03:50:18,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2019-01-14 03:50:18,626 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:18,626 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:18,626 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1] [2019-01-14 03:50:18,626 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-14 03:50:18,627 INFO L794 eck$LassoCheckResult]: Stem: 34#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 35#L21-3 [2019-01-14 03:50:18,627 INFO L796 eck$LassoCheckResult]: Loop: 35#L21-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 32#L17-2 assume !(main_~j~0 < 20); 33#L17-3 main_~k~0 := 4; 36#L21-2 assume !(main_~k~0 <= 3); 35#L21-3 [2019-01-14 03:50:18,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:18,628 INFO L82 PathProgramCache]: Analyzing trace with hash 32, now seen corresponding path program 2 times [2019-01-14 03:50:18,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:18,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:18,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:18,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1238511, now seen corresponding path program 1 times [2019-01-14 03:50:18,639 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:18,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:50:18,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 29867662, now seen corresponding path program 1 times [2019-01-14 03:50:18,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:18,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:18,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:18,708 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-14 03:50:18,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 03:50:18,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 03:50:18,824 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 15 [2019-01-14 03:50:18,870 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:18,871 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:18,872 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:18,872 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:18,872 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:50:18,872 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:18,872 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:18,872 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:18,873 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration2_Loop [2019-01-14 03:50:18,874 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:18,874 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:18,900 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-14 03:50:18,948 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-14 03:50:19,044 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-14 03:50:19,273 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:19,274 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-14 03:50:19,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:19,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:50:19,306 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:50:19,306 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~j~0=20} Honda state: {ULTIMATE.start_main_~j~0=20} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:19,317 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:19,317 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-14 03:50:19,371 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:50:19,371 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:19,401 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:50:19,403 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:19,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:19,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:19,404 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:19,404 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:50:19,404 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:19,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:19,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:19,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration2_Loop [2019-01-14 03:50:19,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:19,404 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:19,409 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-14 03:50:19,443 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-14 03:50:19,487 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-14 03:50:19,750 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:19,756 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:50:19,758 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-14 03:50:19,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:19,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:50:19,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:19,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:19,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:19,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:50:19,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:50:19,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:50:19,767 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-14 03:50:19,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:19,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:50:19,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:19,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:19,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:19,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:50:19,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:50:19,778 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:50:19,783 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:50:19,783 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:50:19,786 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:50:19,786 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:50:19,786 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:50:19,787 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = -2*ULTIMATE.start_main_~i~0 + 201 Supporting invariants [] [2019-01-14 03:50:19,788 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:50:19,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:19,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:19,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:19,979 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-14 03:50:19,983 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-14 03:50:19,984 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3 Second operand 3 states. [2019-01-14 03:50:20,040 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 5 states and 7 transitions. cyclomatic complexity: 3. Second operand 3 states. Result 13 states and 20 transitions. Complement of second has 4 states. [2019-01-14 03:50:20,040 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-14 03:50:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 03:50:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 03:50:20,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 1 letters. Loop has 4 letters. [2019-01-14 03:50:20,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:20,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 03:50:20,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:20,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 1 letters. Loop has 8 letters. [2019-01-14 03:50:20,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:20,046 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 20 transitions. [2019-01-14 03:50:20,048 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 03:50:20,049 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 12 states and 19 transitions. [2019-01-14 03:50:20,050 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 03:50:20,050 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 03:50:20,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 19 transitions. [2019-01-14 03:50:20,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:50:20,050 INFO L706 BuchiCegarLoop]: Abstraction has 12 states and 19 transitions. [2019-01-14 03:50:20,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 19 transitions. [2019-01-14 03:50:20,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 10. [2019-01-14 03:50:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 03:50:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2019-01-14 03:50:20,053 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 16 transitions. [2019-01-14 03:50:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 03:50:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 03:50:20,053 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2019-01-14 03:50:20,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:50:20,063 INFO L93 Difference]: Finished difference Result 11 states and 18 transitions. [2019-01-14 03:50:20,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 03:50:20,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 18 transitions. [2019-01-14 03:50:20,065 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 03:50:20,065 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 11 states and 18 transitions. [2019-01-14 03:50:20,066 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 03:50:20,067 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 03:50:20,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 18 transitions. [2019-01-14 03:50:20,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:50:20,067 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2019-01-14 03:50:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 18 transitions. [2019-01-14 03:50:20,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-14 03:50:20,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-14 03:50:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2019-01-14 03:50:20,069 INFO L729 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2019-01-14 03:50:20,070 INFO L609 BuchiCegarLoop]: Abstraction has 11 states and 18 transitions. [2019-01-14 03:50:20,070 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 03:50:20,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 18 transitions. [2019-01-14 03:50:20,071 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 2 [2019-01-14 03:50:20,071 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:20,071 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:20,071 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 03:50:20,072 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:50:20,072 INFO L794 eck$LassoCheckResult]: Stem: 111#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 112#L21-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 113#L17-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 107#L17-2 [2019-01-14 03:50:20,072 INFO L796 eck$LassoCheckResult]: Loop: 107#L17-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 107#L17-2 [2019-01-14 03:50:20,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash 31081, now seen corresponding path program 1 times [2019-01-14 03:50:20,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:20,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:20,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:20,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:20,085 INFO L82 PathProgramCache]: Analyzing trace with hash 50, now seen corresponding path program 1 times [2019-01-14 03:50:20,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:20,085 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:20,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:20,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:20,092 INFO L82 PathProgramCache]: Analyzing trace with hash 963530, now seen corresponding path program 2 times [2019-01-14 03:50:20,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:20,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:20,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:20,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:20,313 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2019-01-14 03:50:20,329 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:20,329 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:20,329 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:20,329 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:20,330 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:50:20,330 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:20,330 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:20,330 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:20,330 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2019-01-14 03:50:20,330 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:20,330 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:20,332 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-14 03:50:20,338 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-14 03:50:20,391 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-14 03:50:20,461 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:20,462 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 03:50:20,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:20,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:50:20,470 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2019-01-14 03:50:20,470 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~k~0=0} Honda state: {ULTIMATE.start_main_~k~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] 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-14 03:50:20,493 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:20,493 INFO L163 nArgumentSynthesizer]: Using integer mode. 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) [2019-01-14 03:50:20,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:50:20,551 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:22,280 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:50:22,283 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:22,283 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:22,283 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:22,283 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:22,283 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:50:22,283 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:22,283 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:22,284 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:22,284 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration3_Lasso [2019-01-14 03:50:22,284 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:22,284 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:22,286 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-14 03:50:22,291 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-14 03:50:22,307 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-14 03:50:22,632 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-01-14 03:50:22,736 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:22,736 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:50:22,737 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-14 03:50:22,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:22,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:22,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:22,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:22,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:50:22,747 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:50:22,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 03:50:22,773 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-14 03:50:22,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:22,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:22,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:22,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:22,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 03:50:22,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 03:50:22,848 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:50:22,860 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:50:22,860 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:50:22,861 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:50:22,865 INFO L440 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-01-14 03:50:22,865 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:50:22,866 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = -2*ULTIMATE.start_main_~j~0 + 39 Supporting invariants [1*ULTIMATE.start_main_~i~0 - 1 >= 0] [2019-01-14 03:50:22,894 INFO L297 tatePredicateManager]: 0 out of 1 supporting invariants were superfluous and have been removed [2019-01-14 03:50:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:23,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:23,080 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-14 03:50:23,080 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 1 loop predicates [2019-01-14 03:50:23,081 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 18 transitions. cyclomatic complexity: 10 Second operand 4 states. [2019-01-14 03:50:23,212 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 18 transitions. cyclomatic complexity: 10. Second operand 4 states. Result 20 states and 33 transitions. Complement of second has 6 states. [2019-01-14 03:50:23,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 03:50:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 03:50:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-01-14 03:50:23,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 1 letters. [2019-01-14 03:50:23,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 4 letters. Loop has 1 letters. [2019-01-14 03:50:23,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 03:50:23,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 33 transitions. [2019-01-14 03:50:23,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 03:50:23,218 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 17 states and 27 transitions. [2019-01-14 03:50:23,218 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 03:50:23,219 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 6 [2019-01-14 03:50:23,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 27 transitions. [2019-01-14 03:50:23,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:50:23,219 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 27 transitions. [2019-01-14 03:50:23,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 27 transitions. [2019-01-14 03:50:23,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-01-14 03:50:23,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 03:50:23,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 26 transitions. [2019-01-14 03:50:23,222 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-01-14 03:50:23,222 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 26 transitions. [2019-01-14 03:50:23,222 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 03:50:23,223 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 26 transitions. [2019-01-14 03:50:23,223 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 03:50:23,224 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:23,224 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:23,224 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 03:50:23,224 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:50:23,224 INFO L794 eck$LassoCheckResult]: Stem: 186#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 187#L21-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 188#L17-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 183#L17-2 assume !(main_~j~0 < 20); 184#L17-3 main_~k~0 := 4; 191#L21-2 [2019-01-14 03:50:23,226 INFO L796 eck$LassoCheckResult]: Loop: 191#L21-2 assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; 191#L21-2 [2019-01-14 03:50:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:23,226 INFO L82 PathProgramCache]: Analyzing trace with hash 29869391, now seen corresponding path program 1 times [2019-01-14 03:50:23,227 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:23,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 03:50:23,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:50:23,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:50:23,305 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:50:23,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 03:50:23,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:50:23,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2019-01-14 03:50:23,402 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:50:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:23,403 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 1 times [2019-01-14 03:50:23,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:23,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:23,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:23,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:23,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:23,437 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:23,437 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:23,437 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:23,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:23,438 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:50:23,438 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:23,438 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:23,438 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:23,438 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration4_Loop [2019-01-14 03:50:23,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:23,439 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:23,440 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-14 03:50:23,513 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:23,513 INFO L412 LassoAnalysis]: Checking for nontermination... 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-14 03:50:23,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:23,518 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 03:50:23,551 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:50:23,551 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:50:23,576 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:50:23,578 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:23,578 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:23,579 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:23,579 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:23,579 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:50:23,579 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:23,579 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:23,579 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:23,579 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration4_Loop [2019-01-14 03:50:23,579 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:23,580 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:23,581 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-14 03:50:23,631 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:23,632 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:50:23,633 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-14 03:50:23,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:23,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:50:23,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:23,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:23,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:23,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:50:23,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:50:23,639 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:50:23,648 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:50:23,649 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:50:23,651 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:50:23,652 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:50:23,652 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:50:23,652 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 7 Supporting invariants [] [2019-01-14 03:50:23,652 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:50:23,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:23,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:23,710 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-14 03:50:23,710 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 03:50:23,710 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 26 transitions. cyclomatic complexity: 14 Second operand 2 states. [2019-01-14 03:50:23,739 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 26 transitions. cyclomatic complexity: 14. Second operand 2 states. Result 47 states and 75 transitions. Complement of second has 5 states. [2019-01-14 03:50:23,740 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-14 03:50:23,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 03:50:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 03:50:23,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 1 letters. [2019-01-14 03:50:23,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 6 letters. Loop has 1 letters. [2019-01-14 03:50:23,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 03:50:23,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:23,742 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 75 transitions. [2019-01-14 03:50:23,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 03:50:23,747 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 31 states and 51 transitions. [2019-01-14 03:50:23,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-01-14 03:50:23,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-01-14 03:50:23,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 51 transitions. [2019-01-14 03:50:23,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:50:23,748 INFO L706 BuchiCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-01-14 03:50:23,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 51 transitions. [2019-01-14 03:50:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 16. [2019-01-14 03:50:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-14 03:50:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2019-01-14 03:50:23,751 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2019-01-14 03:50:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 03:50:23,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-14 03:50:23,752 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. Second operand 8 states. [2019-01-14 03:50:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:50:23,863 INFO L93 Difference]: Finished difference Result 17 states and 26 transitions. [2019-01-14 03:50:23,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 03:50:23,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 26 transitions. [2019-01-14 03:50:23,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 03:50:23,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 26 transitions. [2019-01-14 03:50:23,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-01-14 03:50:23,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-01-14 03:50:23,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 26 transitions. [2019-01-14 03:50:23,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 03:50:23,868 INFO L706 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2019-01-14 03:50:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 26 transitions. [2019-01-14 03:50:23,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-14 03:50:23,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-14 03:50:23,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2019-01-14 03:50:23,871 INFO L729 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2019-01-14 03:50:23,871 INFO L609 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2019-01-14 03:50:23,871 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-14 03:50:23,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2019-01-14 03:50:23,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1 [2019-01-14 03:50:23,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 03:50:23,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 03:50:23,873 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1] [2019-01-14 03:50:23,873 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1] [2019-01-14 03:50:23,873 INFO L794 eck$LassoCheckResult]: Stem: 342#ULTIMATE.startENTRY havoc main_#res;havoc main_~i~0, main_~j~0, main_~k~0;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;main_~i~0 := 0;main_~k~0 := 9;main_~j~0 := -100; 343#L21-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 340#L17-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 341#L17-2 assume !!(main_~j~0 < 20);main_~j~0 := main_~i~0 + main_~j~0; 351#L17-2 assume !(main_~j~0 < 20); 348#L17-3 main_~k~0 := 4; 347#L21-2 assume !(main_~k~0 <= 3); 344#L21-3 assume !!(main_~i~0 <= 100);main_~i~0 := 1 + main_~i~0; 345#L17-2 assume !(main_~j~0 < 20); 338#L17-3 main_~k~0 := 4; 346#L21-2 [2019-01-14 03:50:23,873 INFO L796 eck$LassoCheckResult]: Loop: 346#L21-2 assume !!(main_~k~0 <= 3);main_~k~0 := 1 + main_~k~0; 346#L21-2 [2019-01-14 03:50:23,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 352026178, now seen corresponding path program 1 times [2019-01-14 03:50:23,874 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:23,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:23,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:23,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:50:23,955 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 03:50:23,955 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 03:50:23,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:23,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:23,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,081 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 03:50:24,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 03:50:24,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-01-14 03:50:24,102 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-14 03:50:24,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:24,102 INFO L82 PathProgramCache]: Analyzing trace with hash 63, now seen corresponding path program 2 times [2019-01-14 03:50:24,102 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 03:50:24,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 03:50:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:24,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 03:50:24,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 03:50:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 03:50:24,126 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:24,126 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:24,126 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:24,126 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:24,126 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-01-14 03:50:24,127 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:24,127 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:24,127 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:24,127 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration5_Loop [2019-01-14 03:50:24,127 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:24,127 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:24,128 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-14 03:50:24,199 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:24,200 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-14 03:50:24,208 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-01-14 03:50:24,208 INFO L163 nArgumentSynthesizer]: Using integer mode. 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-14 03:50:24,235 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-01-14 03:50:24,235 INFO L163 nArgumentSynthesizer]: Using integer mode. [2019-01-14 03:50:24,260 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-01-14 03:50:24,262 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 03:50:24,262 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 03:50:24,262 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 03:50:24,263 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 03:50:24,263 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 03:50:24,263 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 03:50:24,263 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 03:50:24,263 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 03:50:24,263 INFO L131 ssoRankerPreferences]: Filename of dumped script: cggmp2005b_true-unreach-call_true-termination.c.i_Iteration5_Loop [2019-01-14 03:50:24,263 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 03:50:24,263 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 03:50:24,264 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-14 03:50:24,317 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 03:50:24,317 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 03:50:24,319 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-14 03:50:24,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 03:50:24,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 03:50:24,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 03:50:24,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 03:50:24,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 03:50:24,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 03:50:24,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 03:50:24,331 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 03:50:24,337 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-14 03:50:24,337 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2019-01-14 03:50:24,338 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 03:50:24,338 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-01-14 03:50:24,338 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 03:50:24,338 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0) = -2*ULTIMATE.start_main_~k~0 + 7 Supporting invariants [] [2019-01-14 03:50:24,339 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2019-01-14 03:50:24,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:24,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,404 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-14 03:50:24,405 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 03:50:24,405 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 03:50:24,430 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 43 states and 68 transitions. Complement of second has 5 states. [2019-01-14 03:50:24,432 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-14 03:50:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 03:50:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 03:50:24,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 03:50:24,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:24,433 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:50:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:24,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,494 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-14 03:50:24,495 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 03:50:24,495 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 03:50:24,509 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 43 states and 68 transitions. Complement of second has 5 states. [2019-01-14 03:50:24,514 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-14 03:50:24,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 03:50:24,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-14 03:50:24,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 10 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 03:50:24,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:24,515 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-01-14 03:50:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 03:50:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 03:50:24,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 03:50:24,547 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-14 03:50:24,547 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2019-01-14 03:50:24,548 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13 Second operand 2 states. [2019-01-14 03:50:24,566 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 26 transitions. cyclomatic complexity: 13. Second operand 2 states. Result 32 states and 48 transitions. Complement of second has 4 states. [2019-01-14 03:50:24,567 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-14 03:50:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2019-01-14 03:50:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 13 transitions. [2019-01-14 03:50:24,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 1 letters. [2019-01-14 03:50:24,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:24,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 11 letters. Loop has 1 letters. [2019-01-14 03:50:24,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:24,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 13 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 03:50:24,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 03:50:24,571 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 32 states and 48 transitions. [2019-01-14 03:50:24,573 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:50:24,573 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 32 states to 0 states and 0 transitions. [2019-01-14 03:50:24,574 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:50:24,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:50:24,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:50:24,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:50:24,574 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:50:24,574 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:50:24,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 03:50:24,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-14 03:50:24,575 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand 9 states. [2019-01-14 03:50:24,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 03:50:24,575 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-01-14 03:50:24,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 03:50:24,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:50:24,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 03:50:24,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 03:50:24,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 03:50:24,576 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 03:50:24,576 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2019-01-14 03:50:24,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 03:50:24,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 03:50:24,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 03:50:24,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 03:50:24 BoogieIcfgContainer [2019-01-14 03:50:24,584 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 03:50:24,585 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 03:50:24,585 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 03:50:24,585 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 03:50:24,586 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 03:50:18" (3/4) ... [2019-01-14 03:50:24,590 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 03:50:24,590 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 03:50:24,591 INFO L168 Benchmark]: Toolchain (without parser) took 7350.55 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 952.7 MB in the beginning and 829.7 MB in the end (delta: 123.0 MB). Peak memory consumption was 229.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,592 INFO L168 Benchmark]: CDTParser took 0.18 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-14 03:50:24,593 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.71 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-14 03:50:24,594 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.65 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-14 03:50:24,594 INFO L168 Benchmark]: Boogie Preprocessor took 38.31 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-14 03:50:24,595 INFO L168 Benchmark]: RCFGBuilder took 522.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,596 INFO L168 Benchmark]: BuchiAutomizer took 6410.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 829.7 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. [2019-01-14 03:50:24,596 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 1.1 GB. Free memory is still 829.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 03:50:24,601 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.18 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 320.71 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 47.65 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 38.31 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 522.84 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -139.0 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6410.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 829.7 MB in the end (delta: 251.3 MB). Peak memory consumption was 251.3 MB. Max. memory is 11.5 GB. * Witness Printer took 5.48 ms. Allocated memory is still 1.1 GB. Free memory is still 829.7 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 8 terminating modules (4 trivial, 3 deterministic, 1 nondeterministic). One deterministic module has affine ranking function -2 * i + 201 and consists of 3 locations. One deterministic module has affine ranking function -2 * j + 39 and consists of 5 locations. One deterministic module has affine ranking function -2 * k + 7 and consists of 3 locations. One nondeterministic module has affine ranking function -2 * k + 7 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 5.1s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 17 states and ocurred in iteration 4. Nontrivial modules had stage [3, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 72 SDtfs, 45 SDslu, 34 SDs, 0 SdLazy, 44 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI0 SILT2 lasso1 LassoPreprocessingBenchmarks: Lassos: inital14 mio100 ax100 hnf98 lsp87 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq167 hnf93 smp100 dnf100 smp100 tf109 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 32ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 4 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 2.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...