./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7d3a15f933181b44751784c7ab9846d6b1216531 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:42:24,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:42:24,490 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:42:24,506 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:42:24,506 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:42:24,507 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:42:24,508 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:42:24,511 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:42:24,514 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:42:24,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:42:24,520 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:42:24,521 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:42:24,522 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:42:24,523 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:42:24,526 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:42:24,527 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:42:24,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:42:24,537 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:42:24,539 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:42:24,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:42:24,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:42:24,548 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:42:24,552 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:42:24,553 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:42:24,553 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:42:24,556 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:42:24,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:42:24,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:42:24,561 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:42:24,565 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:42:24,566 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:42:24,567 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:42:24,567 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:42:24,568 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:42:24,570 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:42:24,571 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:42:24,571 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:42:24,604 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:42:24,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:42:24,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:42:24,607 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:42:24,607 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:42:24,607 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:42:24,607 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:42:24,607 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:42:24,608 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:42:24,610 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:42:24,610 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:42:24,610 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:42:24,610 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:42:24,610 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:42:24,610 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:42:24,611 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:42:24,611 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:42:24,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:42:24,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:42:24,612 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:42:24,612 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:42:24,612 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:42:24,613 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:42:24,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:42:24,613 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:42:24,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:42:24,613 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:42:24,613 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:42:24,617 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:42:24,617 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d3a15f933181b44751784c7ab9846d6b1216531 [2019-01-01 21:42:24,677 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:42:24,695 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:42:24,702 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:42:24,703 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:42:24,703 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:42:24,705 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2019-01-01 21:42:24,769 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f338122/fa6e6a7662a14db59205c558f0e3d839/FLAG07636e221 [2019-01-01 21:42:25,356 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:42:25,357 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2019-01-01 21:42:25,376 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f338122/fa6e6a7662a14db59205c558f0e3d839/FLAG07636e221 [2019-01-01 21:42:25,616 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30f338122/fa6e6a7662a14db59205c558f0e3d839 [2019-01-01 21:42:25,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:42:25,621 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:42:25,622 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:25,622 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:42:25,626 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:42:25,627 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:25" (1/1) ... [2019-01-01 21:42:25,631 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136f6f7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:25, skipping insertion in model container [2019-01-01 21:42:25,631 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:42:25" (1/1) ... [2019-01-01 21:42:25,640 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:42:25,707 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:42:26,090 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:26,102 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:42:26,248 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:42:26,314 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:42:26,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26 WrapperNode [2019-01-01 21:42:26,314 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:42:26,315 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:26,315 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:42:26,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:42:26,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,357 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,395 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:42:26,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:42:26,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:42:26,396 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:42:26,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,432 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,444 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... [2019-01-01 21:42:26,449 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:42:26,449 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:42:26,450 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:42:26,450 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:42:26,451 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:42:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:42:26,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:42:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 21:42:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 21:42:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:42:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-01 21:42:26,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:42:26,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:42:27,387 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:42:27,388 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-01 21:42:27,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:27 BoogieIcfgContainer [2019-01-01 21:42:27,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:42:27,389 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:42:27,389 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:42:27,393 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:42:27,394 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:27,395 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:42:25" (1/3) ... [2019-01-01 21:42:27,396 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da63a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:27, skipping insertion in model container [2019-01-01 21:42:27,396 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:27,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:42:26" (2/3) ... [2019-01-01 21:42:27,399 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1da63a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:42:27, skipping insertion in model container [2019-01-01 21:42:27,399 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:42:27,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:27" (3/3) ... [2019-01-01 21:42:27,403 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2019-01-01 21:42:27,471 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:42:27,472 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:42:27,472 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:42:27,472 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:42:27,473 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:42:27,473 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:42:27,473 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:42:27,473 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:42:27,474 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:42:27,490 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-01 21:42:27,517 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 21:42:27,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:27,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:27,525 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:42:27,525 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:27,526 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:42:27,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-01 21:42:27,530 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-01 21:42:27,530 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:27,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:27,531 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-01 21:42:27,531 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:27,540 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 42#L562true assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 15#L554-3true [2019-01-01 21:42:27,541 INFO L796 eck$LassoCheckResult]: Loop: 15#L554-3true call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 12#L554-1true assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 15#L554-3true [2019-01-01 21:42:27,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:27,548 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-01 21:42:27,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:27,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:27,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:27,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2019-01-01 21:42:27,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:27,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:27,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-01 21:42:27,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:27,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:27,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:27,950 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 21:42:29,028 WARN L181 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-01-01 21:42:29,200 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-01 21:42:29,217 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:29,219 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:29,219 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:29,219 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:29,219 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:29,220 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:29,220 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:29,220 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:29,221 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:42:29,221 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:29,221 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:29,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,312 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,766 WARN L181 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-01 21:42:29,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:29,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:31,102 WARN L181 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-01 21:42:31,223 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:31,228 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:31,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:31,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,235 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,238 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:31,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:31,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:31,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:31,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:31,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,252 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:31,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,263 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:31,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:31,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,282 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,303 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:31,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:31,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:31,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:31,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:31,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:31,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:31,319 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:31,410 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:31,448 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:42:31,449 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-01 21:42:31,452 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:31,454 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:31,454 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:31,456 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtol_~nptr.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1) = -1*ULTIMATE.start_strtol_~nptr.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 Supporting invariants [] [2019-01-01 21:42:31,582 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-01-01 21:42:31,597 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:31,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:31,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:31,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:31,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:31,831 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-01 21:42:31,833 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2019-01-01 21:42:32,175 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 3 states. Result 192 states and 307 transitions. Complement of second has 8 states. [2019-01-01 21:42:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:42:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2019-01-01 21:42:32,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-01 21:42:32,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:32,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:42:32,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:32,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-01 21:42:32,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:32,184 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2019-01-01 21:42:32,195 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2019-01-01 21:42:32,203 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2019-01-01 21:42:32,204 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-01 21:42:32,205 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-01 21:42:32,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2019-01-01 21:42:32,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:32,206 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2019-01-01 21:42:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2019-01-01 21:42:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2019-01-01 21:42:32,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-01 21:42:32,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-01-01 21:42:32,236 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-01 21:42:32,236 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-01 21:42:32,236 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:42:32,237 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-01-01 21:42:32,238 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:42:32,238 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:32,238 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:32,238 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:32,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:32,239 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 328#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 338#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 329#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 330#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 321#L555 assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; 322#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 336#L512-3 [2019-01-01 21:42:32,239 INFO L796 eck$LassoCheckResult]: Loop: 336#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 337#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 336#L512-3 [2019-01-01 21:42:32,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,239 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2019-01-01 21:42:32,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:32,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,281 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-01 21:42:32,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:32,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,291 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2019-01-01 21:42:32,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,291 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:32,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:32,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 21:42:32,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 21:42:32,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 21:42:32,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 21:42:32,476 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-01 21:42:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 21:42:32,756 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-01-01 21:42:32,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 21:42:32,758 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2019-01-01 21:42:32,760 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-01-01 21:42:32,761 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2019-01-01 21:42:32,762 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2019-01-01 21:42:32,762 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-01 21:42:32,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2019-01-01 21:42:32,763 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-01 21:42:32,763 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-01-01 21:42:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2019-01-01 21:42:32,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2019-01-01 21:42:32,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-01 21:42:32,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2019-01-01 21:42:32,768 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2019-01-01 21:42:32,768 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2019-01-01 21:42:32,768 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:42:32,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2019-01-01 21:42:32,769 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-01 21:42:32,769 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:42:32,769 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:42:32,770 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:42:32,770 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:42:32,770 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 454#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 455#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.allocOnStack(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc30.base, main_#t~malloc30.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~base~0 := main_#t~nondet31;havoc main_#t~nondet31;call main_~#end~0.base, main_~#end~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 466#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 460#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 462#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 479#L555 assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 480#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 463#L512-3 [2019-01-01 21:42:32,770 INFO L796 eck$LassoCheckResult]: Loop: 463#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 464#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 463#L512-3 [2019-01-01 21:42:32,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,770 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2019-01-01 21:42:32,771 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,771 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:32,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-01-01 21:42:32,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:42:32,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:32,857 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2019-01-01 21:42:32,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:42:32,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:42:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 21:42:32,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:42:32,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:32,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:42:33,035 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-01-01 21:42:33,910 WARN L181 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 152 [2019-01-01 21:42:34,206 WARN L181 SmtUtils]: Spent 292.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-01 21:42:34,208 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:42:34,208 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:42:34,208 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:42:34,209 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:42:34,209 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:42:34,209 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:42:34,209 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:42:34,209 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:42:34,209 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2019-01-01 21:42:34,210 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:42:34,210 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:42:34,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,712 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-01-01 21:42:34,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:34,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:42:35,277 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-01 21:42:35,565 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 21:42:36,599 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-01-01 21:42:36,754 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:42:36,755 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:42:36,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,757 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,761 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,762 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,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-01 21:42:36,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,774 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,777 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,777 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,781 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,786 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,787 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,788 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:42:36,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:42:36,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:42:36,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,798 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,801 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,827 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,831 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,831 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,848 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,853 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,854 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:42:36,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:42:36,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:42:36,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:42:36,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:42:36,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:42:36,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:42:36,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:42:36,906 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:42:36,944 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-01 21:42:36,944 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 21:42:36,945 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:42:36,947 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:42:36,948 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:42:36,948 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_2) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_2 Supporting invariants [] [2019-01-01 21:42:37,234 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 21:42:37,239 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:42:37,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:42:37,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:37,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:42:37,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:42:37,445 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-01 21:42:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:42:37,446 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2019-01-01 21:42:37,446 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-01-01 21:42:37,574 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 77 states and 110 transitions. Complement of second has 7 states. [2019-01-01 21:42:37,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-01-01 21:42:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:42:37,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2019-01-01 21:42:37,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-01 21:42:37,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:37,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-01 21:42:37,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:37,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-01 21:42:37,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:42:37,577 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2019-01-01 21:42:37,580 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:37,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-01-01 21:42:37,583 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:42:37,583 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:42:37,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:42:37,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:42:37,583 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:37,583 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:37,583 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:42:37,583 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-01 21:42:37,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:42:37,584 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:42:37,584 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:42:37,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:42:37 BoogieIcfgContainer [2019-01-01 21:42:37,591 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:42:37,591 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:42:37,591 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:42:37,592 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:42:37,592 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:42:27" (3/4) ... [2019-01-01 21:42:37,596 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:42:37,596 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:42:37,597 INFO L168 Benchmark]: Toolchain (without parser) took 11976.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 302.5 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -57.1 MB). Peak memory consumption was 245.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:37,598 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:37,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:37,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:37,600 INFO L168 Benchmark]: Boogie Preprocessor took 53.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:37,600 INFO L168 Benchmark]: RCFGBuilder took 938.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:37,601 INFO L168 Benchmark]: BuchiAutomizer took 10202.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 229.7 MB. Max. memory is 11.5 GB. [2019-01-01 21:42:37,602 INFO L168 Benchmark]: Witness Printer took 4.42 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:42:37,608 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.20 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 693.02 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -164.7 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 938.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10202.15 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 159.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 69.8 MB). Peak memory consumption was 229.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.42 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 162 SDtfs, 217 SDslu, 292 SDs, 0 SdLazy, 233 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital248 mio100 ax100 hnf100 lsp91 ukn68 mio100 lsp35 div100 bol100 ite100 ukn100 eq193 hnf88 smp100 dnf295 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 13ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...