./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtol.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtol.i -s /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer --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-cad4683 [2019-11-15 21:13:26,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:13:26,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:13:26,550 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:13:26,551 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:13:26,552 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:13:26,553 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:13:26,555 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:13:26,557 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:13:26,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:13:26,558 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:13:26,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:13:26,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:13:26,561 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:13:26,562 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:13:26,563 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:13:26,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:13:26,564 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:13:26,566 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:13:26,567 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:13:26,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:13:26,570 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:13:26,571 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:13:26,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:13:26,574 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:13:26,574 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:13:26,574 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:13:26,575 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:13:26,576 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:13:26,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:13:26,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:13:26,577 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:13:26,578 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:13:26,579 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:13:26,580 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:13:26,580 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:13:26,581 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:13:26,581 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:13:26,581 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:13:26,582 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:13:26,583 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:13:26,583 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 21:13:26,597 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:13:26,597 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:13:26,598 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:13:26,599 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:13:26,599 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:13:26,599 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:13:26,599 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:13:26,599 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:13:26,600 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:13:26,600 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:13:26,600 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:13:26,600 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:13:26,601 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:13:26,601 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:13:26,601 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:13:26,601 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:13:26,601 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:13:26,602 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:13:26,602 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:13:26,602 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:13:26,602 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:13:26,602 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:13:26,603 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:13:26,603 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:13:26,603 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:13:26,603 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:13:26,603 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:13:26,604 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:13:26,605 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:13:26,605 INFO L138 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer 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-11-15 21:13:26,629 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:13:26,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:13:26,641 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:13:26,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:13:26,643 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:13:26,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol.i [2019-11-15 21:13:26,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/data/613ad6b50/7e96155352de4453bc2af9881c8ca2e7/FLAG0d4448d24 [2019-11-15 21:13:27,153 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:13:27,154 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/sv-benchmarks/c/termination-libowfat/strtol.i [2019-11-15 21:13:27,165 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/data/613ad6b50/7e96155352de4453bc2af9881c8ca2e7/FLAG0d4448d24 [2019-11-15 21:13:27,472 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/data/613ad6b50/7e96155352de4453bc2af9881c8ca2e7 [2019-11-15 21:13:27,474 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:13:27,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:13:27,476 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:13:27,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:13:27,479 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:13:27,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:13:27" (1/1) ... [2019-11-15 21:13:27,482 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4cdab0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:27, skipping insertion in model container [2019-11-15 21:13:27,482 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:13:27" (1/1) ... [2019-11-15 21:13:27,487 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:13:27,532 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:13:27,900 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:13:27,909 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:13:27,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:13:28,001 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:13:28,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28 WrapperNode [2019-11-15 21:13:28,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:13:28,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:13:28,002 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:13:28,002 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:13:28,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,025 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:13:28,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:13:28,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:13:28,054 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:13:28,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,067 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,067 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... [2019-11-15 21:13:28,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:13:28,104 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:13:28,104 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:13:28,104 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:13:28,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2681d63b-9fcd-455e-a657-30264737f50e/bin/uautomizer/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-11-15 21:13:28,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 21:13:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 21:13:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 21:13:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 21:13:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 21:13:28,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 21:13:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-15 21:13:28,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:13:28,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:13:28,625 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:13:28,626 INFO L284 CfgBuilder]: Removed 11 assume(true) statements. [2019-11-15 21:13:28,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:13:28 BoogieIcfgContainer [2019-11-15 21:13:28,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:13:28,627 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:13:28,627 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:13:28,630 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:13:28,630 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:13:28,630 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:13:27" (1/3) ... [2019-11-15 21:13:28,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cbf0403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:13:28, skipping insertion in model container [2019-11-15 21:13:28,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:13:28,631 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:13:28" (2/3) ... [2019-11-15 21:13:28,631 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@cbf0403 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:13:28, skipping insertion in model container [2019-11-15 21:13:28,631 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:13:28,632 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:13:28" (3/3) ... [2019-11-15 21:13:28,633 INFO L371 chiAutomizerObserver]: Analyzing ICFG strtol.i [2019-11-15 21:13:28,673 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:13:28,673 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:13:28,673 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:13:28,673 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:13:28,673 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:13:28,673 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:13:28,674 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:13:28,674 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:13:28,686 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-15 21:13:28,706 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 21:13:28,706 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:13:28,706 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:13:28,710 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:13:28,710 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:13:28,711 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:13:28,711 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2019-11-15 21:13:28,714 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2019-11-15 21:13:28,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:13:28,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:13:28,715 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 21:13:28,715 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:13:28,720 INFO L791 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-11-15 21:13:28,720 INFO L793 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-11-15 21:13:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 21:13:28,732 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:28,732 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989943331] [2019-11-15 21:13:28,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,733 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,865 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:28,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:28,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2019-11-15 21:13:28,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:28,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252266561] [2019-11-15 21:13:28,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,879 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:28,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:28,880 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2019-11-15 21:13:28,881 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:28,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468624709] [2019-11-15 21:13:28,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:28,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:28,935 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:29,557 WARN L191 SmtUtils]: Spent 556.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 106 [2019-11-15 21:13:29,710 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-11-15 21:13:29,719 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:13:29,720 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:13:29,720 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:13:29,720 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:13:29,721 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:13:29,721 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:13:29,721 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:13:29,721 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:13:29,721 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol.i_Iteration1_Lasso [2019-11-15 21:13:29,721 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:13:29,721 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:13:29,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-11-15 21:13:29,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:29,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,024 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-15 21:13:30,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,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-11-15 21:13:30,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-11-15 21:13:30,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-11-15 21:13:30,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:30,938 WARN L191 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 37 [2019-11-15 21:13:31,002 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:13:31,007 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:13:31,009 INFO L120 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-11-15 21:13:31,010 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,011 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:31,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:31,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:31,015 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,016 INFO L120 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-11-15 21:13:31,016 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,016 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:31,017 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,017 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,017 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,018 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:31,018 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:31,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,019 INFO L120 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-11-15 21:13:31,020 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,023 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,023 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,029 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,030 INFO L120 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-11-15 21:13:31,031 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,031 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:31,031 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,031 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,032 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:31,032 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:31,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,033 INFO L120 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-11-15 21:13:31,034 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,034 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,034 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,036 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,037 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,042 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,043 INFO L120 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-11-15 21:13:31,043 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,044 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,044 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,046 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,046 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,050 INFO L120 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-11-15 21:13:31,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,051 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,053 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,053 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,059 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,059 INFO L120 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-11-15 21:13:31,060 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,060 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,060 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,063 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,063 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:31,067 INFO L120 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-11-15 21:13:31,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:31,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:31,069 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:31,069 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:31,080 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:31,086 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:31,178 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:13:31,211 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 21:13:31,212 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 21:13:31,214 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:13:31,215 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:13:31,215 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:13:31,216 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtol_~nptr.offset, v_rep(select #length ULTIMATE.start_strtol_~nptr.base)_1) = -1*ULTIMATE.start_strtol_~nptr.offset + 1*v_rep(select #length ULTIMATE.start_strtol_~nptr.base)_1 Supporting invariants [] [2019-11-15 21:13:31,250 INFO L297 tatePredicateManager]: 8 out of 8 supporting invariants were superfluous and have been removed [2019-11-15 21:13:31,258 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:13:31,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:31,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:31,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:31,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:13:31,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:31,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:31,352 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-11-15 21:13:31,353 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2019-11-15 21:13:31,506 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 3 states. Result 201 states and 315 transitions. Complement of second has 7 states. [2019-11-15 21:13:31,509 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-11-15 21:13:31,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:13:31,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2019-11-15 21:13:31,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 193 transitions. Stem has 3 letters. Loop has 2 letters. [2019-11-15 21:13:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 193 transitions. Stem has 5 letters. Loop has 2 letters. [2019-11-15 21:13:31,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:31,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 193 transitions. Stem has 3 letters. Loop has 4 letters. [2019-11-15 21:13:31,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:31,519 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 201 states and 315 transitions. [2019-11-15 21:13:31,533 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2019-11-15 21:13:31,544 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 201 states to 60 states and 87 transitions. [2019-11-15 21:13:31,545 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-15 21:13:31,545 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2019-11-15 21:13:31,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2019-11-15 21:13:31,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 21:13:31,546 INFO L688 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2019-11-15 21:13:31,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2019-11-15 21:13:31,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2019-11-15 21:13:31,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 21:13:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-11-15 21:13:31,569 INFO L711 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-11-15 21:13:31,569 INFO L591 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-11-15 21:13:31,569 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:13:31,569 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2019-11-15 21:13:31,574 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2019-11-15 21:13:31,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:13:31,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:13:31,575 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:13:31,575 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 21:13:31,576 INFO L791 eck$LassoCheckResult]: Stem: 351#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 330#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; 331#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; 342#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 336#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 338#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 353#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; 325#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; 339#L512-3 [2019-11-15 21:13:31,576 INFO L793 eck$LassoCheckResult]: Loop: 339#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 340#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; 339#L512-3 [2019-11-15 21:13:31,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:31,577 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2019-11-15 21:13:31,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:31,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352790276] [2019-11-15 21:13:31,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,656 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:31,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:31,657 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2019-11-15 21:13:31,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:31,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692710795] [2019-11-15 21:13:31,657 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,674 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:31,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:31,674 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2019-11-15 21:13:31,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:13:31,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308315287] [2019-11-15 21:13:31,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:13:31,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:13:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:13:31,717 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:13:32,430 WARN L191 SmtUtils]: Spent 685.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 152 [2019-11-15 21:13:32,674 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-15 21:13:32,676 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:13:32,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:13:32,676 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:13:32,676 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:13:32,676 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:13:32,676 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:13:32,676 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:13:32,676 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:13:32,676 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol.i_Iteration2_Lasso [2019-11-15 21:13:32,677 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:13:32,677 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:13:32,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,691 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:32,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,068 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2019-11-15 21:13:33,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,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-11-15 21:13:33,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,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-11-15 21:13:33,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,174 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:33,232 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:13:34,215 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-11-15 21:13:34,334 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:13:34,334 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:13:34,335 INFO L120 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-11-15 21:13:34,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,336 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,338 INFO L120 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-11-15 21:13:34,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,339 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,339 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,340 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,340 INFO L120 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-11-15 21:13:34,341 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,341 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,341 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,341 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,341 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,342 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,342 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,343 INFO L120 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-11-15 21:13:34,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,346 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,350 INFO L120 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-11-15 21:13:34,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,351 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,351 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,351 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,352 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,352 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,353 INFO L120 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-11-15 21:13:34,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,354 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,354 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,355 INFO L120 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-11-15 21:13:34,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,357 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,357 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,360 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,360 INFO L120 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-11-15 21:13:34,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,361 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,361 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,362 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,362 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,363 INFO L120 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-11-15 21:13:34,364 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,365 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,365 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,368 INFO L120 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-11-15 21:13:34,368 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,368 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,369 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,369 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,369 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,371 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,371 INFO L120 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-11-15 21:13:34,372 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,372 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,372 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,372 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,372 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,373 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,373 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,374 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,374 INFO L120 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-11-15 21:13:34,375 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,375 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,375 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,375 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,376 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,377 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,384 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,385 INFO L120 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-11-15 21:13:34,386 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,386 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,386 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,386 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,387 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,387 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,390 INFO L120 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-11-15 21:13:34,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,391 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,391 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,392 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,392 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,394 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,394 INFO L120 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-11-15 21:13:34,395 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,395 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,395 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,396 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,396 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,398 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,398 INFO L120 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-11-15 21:13:34,399 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,399 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,400 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,401 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,403 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,404 INFO L120 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-11-15 21:13:34,404 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,405 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,405 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,405 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,406 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,406 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,408 INFO L120 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-11-15 21:13:34,408 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,409 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,410 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,410 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,412 INFO L120 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-11-15 21:13:34,413 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,413 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,413 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,414 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,414 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,417 INFO L120 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-11-15 21:13:34,418 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,418 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:13:34,418 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,418 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,419 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:13:34,419 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:13:34,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,420 INFO L120 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-11-15 21:13:34,420 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,421 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-15 21:13:34,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,421 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,426 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:13:34,426 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:13:34,459 INFO L120 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-11-15 21:13:34,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:13:34,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:13:34,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:13:34,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:13:34,463 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:13:34,463 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 21:13:34,486 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 21:13:34,505 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 21:13:34,506 INFO L444 ModelExtractionUtils]: 34 out of 40 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 21:13:34,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 21:13:34,507 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 21:13:34,507 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 21:13:34,508 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_strtoul_~nptr~0.base)_1) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_strtoul_~nptr~0.base)_1 Supporting invariants [] [2019-11-15 21:13:34,547 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-11-15 21:13:34,548 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-15 21:13:34,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:13:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:34,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:13:34,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:34,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:13:34,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:13:34,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:13:34,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:13:34,611 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-11-15 21:13:34,611 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 3 states. [2019-11-15 21:13:34,683 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 50 transitions. cyclomatic complexity: 18. Second operand 3 states. Result 73 states and 105 transitions. Complement of second has 6 states. [2019-11-15 21:13:34,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 21:13:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 21:13:34,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2019-11-15 21:13:34,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2019-11-15 21:13:34,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:34,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2019-11-15 21:13:34,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:34,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2019-11-15 21:13:34,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 21:13:34,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 105 transitions. [2019-11-15 21:13:34,688 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:13:34,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 0 states and 0 transitions. [2019-11-15 21:13:34,688 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:13:34,688 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:13:34,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:13:34,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:13:34,689 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:13:34,689 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:13:34,689 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:13:34,689 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:13:34,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:13:34,689 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:13:34,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:13:34,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:13:34 BoogieIcfgContainer [2019-11-15 21:13:34,695 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:13:34,698 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:13:34,698 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:13:34,699 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:13:34,699 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:13:28" (3/4) ... [2019-11-15 21:13:34,703 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:13:34,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:13:34,705 INFO L168 Benchmark]: Toolchain (without parser) took 7229.60 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -122.5 MB). Peak memory consumption was 189.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:34,706 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:13:34,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 525.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:34,707 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.47 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-11-15 21:13:34,708 INFO L168 Benchmark]: Boogie Preprocessor took 49.88 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-11-15 21:13:34,709 INFO L168 Benchmark]: RCFGBuilder took 523.24 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:34,709 INFO L168 Benchmark]: BuchiAutomizer took 6067.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.1 MB). Peak memory consumption was 169.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:13:34,710 INFO L168 Benchmark]: Witness Printer took 5.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:13:34,717 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 525.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -153.4 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.47 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 49.88 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. * RCFGBuilder took 523.24 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6067.42 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -13.1 MB). Peak memory consumption was 169.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.54 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[nptr] and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[nptr] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 25 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 35 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 127 SDtfs, 196 SDslu, 160 SDs, 0 SdLazy, 101 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 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: 38ms VariablesStem: 14 VariablesLoop: 5 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...