./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/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.23-635dfa2 [2018-12-02 06:23:40,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 06:23:40,246 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 06:23:40,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 06:23:40,252 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 06:23:40,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 06:23:40,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 06:23:40,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 06:23:40,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 06:23:40,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 06:23:40,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 06:23:40,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 06:23:40,256 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 06:23:40,257 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 06:23:40,257 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 06:23:40,258 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 06:23:40,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 06:23:40,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 06:23:40,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 06:23:40,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 06:23:40,261 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 06:23:40,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 06:23:40,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 06:23:40,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 06:23:40,263 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 06:23:40,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 06:23:40,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 06:23:40,264 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 06:23:40,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 06:23:40,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 06:23:40,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 06:23:40,265 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 06:23:40,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 06:23:40,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 06:23:40,266 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 06:23:40,266 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 06:23:40,267 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 06:23:40,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 06:23:40,274 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 06:23:40,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 06:23:40,275 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 06:23:40,275 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 06:23:40,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 06:23:40,276 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 06:23:40,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 06:23:40,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 06:23:40,277 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 06:23:40,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 06:23:40,277 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 06:23:40,277 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 06:23:40,278 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 06:23:40,278 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/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 [2018-12-02 06:23:40,294 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 06:23:40,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 06:23:40,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 06:23:40,303 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 06:23:40,304 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 06:23:40,304 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-12-02 06:23:40,339 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/data/56b186691/25362515ce194098bcc9c4ce4d30df59/FLAGeb0ddfdd5 [2018-12-02 06:23:40,730 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 06:23:40,731 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-12-02 06:23:40,737 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/data/56b186691/25362515ce194098bcc9c4ce4d30df59/FLAGeb0ddfdd5 [2018-12-02 06:23:41,070 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/uautomizer/data/56b186691/25362515ce194098bcc9c4ce4d30df59 [2018-12-02 06:23:41,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 06:23:41,073 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 06:23:41,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 06:23:41,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 06:23:41,076 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 06:23:41,076 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c110ad3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41, skipping insertion in model container [2018-12-02 06:23:41,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,082 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 06:23:41,106 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 06:23:41,273 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:23:41,279 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 06:23:41,339 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 06:23:41,367 INFO L195 MainTranslator]: Completed translation [2018-12-02 06:23:41,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41 WrapperNode [2018-12-02 06:23:41,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 06:23:41,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 06:23:41,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 06:23:41,368 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 06:23:41,375 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,399 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 06:23:41,400 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 06:23:41,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 06:23:41,400 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 06:23:41,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... [2018-12-02 06:23:41,419 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 06:23:41,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 06:23:41,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 06:23:41,420 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 06:23:41,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a0b2973c-c222-486a-89bd-91d146be0796/bin-2019/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 [2018-12-02 06:23:41,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 06:23:41,452 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 06:23:41,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 06:23:41,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 06:23:41,676 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 06:23:41,676 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-02 06:23:41,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:23:41 BoogieIcfgContainer [2018-12-02 06:23:41,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 06:23:41,677 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 06:23:41,678 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 06:23:41,680 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 06:23:41,681 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:23:41,681 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:23:41" (1/3) ... [2018-12-02 06:23:41,682 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f10d6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:23:41, skipping insertion in model container [2018-12-02 06:23:41,682 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:23:41,682 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:23:41" (2/3) ... [2018-12-02 06:23:41,683 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@f10d6c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:23:41, skipping insertion in model container [2018-12-02 06:23:41,683 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 06:23:41,683 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:23:41" (3/3) ... [2018-12-02 06:23:41,684 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-12-02 06:23:41,723 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 06:23:41,723 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 06:23:41,723 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 06:23:41,723 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 06:23:41,723 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 06:23:41,723 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 06:23:41,723 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 06:23:41,723 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 06:23:41,724 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 06:23:41,732 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-12-02 06:23:41,746 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-02 06:23:41,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:23:41,747 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:23:41,750 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 06:23:41,751 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:23:41,751 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 06:23:41,751 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-12-02 06:23:41,753 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-02 06:23:41,753 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:23:41,753 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:23:41,753 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-02 06:23:41,753 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:23:41,758 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 42#L562true assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(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.alloc(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 [2018-12-02 06:23:41,758 INFO L796 eck$LassoCheckResult]: Loop: 15#L554-3true call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 12#L554-1true assume !!(32 == strtol_#t~mem21);havoc strtol_#t~mem21;strtol_#t~post22.base, strtol_#t~post22.offset := strtol_~nptr.base, strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#t~post22.base, 1 + strtol_#t~post22.offset;havoc strtol_#t~post22.base, strtol_#t~post22.offset; 15#L554-3true [2018-12-02 06:23:41,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:41,761 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-02 06:23:41,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:41,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:41,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:41,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:41,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:41,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2018-12-02 06:23:41,839 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:41,839 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:41,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:41,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:41,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:41,846 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-02 06:23:41,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:41,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:41,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:42,102 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2018-12-02 06:23:42,191 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:23:42,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:23:42,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:23:42,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:23:42,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:23:42,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:23:42,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:23:42,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:23:42,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-12-02 06:23:42,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:23:42,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:23:42,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,390 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:42,638 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:23:42,641 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:23:42,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,644 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:42,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:42,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:42,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,650 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,650 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:42,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:42,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:42,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,666 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:23:42,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,666 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,668 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:23:42,668 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,676 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,676 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,681 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:42,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:42,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:42,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:42,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:42,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:42,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:42,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:42,723 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:23:42,755 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 06:23:42,755 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 06:23:42,757 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:23:42,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:23:42,759 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:23:42,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1, ULTIMATE.start_strtol_~nptr.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc30.base)_1 - 1*ULTIMATE.start_strtol_~nptr.offset Supporting invariants [] [2018-12-02 06:23:42,786 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-12-02 06:23:42,792 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 06:23:42,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:42,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:23:42,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:23:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:23:42,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:23:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:23:42,864 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-12-02 06:23:42,865 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2018-12-02 06:23:42,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states.. Second operand 3 states. Result 192 states and 307 transitions. Complement of second has 8 states. [2018-12-02 06:23:42,991 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 [2018-12-02 06:23:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 06:23:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2018-12-02 06:23:42,994 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-02 06:23:42,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:42,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 06:23:42,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:42,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-02 06:23:42,995 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:42,996 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2018-12-02 06:23:42,999 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-12-02 06:23:43,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2018-12-02 06:23:43,004 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-02 06:23:43,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-12-02 06:23:43,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2018-12-02 06:23:43,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:23:43,005 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-12-02 06:23:43,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2018-12-02 06:23:43,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-12-02 06:23:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 06:23:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-12-02 06:23:43,035 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-12-02 06:23:43,035 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-12-02 06:23:43,035 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 06:23:43,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-12-02 06:23:43,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-02 06:23:43,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:23:43,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:23:43,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:23:43,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:23:43,036 INFO L794 eck$LassoCheckResult]: Stem: 348#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 327#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 328#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(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.alloc(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 338#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 329#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 330#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 321#L555 assume !(45 == strtol_#t~mem23);havoc strtol_#t~mem23; 322#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 336#L512-3 [2018-12-02 06:23:43,036 INFO L796 eck$LassoCheckResult]: Loop: 336#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 337#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 336#L512-3 [2018-12-02 06:23:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2018-12-02 06:23:43,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:43,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,054 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-12-02 06:23:43,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:43,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,059 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2018-12-02 06:23:43,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:43,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:23:43,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:23:43,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 06:23:43,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 06:23:43,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 06:23:43,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 06:23:43,134 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-12-02 06:23:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 06:23:43,233 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2018-12-02 06:23:43,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 06:23:43,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2018-12-02 06:23:43,235 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-12-02 06:23:43,235 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2018-12-02 06:23:43,235 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-12-02 06:23:43,236 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-12-02 06:23:43,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2018-12-02 06:23:43,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-02 06:23:43,236 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2018-12-02 06:23:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2018-12-02 06:23:43,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2018-12-02 06:23:43,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-02 06:23:43,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-12-02 06:23:43,238 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-12-02 06:23:43,238 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-12-02 06:23:43,238 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 06:23:43,238 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2018-12-02 06:23:43,239 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-02 06:23:43,239 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 06:23:43,239 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 06:23:43,239 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 06:23:43,239 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 06:23:43,239 INFO L794 eck$LassoCheckResult]: Stem: 477#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 454#L-1 havoc main_#res;havoc main_#t~nondet29, main_#t~malloc30.base, main_#t~malloc30.offset, main_#t~nondet31, main_#t~ret32, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~base~0, main_~#end~0.base, main_~#end~0.offset;main_~in_len~0 := main_#t~nondet29;havoc main_#t~nondet29; 455#L562 assume !(main_~in_len~0 < 1);call main_#t~malloc30.base, main_#t~malloc30.offset := #Ultimate.alloc(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.alloc(8);call write~init~$Pointer$(0, 0, main_~#end~0.base, main_~#end~0.offset, 8);strtol_#in~nptr.base, strtol_#in~nptr.offset, strtol_#in~endptr.base, strtol_#in~endptr.offset, strtol_#in~base := main_~in~0.base, main_~in~0.offset, main_~#end~0.base, main_~#end~0.offset, main_~base~0;havoc strtol_#res;havoc strtol_#t~post22.base, strtol_#t~post22.offset, strtol_#t~mem21, strtol_#t~mem23, strtol_#t~pre24.base, strtol_#t~pre24.offset, strtol_#t~ret25, strtol_#t~mem26.base, strtol_#t~mem26.offset, strtol_#t~short27, strtol_#t~ite28, strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base, strtol_~neg~1, strtol_~v~1, strtol_~orig~1.base, strtol_~orig~1.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_#in~nptr.base, strtol_#in~nptr.offset;strtol_~endptr.base, strtol_~endptr.offset := strtol_#in~endptr.base, strtol_#in~endptr.offset;strtol_~base := strtol_#in~base;strtol_~neg~1 := 0;havoc strtol_~v~1;strtol_~orig~1.base, strtol_~orig~1.offset := strtol_~nptr.base, strtol_~nptr.offset; 466#L554-3 call strtol_#t~mem21 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 460#L554-1 assume !(32 == strtol_#t~mem21);havoc strtol_#t~mem21; 462#L554-4 call strtol_#t~mem23 := read~int(strtol_~nptr.base, strtol_~nptr.offset, 1); 479#L555 assume 45 == strtol_#t~mem23;havoc strtol_#t~mem23;strtol_~neg~1 := -1;strtol_#t~pre24.base, strtol_#t~pre24.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;strtol_~nptr.base, strtol_~nptr.offset := strtol_~nptr.base, 1 + strtol_~nptr.offset;havoc strtol_#t~pre24.base, strtol_#t~pre24.offset; 480#L555-2 strtoul_#in~ptr.base, strtoul_#in~ptr.offset, strtoul_#in~endptr.base, strtoul_#in~endptr.offset, strtoul_#in~base := strtol_~nptr.base, strtol_~nptr.offset, strtol_~endptr.base, strtol_~endptr.offset, strtol_~base;havoc strtoul_#res;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset, strtoul_#t~mem2, strtoul_#t~mem4, strtoul_#t~post5.base, strtoul_#t~post5.offset, strtoul_#t~mem6, strtoul_#t~pre7.base, strtoul_#t~pre7.offset, strtoul_#t~mem8, strtoul_#t~short9, strtoul_~b~0, strtoul_#t~mem10, strtoul_#t~mem11, strtoul_#t~mem12, strtoul_#t~short13, strtoul_#t~mem14, strtoul_#t~ite17, strtoul_#t~ite16, strtoul_#t~ite15, strtoul_~x~0, strtoul_~w~0, strtoul_#t~pre18.base, strtoul_#t~pre18.offset, strtoul_~c~0, strtoul_#t~mem19, strtoul_#t~ite20, strtoul_~ptr.base, strtoul_~ptr.offset, strtoul_~endptr.base, strtoul_~endptr.offset, strtoul_~base, strtoul_~neg~0, strtoul_~v~0, strtoul_~orig~0.base, strtoul_~orig~0.offset, strtoul_~nptr~0.base, strtoul_~nptr~0.offset;strtoul_~ptr.base, strtoul_~ptr.offset := strtoul_#in~ptr.base, strtoul_#in~ptr.offset;strtoul_~endptr.base, strtoul_~endptr.offset := strtoul_#in~endptr.base, strtoul_#in~endptr.offset;strtoul_~base := strtoul_#in~base;strtoul_~neg~0 := 0;strtoul_~v~0 := 0;havoc strtoul_~orig~0.base, strtoul_~orig~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~ptr.base, strtoul_~ptr.offset; 463#L512-3 [2018-12-02 06:23:43,240 INFO L796 eck$LassoCheckResult]: Loop: 463#L512-3 call strtoul_#t~mem2 := read~int(strtoul_~nptr~0.base, strtoul_~nptr~0.offset, 1); 464#L512-1 assume !!(32 == strtoul_#t~mem2);havoc strtoul_#t~mem2;strtoul_#t~pre3.base, strtoul_#t~pre3.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;strtoul_~nptr~0.base, strtoul_~nptr~0.offset := strtoul_~nptr~0.base, 1 + strtoul_~nptr~0.offset;havoc strtoul_#t~pre3.base, strtoul_#t~pre3.offset; 463#L512-3 [2018-12-02 06:23:43,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,240 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2018-12-02 06:23:43,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:43,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-12-02 06:23:43,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 06:23:43,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:43,263 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2018-12-02 06:23:43,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 06:23:43,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 06:23:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 06:23:43,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 06:23:43,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 06:23:43,615 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 149 [2018-12-02 06:23:43,731 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-02 06:23:43,732 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 06:23:43,732 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 06:23:43,732 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 06:23:43,732 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 06:23:43,732 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 06:23:43,732 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 06:23:43,732 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 06:23:43,733 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 06:23:43,733 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-12-02 06:23:43,733 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 06:23:43,733 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 06:23:43,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,915 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-12-02 06:23:43,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:43,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 06:23:44,376 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 06:23:44,376 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 06:23:44,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,377 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,379 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,380 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,381 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,382 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,388 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,392 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,395 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 06:23:44,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,402 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 06:23:44,402 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 06:23:44,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,410 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,413 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,413 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,416 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,418 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-02 06:23:44,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,418 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,420 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 06:23:44,420 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 06:23:44,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 06:23:44,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 06:23:44,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 06:23:44,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 06:23:44,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 06:23:44,429 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 06:23:44,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 06:23:44,438 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 06:23:44,447 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-02 06:23:44,447 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-02 06:23:44,447 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 06:23:44,448 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 06:23:44,448 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 06:23:44,448 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strtoul_~nptr~0.offset, v_rep(select #length ULTIMATE.start_main_~in~0.base)_1) = -1*ULTIMATE.start_strtoul_~nptr~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~in~0.base)_1 Supporting invariants [] [2018-12-02 06:23:44,479 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-02 06:23:44,480 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-02 06:23:44,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 06:23:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:23:44,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:23:44,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 06:23:44,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 06:23:44,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 06:23:44,536 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2018-12-02 06:23:44,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-12-02 06:23:44,597 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18. Second operand 4 states. Result 77 states and 110 transitions. Complement of second has 7 states. [2018-12-02 06:23:44,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-02 06:23:44,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-02 06:23:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-02 06:23:44,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-02 06:23:44,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:44,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-02 06:23:44,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:44,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-02 06:23:44,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 06:23:44,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2018-12-02 06:23:44,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:23:44,599 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 06:23:44,599 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 06:23:44,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 06:23:44,599 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 06:23:44,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 06:23:44,599 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 06:23:44,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 06:23:44,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:23:44 BoogieIcfgContainer [2018-12-02 06:23:44,603 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 06:23:44,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 06:23:44,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 06:23:44,604 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 06:23:44,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:23:41" (3/4) ... [2018-12-02 06:23:44,606 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 06:23:44,606 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 06:23:44,607 INFO L168 Benchmark]: Toolchain (without parser) took 3534.25 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 314.6 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -285.9 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:23:44,607 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:23:44,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 293.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. [2018-12-02 06:23:44,608 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.83 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. [2018-12-02 06:23:44,608 INFO L168 Benchmark]: Boogie Preprocessor took 19.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-02 06:23:44,608 INFO L168 Benchmark]: RCFGBuilder took 257.59 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. [2018-12-02 06:23:44,609 INFO L168 Benchmark]: BuchiAutomizer took 2926.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2018-12-02 06:23:44,609 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 06:23:44,611 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 293.72 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.9 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 30.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.83 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 19.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 257.59 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: 30.9 MB). Peak memory consumption was 30.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2926.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 187.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -164.1 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 3 terminating modules (1 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (in_len)] + -1 * nptr and consists of 5 locations. One deterministic module has affine ranking function -1 * nptr + unknown-#length-unknown[in] and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.8s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. 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 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 64 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 38 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 162 SDtfs, 217 SDslu, 292 SDs, 0 SdLazy, 233 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital242 mio100 ax100 hnf100 lsp91 ukn67 mio100 lsp37 div100 bol100 ite100 ukn100 eq190 hnf88 smp97 dnf107 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms VariablesStem: 3 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...