./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 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-0ed9222-m [2019-01-14 02:25:26,730 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:25:26,732 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:25:26,744 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:25:26,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:25:26,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:25:26,746 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:25:26,748 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:25:26,750 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:25:26,751 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:25:26,752 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:25:26,752 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:25:26,753 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:25:26,754 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:25:26,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:25:26,756 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:25:26,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:25:26,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:25:26,761 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:25:26,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:25:26,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:25:26,765 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:25:26,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:25:26,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:25:26,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:25:26,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:25:26,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:25:26,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:25:26,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:25:26,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:25:26,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:25:26,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:25:26,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:25:26,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:25:26,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:25:26,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:25:26,777 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:25:26,813 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:25:26,813 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:25:26,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:25:26,815 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:25:26,815 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:25:26,815 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:25:26,815 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:25:26,815 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:25:26,816 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:25:26,816 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:25:26,816 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:25:26,816 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:25:26,816 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:25:26,816 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:25:26,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:25:26,819 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:25:26,819 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:25:26,819 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:25:26,820 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:25:26,820 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:25:26,820 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:25:26,820 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:25:26,820 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:25:26,820 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:25:26,821 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:25:26,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:25:26,821 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:25:26,821 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:25:26,825 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:25:26,826 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-14 02:25:26,887 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:25:26,899 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:25:26,903 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:25:26,905 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:25:26,905 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:25:26,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2019-01-14 02:25:26,965 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0489111d8/8ffc1a4e61984d10afb11305a2718a9d/FLAG1a27ec886 [2019-01-14 02:25:27,481 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:25:27,481 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strtol_true-termination.c.i [2019-01-14 02:25:27,499 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0489111d8/8ffc1a4e61984d10afb11305a2718a9d/FLAG1a27ec886 [2019-01-14 02:25:27,771 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0489111d8/8ffc1a4e61984d10afb11305a2718a9d [2019-01-14 02:25:27,775 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:25:27,776 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:25:27,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:27,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:25:27,781 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:25:27,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:27" (1/1) ... [2019-01-14 02:25:27,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700d6f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:27, skipping insertion in model container [2019-01-14 02:25:27,786 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:25:27" (1/1) ... [2019-01-14 02:25:27,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:25:27,835 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:25:28,226 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:28,239 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:25:28,402 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:25:28,455 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:25:28,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28 WrapperNode [2019-01-14 02:25:28,456 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:25:28,457 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:28,457 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:25:28,457 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:25:28,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,527 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:25:28,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:25:28,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:25:28,529 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:25:28,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,547 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,568 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... [2019-01-14 02:25:28,573 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:25:28,573 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:25:28,573 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:25:28,574 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:25:28,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 02:25:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:25:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-01-14 02:25:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:25:28,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:25:29,409 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:25:29,410 INFO L286 CfgBuilder]: Removed 11 assue(true) statements. [2019-01-14 02:25:29,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:29 BoogieIcfgContainer [2019-01-14 02:25:29,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:25:29,413 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:25:29,413 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:25:29,417 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:25:29,418 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:29,418 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:25:27" (1/3) ... [2019-01-14 02:25:29,419 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cd70623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:29, skipping insertion in model container [2019-01-14 02:25:29,419 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:29,420 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:25:28" (2/3) ... [2019-01-14 02:25:29,421 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1cd70623 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:25:29, skipping insertion in model container [2019-01-14 02:25:29,421 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:25:29,421 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:29" (3/3) ... [2019-01-14 02:25:29,424 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2019-01-14 02:25:29,481 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:25:29,482 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:25:29,482 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:25:29,482 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:25:29,483 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:25:29,483 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:25:29,483 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:25:29,484 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:25:29,484 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:25:29,501 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-14 02:25:29,532 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 02:25:29,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:29,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:29,542 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:25:29,542 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:29,542 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:25:29,542 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-01-14 02:25:29,547 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-01-14 02:25:29,547 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:29,547 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:29,547 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-01-14 02:25:29,548 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:29,554 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-14 02:25:29,554 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-14 02:25:29,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:29,561 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-01-14 02:25:29,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:29,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:29,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:29,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2019-01-14 02:25:29,721 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:29,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:29,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:29,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:29,739 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-01-14 02:25:29,740 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:29,740 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:29,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:29,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:30,865 WARN L181 SmtUtils]: Spent 925.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-01-14 02:25:31,051 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-14 02:25:31,081 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:31,083 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:31,083 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:31,083 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:31,083 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:31,083 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:31,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:31,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:31,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:25:31,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:31,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:31,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,795 WARN L181 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-14 02:25:31,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,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-14 02:25:31,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:31,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-14 02:25:31,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-14 02:25:31,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-14 02:25:32,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:32,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:32,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:32,044 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:33,119 WARN L181 SmtUtils]: Spent 609.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-01-14 02:25:33,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:33,319 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:33,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:33,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,324 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:33,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:33,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:33,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,338 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,338 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:33,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:33,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,349 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,349 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:33,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:33,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:33,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,384 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,384 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,396 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,404 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,404 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,414 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,415 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:33,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:33,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:33,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:33,423 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:33,423 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:33,430 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:33,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:33,527 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:33,581 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-14 02:25:33,581 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-14 02:25:33,584 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:33,586 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:33,587 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:33,587 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1, ULTIMATE.start_strtol_~nptr.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 - 1*ULTIMATE.start_strtol_~nptr.offset Supporting invariants [] [2019-01-14 02:25:33,688 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2019-01-14 02:25:33,698 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:33,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:33,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:33,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:33,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:33,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:33,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-14 02:25:33,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2019-01-14 02:25:34,179 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-14 02:25:34,181 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-14 02:25:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:25:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2019-01-14 02:25:34,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2019-01-14 02:25:34,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:34,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:25:34,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:34,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2019-01-14 02:25:34,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:34,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2019-01-14 02:25:34,200 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2019-01-14 02:25:34,206 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2019-01-14 02:25:34,208 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-01-14 02:25:34,208 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-01-14 02:25:34,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2019-01-14 02:25:34,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:34,209 INFO L706 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2019-01-14 02:25:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2019-01-14 02:25:34,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2019-01-14 02:25:34,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 02:25:34,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-01-14 02:25:34,235 INFO L729 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:25:34,235 INFO L609 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-01-14 02:25:34,236 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:25:34,236 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-01-14 02:25:34,237 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 02:25:34,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:34,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:34,237 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:34,238 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:34,238 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-14 02:25:34,238 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-14 02:25:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,239 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2019-01-14 02:25:34,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:34,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-01-14 02:25:34,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:34,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,309 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2019-01-14 02:25:34,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:34,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:34,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:34,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 02:25:34,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 02:25:34,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 02:25:34,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 02:25:34,507 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2019-01-14 02:25:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 02:25:34,772 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-01-14 02:25:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 02:25:34,774 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2019-01-14 02:25:34,777 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2019-01-14 02:25:34,779 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2019-01-14 02:25:34,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2019-01-14 02:25:34,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2019-01-14 02:25:34,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2019-01-14 02:25:34,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-14 02:25:34,781 INFO L706 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-01-14 02:25:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2019-01-14 02:25:34,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2019-01-14 02:25:34,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-14 02:25:34,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2019-01-14 02:25:34,786 INFO L729 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2019-01-14 02:25:34,787 INFO L609 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2019-01-14 02:25:34,787 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:25:34,787 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2019-01-14 02:25:34,787 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-01-14 02:25:34,788 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:25:34,789 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:25:34,789 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:25:34,789 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:25:34,790 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-14 02:25:34,790 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-14 02:25:34,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,790 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2019-01-14 02:25:34,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2019-01-14 02:25:34,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:25:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2019-01-14 02:25:34,859 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:25:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:25:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 02:25:34,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:25:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:34,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:25:35,755 WARN L181 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 152 [2019-01-14 02:25:36,061 WARN L181 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-01-14 02:25:36,064 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:25:36,064 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:25:36,064 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:25:36,065 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:25:36,065 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:25:36,065 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:25:36,065 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:25:36,065 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:25:36,065 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2019-01-14 02:25:36,065 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:25:36,065 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:25:36,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,654 WARN L181 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-01-14 02:25:36,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,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-14 02:25:36,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,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-14 02:25:36,887 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,892 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,893 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,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-14 02:25:36,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-14 02:25:36,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,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-14 02:25:36,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:36,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:25:37,221 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2019-01-14 02:25:38,578 WARN L181 SmtUtils]: Spent 817.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-01-14 02:25:38,705 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:25:38,705 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:25:38,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,712 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,714 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,725 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,726 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,726 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,734 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,739 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,744 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,747 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,748 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,755 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:25:38,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:25:38,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:25:38,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,795 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,797 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,797 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,801 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,801 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,801 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,805 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,808 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,813 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,813 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:25:38,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:25:38,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:25:38,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:25:38,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:25:38,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:25:38,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:25:38,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:25:38,882 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:25:38,928 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 02:25:38,928 INFO L444 ModelExtractionUtils]: 31 out of 40 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:25:38,929 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:25:38,932 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:25:38,933 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:25:38,933 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-14 02:25:39,131 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:25:39,136 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:25:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:25:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:39,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:25:39,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:25:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 02:25:39,337 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-14 02:25:39,337 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2019-01-14 02:25:39,466 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-14 02:25:39,467 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-14 02:25:39,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:25:39,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2019-01-14 02:25:39,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-14 02:25:39,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:39,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-14 02:25:39,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:39,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-14 02:25:39,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:25:39,468 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2019-01-14 02:25:39,471 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:39,472 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2019-01-14 02:25:39,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:25:39,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:25:39,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:25:39,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:25:39,473 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:39,473 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:39,473 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:25:39,473 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-14 02:25:39,473 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:25:39,473 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:25:39,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:25:39,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:25:39 BoogieIcfgContainer [2019-01-14 02:25:39,482 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:25:39,482 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:25:39,483 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:25:39,483 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:25:39,484 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:25:29" (3/4) ... [2019-01-14 02:25:39,488 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:25:39,488 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:25:39,489 INFO L168 Benchmark]: Toolchain (without parser) took 11713.18 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 309.3 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -77.4 MB). Peak memory consumption was 232.0 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:39,490 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:25:39,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:39,493 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.09 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-14 02:25:39,493 INFO L168 Benchmark]: Boogie Preprocessor took 44.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-14 02:25:39,495 INFO L168 Benchmark]: RCFGBuilder took 838.65 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.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:39,495 INFO L168 Benchmark]: BuchiAutomizer took 10069.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. [2019-01-14 02:25:39,496 INFO L168 Benchmark]: Witness Printer took 5.38 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-14 02:25:39,502 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.88 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.09 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 44.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 838.65 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.2 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10069.54 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 160.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.4 MB). Peak memory consumption was 227.9 MB. Max. memory is 11.5 GB. * Witness Printer took 5.38 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 unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * nptr 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.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 8.7s. Construction of modules took 0.4s. Büchi inclusion checks took 0.6s. 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: 24ms 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...