./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_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/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_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/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-08 14:31:48,246 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:31:48,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:31:48,253 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:31:48,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:31:48,254 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:31:48,254 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:31:48,255 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:31:48,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:31:48,256 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:31:48,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:31:48,257 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:31:48,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:31:48,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:31:48,258 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:31:48,259 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:31:48,259 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:31:48,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:31:48,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:31:48,261 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:31:48,262 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:31:48,262 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:31:48,263 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:31:48,263 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:31:48,264 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:31:48,264 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:31:48,264 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:31:48,265 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:31:48,265 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:31:48,266 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:31:48,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:31:48,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:31:48,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:31:48,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:31:48,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:31:48,267 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:31:48,267 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 14:31:48,274 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:31:48,275 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:31:48,275 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 14:31:48,275 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 14:31:48,276 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 14:31:48,276 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:31:48,276 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 14:31:48,277 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:31:48,277 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 14:31:48,277 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:31:48,278 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 14:31:48,278 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 14:31:48,278 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 14:31:48,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_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/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-08 14:31:48,295 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:31:48,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:31:48,304 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:31:48,305 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:31:48,305 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:31:48,306 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-12-08 14:31:48,343 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/data/59ebb8e86/b1635011169d48958f5bf33290b67a20/FLAG610f04a17 [2018-12-08 14:31:48,680 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:31:48,680 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/sv-benchmarks/c/termination-libowfat/strtol_true-termination.c.i [2018-12-08 14:31:48,686 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/data/59ebb8e86/b1635011169d48958f5bf33290b67a20/FLAG610f04a17 [2018-12-08 14:31:48,694 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/bin-2019/uautomizer/data/59ebb8e86/b1635011169d48958f5bf33290b67a20 [2018-12-08 14:31:48,696 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:31:48,697 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:31:48,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:31:48,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:31:48,700 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:31:48,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e50d1e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48, skipping insertion in model container [2018-12-08 14:31:48,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,706 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:31:48,724 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:31:48,873 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:31:48,879 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:31:48,937 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:31:48,957 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:31:48,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48 WrapperNode [2018-12-08 14:31:48,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:31:48,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:31:48,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:31:48,958 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:31:48,963 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,986 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:31:48,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:31:48,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:31:48,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:31:48,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:48,999 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:49,002 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:49,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... [2018-12-08 14:31:49,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:31:49,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:31:49,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:31:49,005 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:31:49,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_08d2ac64-1e3f-474f-90f8-c24f36cd8c1f/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-08 14:31:49,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:31:49,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 14:31:49,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:31:49,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:31:49,037 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:31:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:31:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-08 14:31:49,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:31:49,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:31:49,249 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:31:49,249 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-12-08 14:31:49,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:49 BoogieIcfgContainer [2018-12-08 14:31:49,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:31:49,249 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 14:31:49,250 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 14:31:49,252 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 14:31:49,252 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:31:49,252 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 02:31:48" (1/3) ... [2018-12-08 14:31:49,253 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59bd8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:31:49, skipping insertion in model container [2018-12-08 14:31:49,253 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:31:49,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:31:48" (2/3) ... [2018-12-08 14:31:49,253 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@59bd8658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 02:31:49, skipping insertion in model container [2018-12-08 14:31:49,253 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 14:31:49,253 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:49" (3/3) ... [2018-12-08 14:31:49,254 INFO L375 chiAutomizerObserver]: Analyzing ICFG strtol_true-termination.c.i [2018-12-08 14:31:49,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 14:31:49,286 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 14:31:49,286 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 14:31:49,286 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 14:31:49,286 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:31:49,286 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:31:49,286 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 14:31:49,286 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:31:49,286 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 14:31:49,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-12-08 14:31:49,309 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 14:31:49,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:31:49,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:31:49,313 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 14:31:49,313 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:31:49,313 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 14:31:49,313 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states. [2018-12-08 14:31:49,315 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 14:31:49,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:31:49,315 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:31:49,315 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 14:31:49,315 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:31:49,320 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-08 14:31:49,320 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-08 14:31:49,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:49,323 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 14:31:49,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:49,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:49,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:49,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1350, now seen corresponding path program 1 times [2018-12-08 14:31:49,402 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:49,402 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:49,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:49,409 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-08 14:31:49,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:49,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:49,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:49,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:49,653 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 103 [2018-12-08 14:31:49,729 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:31:49,730 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:31:49,730 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:31:49,730 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:31:49,730 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:31:49,730 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:31:49,730 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:31:49,731 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:31:49,731 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration1_Lasso [2018-12-08 14:31:49,731 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:31:49,731 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:31:49,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-08 14:31:49,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-08 14:31:49,921 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-08 14:31:49,922 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-08 14:31:49,923 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-08 14:31:49,924 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-08 14:31:49,925 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-08 14:31:49,926 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-08 14:31:49,928 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-08 14:31:49,929 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-08 14:31:49,930 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-08 14:31:49,932 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-08 14:31:49,933 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-08 14:31:49,936 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-08 14:31:49,938 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-08 14:31:49,939 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-08 14:31:49,940 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-08 14:31:49,942 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-08 14:31:49,944 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-08 14:31:49,945 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-08 14:31:49,946 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-08 14:31:49,947 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-08 14:31:50,182 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:31:50,185 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:31:50,187 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-08 14:31:50,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,188 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:50,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,189 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:50,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:50,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,191 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-08 14:31:50,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,193 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,193 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,197 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,197 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-08 14:31:50,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:50,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,198 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:50,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:50,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,199 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-08 14:31:50,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,203 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-08 14:31:50,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,206 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-08 14:31:50,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,207 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:31:50,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,207 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,208 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:31:50,208 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,214 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-08 14:31:50,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,216 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,219 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-08 14:31:50,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:50,222 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-08 14:31:50,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:50,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:50,222 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:50,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:50,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:50,224 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:50,248 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:31:50,270 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-08 14:31:50,270 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 14:31:50,271 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:31:50,272 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:31:50,272 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:31:50,273 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-08 14:31:50,292 INFO L297 tatePredicateManager]: 7 out of 8 supporting invariants were superfluous and have been removed [2018-12-08 14:31:50,298 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:31:50,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:50,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:50,339 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:50,348 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-08 14:31:50,357 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-08 14:31:50,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states. Second operand 3 states. [2018-12-08 14:31:50,478 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-08 14:31:50,478 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-08 14:31:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-08 14:31:50,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2018-12-08 14:31:50,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 2 letters. [2018-12-08 14:31:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-08 14:31:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:50,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 187 transitions. Stem has 3 letters. Loop has 4 letters. [2018-12-08 14:31:50,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:50,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 307 transitions. [2018-12-08 14:31:50,487 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 22 [2018-12-08 14:31:50,490 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 60 states and 87 transitions. [2018-12-08 14:31:50,491 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-12-08 14:31:50,491 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 58 [2018-12-08 14:31:50,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 87 transitions. [2018-12-08 14:31:50,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:31:50,492 INFO L705 BuchiCegarLoop]: Abstraction has 60 states and 87 transitions. [2018-12-08 14:31:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 87 transitions. [2018-12-08 14:31:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 35. [2018-12-08 14:31:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-08 14:31:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2018-12-08 14:31:50,509 INFO L728 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-12-08 14:31:50,509 INFO L608 BuchiCegarLoop]: Abstraction has 35 states and 50 transitions. [2018-12-08 14:31:50,509 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 14:31:50,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2018-12-08 14:31:50,510 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 14:31:50,510 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:31:50,510 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:31:50,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:50,511 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:31:50,511 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-08 14:31:50,511 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-08 14:31:50,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,511 INFO L82 PathProgramCache]: Analyzing trace with hash 179507088, now seen corresponding path program 1 times [2018-12-08 14:31:50,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:50,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 1 times [2018-12-08 14:31:50,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:50,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash 707620789, now seen corresponding path program 1 times [2018-12-08 14:31:50,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:50,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:50,585 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-08 14:31:50,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:31:50,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 14:31:50,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 14:31:50,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 14:31:50,607 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. cyclomatic complexity: 18 Second operand 6 states. [2018-12-08 14:31:50,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:31:50,724 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2018-12-08 14:31:50,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 14:31:50,725 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 112 transitions. [2018-12-08 14:31:50,726 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 20 [2018-12-08 14:31:50,727 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 77 states and 112 transitions. [2018-12-08 14:31:50,727 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 75 [2018-12-08 14:31:50,727 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 75 [2018-12-08 14:31:50,728 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 112 transitions. [2018-12-08 14:31:50,728 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 14:31:50,728 INFO L705 BuchiCegarLoop]: Abstraction has 77 states and 112 transitions. [2018-12-08 14:31:50,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 112 transitions. [2018-12-08 14:31:50,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 38. [2018-12-08 14:31:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-08 14:31:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 53 transitions. [2018-12-08 14:31:50,731 INFO L728 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-12-08 14:31:50,731 INFO L608 BuchiCegarLoop]: Abstraction has 38 states and 53 transitions. [2018-12-08 14:31:50,731 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 14:31:50,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 38 states and 53 transitions. [2018-12-08 14:31:50,732 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2018-12-08 14:31:50,732 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 14:31:50,732 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 14:31:50,732 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:31:50,732 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-08 14:31:50,733 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-08 14:31:50,733 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-08 14:31:50,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,733 INFO L82 PathProgramCache]: Analyzing trace with hash 179507026, now seen corresponding path program 1 times [2018-12-08 14:31:50,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:50,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,746 INFO L82 PathProgramCache]: Analyzing trace with hash 2022, now seen corresponding path program 2 times [2018-12-08 14:31:50,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:31:50,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:50,750 INFO L82 PathProgramCache]: Analyzing trace with hash 707561207, now seen corresponding path program 1 times [2018-12-08 14:31:50,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 14:31:50,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 14:31:50,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 14:31:50,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:31:50,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 14:31:51,111 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 149 [2018-12-08 14:31:51,228 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-08 14:31:51,229 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 14:31:51,229 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 14:31:51,229 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 14:31:51,229 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 14:31:51,230 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 14:31:51,230 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 14:31:51,230 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 14:31:51,230 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 14:31:51,230 INFO L131 ssoRankerPreferences]: Filename of dumped script: strtol_true-termination.c.i_Iteration3_Lasso [2018-12-08 14:31:51,230 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 14:31:51,230 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 14:31:51,235 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-08 14:31:51,236 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-08 14:31:51,237 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-08 14:31:51,238 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-08 14:31:51,246 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-08 14:31:51,247 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-08 14:31:51,248 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-08 14:31:51,249 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-08 14:31:51,250 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-08 14:31:51,252 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-08 14:31:51,253 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-08 14:31:51,429 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 87 [2018-12-08 14:31:51,467 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-08 14:31:51,468 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-08 14:31:51,469 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-08 14:31:51,470 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-08 14:31:51,470 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-08 14:31:51,471 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-08 14:31:51,472 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-08 14:31:51,473 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-08 14:31:51,474 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-08 14:31:51,474 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-08 14:31:51,475 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-08 14:31:51,476 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-08 14:31:51,477 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-08 14:31:51,478 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-08 14:31:51,479 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-08 14:31:51,479 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-08 14:31:51,480 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-08 14:31:51,481 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-08 14:31:51,483 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-08 14:31:51,484 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-08 14:31:51,484 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-08 14:31:51,485 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-08 14:31:51,486 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-08 14:31:51,487 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-08 14:31:51,488 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-08 14:31:51,488 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-08 14:31:51,489 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-08 14:31:51,490 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-08 14:31:51,491 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-08 14:31:51,491 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-08 14:31:51,493 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-08 14:31:51,494 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-08 14:31:51,494 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-08 14:31:51,495 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-08 14:31:51,496 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-08 14:31:51,497 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-08 14:31:51,497 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-08 14:31:51,498 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-08 14:31:51,499 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-08 14:31:51,500 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-08 14:31:51,501 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-08 14:31:51,502 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-08 14:31:51,503 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-08 14:31:51,842 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 14:31:51,843 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 14:31:51,843 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-08 14:31:51,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,844 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,846 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-08 14:31:51,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,847 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:31:51,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,849 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-08 14:31:51,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,849 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,850 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,853 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-08 14:31:51,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,853 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,855 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-08 14:31:51,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,855 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,856 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-08 14:31:51,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,857 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 14:31:51,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,862 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-08 14:31:51,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,862 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,862 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,863 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-08 14:31:51,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,866 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-08 14:31:51,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,867 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,867 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,869 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-08 14:31:51,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,870 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,871 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-08 14:31:51,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 14:31:51,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,872 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,872 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 14:31:51,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 14:31:51,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,873 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-08 14:31:51,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,874 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,875 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,879 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-08 14:31:51,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,881 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,882 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-08 14:31:51,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,884 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,884 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,885 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-08 14:31:51,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,886 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,886 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,888 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-08 14:31:51,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,888 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 14:31:51,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,890 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 14:31:51,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 14:31:51,897 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-08 14:31:51,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 14:31:51,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 14:31:51,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 14:31:51,897 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 14:31:51,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 14:31:51,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 14:31:51,909 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 14:31:51,918 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-12-08 14:31:51,918 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-08 14:31:51,918 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 14:31:51,919 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 14:31:51,919 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 14:31:51,919 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-08 14:31:51,948 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-08 14:31:51,952 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-08 14:31:51,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:31:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:51,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:31:51,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 14:31:52,007 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-08 14:31:52,007 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-08 14:31:52,007 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 38 states and 53 transitions. cyclomatic complexity: 18 Second operand 4 states. [2018-12-08 14:31:52,070 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-08 14:31:52,070 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-08 14:31:52,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 14:31:52,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 56 transitions. [2018-12-08 14:31:52,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-08 14:31:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:52,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-08 14:31:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:52,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 56 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-08 14:31:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 14:31:52,072 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 110 transitions. [2018-12-08 14:31:52,073 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:31:52,073 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 0 states and 0 transitions. [2018-12-08 14:31:52,073 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 14:31:52,073 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 14:31:52,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 14:31:52,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 14:31:52,073 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:31:52,074 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:31:52,074 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:31:52,074 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 14:31:52,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:31:52,074 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 14:31:52,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 14:31:52,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 02:31:52 BoogieIcfgContainer [2018-12-08 14:31:52,080 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 14:31:52,080 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:31:52,080 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:31:52,080 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:31:52,081 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:31:49" (3/4) ... [2018-12-08 14:31:52,083 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 14:31:52,083 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:31:52,083 INFO L168 Benchmark]: Toolchain (without parser) took 3387.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.5 MB). Free memory was 949.5 MB in the beginning and 860.3 MB in the end (delta: 89.3 MB). Peak memory consumption was 250.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:31:52,084 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-08 14:31:52,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 260.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-08 14:31:52,085 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:31:52,086 INFO L168 Benchmark]: Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:31:52,086 INFO L168 Benchmark]: RCFGBuilder took 243.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-12-08 14:31:52,086 INFO L168 Benchmark]: BuchiAutomizer took 2830.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 860.3 MB in the end (delta: 199.1 MB). Peak memory consumption was 254.6 MB. Max. memory is 11.5 GB. [2018-12-08 14:31:52,087 INFO L168 Benchmark]: Witness Printer took 2.73 ms. Allocated memory is still 1.2 GB. Free memory is still 860.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:31:52,090 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 260.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -140.2 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.97 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 243.89 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2830.56 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 55.6 MB). Free memory was 1.1 GB in the beginning and 860.3 MB in the end (delta: 199.1 MB). Peak memory consumption was 254.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.73 ms. Allocated memory is still 1.2 GB. Free memory is still 860.3 MB. 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.2s. 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: 7ms 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...