./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-libowfat/strlcpy_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_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/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 fd4754e908bed6ae29d10e34d903201d1cfa0296 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-01 14:37:15,497 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 14:37:15,498 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 14:37:15,507 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 14:37:15,507 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 14:37:15,508 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 14:37:15,509 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 14:37:15,510 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 14:37:15,511 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 14:37:15,512 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 14:37:15,512 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 14:37:15,513 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 14:37:15,513 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 14:37:15,514 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 14:37:15,515 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 14:37:15,515 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 14:37:15,516 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 14:37:15,517 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 14:37:15,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 14:37:15,519 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 14:37:15,520 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 14:37:15,521 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 14:37:15,522 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 14:37:15,523 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 14:37:15,523 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 14:37:15,523 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 14:37:15,524 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 14:37:15,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 14:37:15,525 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 14:37:15,526 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 14:37:15,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 14:37:15,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 14:37:15,526 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 14:37:15,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 14:37:15,527 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 14:37:15,528 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 14:37:15,528 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-01 14:37:15,539 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 14:37:15,539 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 14:37:15,540 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 14:37:15,540 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 14:37:15,540 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 14:37:15,541 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 14:37:15,541 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 14:37:15,541 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 14:37:15,541 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 14:37:15,541 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 14:37:15,541 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 14:37:15,541 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 14:37:15,542 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 14:37:15,543 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 14:37:15,543 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 14:37:15,543 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 14:37:15,543 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 14:37:15,543 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 14:37:15,543 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 14:37:15,544 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 14:37:15,544 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 14:37:15,544 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 14:37:15,545 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 14:37:15,545 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_17b752f1-0d58-4223-bb96-393eeed36113/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 -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-12-01 14:37:15,568 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 14:37:15,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 14:37:15,580 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 14:37:15,581 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 14:37:15,581 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 14:37:15,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/../../sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-12-01 14:37:15,625 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/data/921c16636/3f5c49e72c8c4ffdb9f256d37bd704d1/FLAG8c4c4ef04 [2018-12-01 14:37:16,021 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 14:37:16,021 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/sv-benchmarks/c/termination-libowfat/strlcpy_true-termination.c.i [2018-12-01 14:37:16,027 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/data/921c16636/3f5c49e72c8c4ffdb9f256d37bd704d1/FLAG8c4c4ef04 [2018-12-01 14:37:16,037 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/bin-2019/uautomizer/data/921c16636/3f5c49e72c8c4ffdb9f256d37bd704d1 [2018-12-01 14:37:16,040 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 14:37:16,041 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 14:37:16,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 14:37:16,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 14:37:16,043 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 14:37:16,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f7b822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16, skipping insertion in model container [2018-12-01 14:37:16,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,050 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 14:37:16,068 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 14:37:16,208 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:37:16,251 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 14:37:16,283 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 14:37:16,305 INFO L195 MainTranslator]: Completed translation [2018-12-01 14:37:16,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16 WrapperNode [2018-12-01 14:37:16,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 14:37:16,306 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 14:37:16,306 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 14:37:16,306 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 14:37:16,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,334 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 14:37:16,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 14:37:16,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 14:37:16,334 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 14:37:16,339 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,342 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,347 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... [2018-12-01 14:37:16,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 14:37:16,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 14:37:16,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 14:37:16,354 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 14:37:16,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_17b752f1-0d58-4223-bb96-393eeed36113/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-01 14:37:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 14:37:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-01 14:37:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 14:37:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 14:37:16,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 14:37:16,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 14:37:16,511 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 14:37:16,511 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 14:37:16,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:37:16 BoogieIcfgContainer [2018-12-01 14:37:16,511 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 14:37:16,512 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 14:37:16,512 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 14:37:16,514 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 14:37:16,514 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:37:16,514 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 02:37:16" (1/3) ... [2018-12-01 14:37:16,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d64283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:37:16, skipping insertion in model container [2018-12-01 14:37:16,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:37:16,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 02:37:16" (2/3) ... [2018-12-01 14:37:16,515 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@71d64283 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 02:37:16, skipping insertion in model container [2018-12-01 14:37:16,515 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 14:37:16,515 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:37:16" (3/3) ... [2018-12-01 14:37:16,516 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-12-01 14:37:16,545 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 14:37:16,546 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 14:37:16,546 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 14:37:16,546 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 14:37:16,546 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 14:37:16,546 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 14:37:16,546 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 14:37:16,546 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 14:37:16,546 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 14:37:16,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-01 14:37:16,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 14:37:16,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:37:16,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:37:16,572 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 14:37:16,572 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 14:37:16,572 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 14:37:16,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-12-01 14:37:16,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-12-01 14:37:16,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:37:16,574 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:37:16,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 14:37:16,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 14:37:16,579 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 12#L515-4true [2018-12-01 14:37:16,579 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~mem7;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2018-12-01 14:37:16,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-12-01 14:37:16,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:16,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:16,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:16,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:16,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:16,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:16,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-12-01 14:37:16,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:16,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:16,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:16,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-12-01 14:37:16,688 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:16,688 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:16,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:16,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:17,073 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-12-01 14:37:17,169 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:37:17,170 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:37:17,170 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:37:17,170 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:37:17,171 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:37:17,171 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:37:17,171 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:37:17,171 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:37:17,171 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-12-01 14:37:17,171 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:37:17,171 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:37:17,189 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-01 14:37:17,193 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-01 14:37:17,194 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-01 14:37:17,196 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-01 14:37:17,198 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-01 14:37:17,199 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-01 14:37:17,201 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-01 14:37:17,202 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-01 14:37:17,204 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-01 14:37:17,205 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-01 14:37:17,206 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-01 14:37:17,207 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-01 14:37:17,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:17,209 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-01 14:37:17,210 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-01 14:37:17,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:17,213 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-01 14:37:17,419 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-12-01 14:37:17,538 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-12-01 14:37:17,538 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-01 14:37:17,540 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-01 14:37:17,832 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-12-01 14:37:18,130 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:37:18,133 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:37:18,134 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-01 14:37:18,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,136 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,137 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,139 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-01 14:37:18,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,140 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-01 14:37:18,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,141 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-01 14:37:18,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,142 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,143 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:18,143 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:18,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,146 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-01 14:37:18,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,147 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,148 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-01 14:37:18,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,149 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,150 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,151 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-01 14:37:18,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,152 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,153 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-01 14:37:18,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,153 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:18,154 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:18,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,156 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-01 14:37:18,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,156 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,157 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,157 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,157 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-01 14:37:18,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,158 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-01 14:37:18,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,160 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-01 14:37:18,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,161 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-01 14:37:18,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,162 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,163 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-01 14:37:18,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,163 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,163 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,164 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-01 14:37:18,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,166 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-01 14:37:18,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:18,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,167 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-01 14:37:18,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:18,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,168 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 14:37:18,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,168 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 14:37:18,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:18,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:18,170 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-01 14:37:18,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:18,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:18,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:18,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:18,177 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:18,177 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:18,233 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:37:18,281 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-01 14:37:18,281 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-12-01 14:37:18,282 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:37:18,283 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:37:18,283 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:37:18,284 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 Supporting invariants [] [2018-12-01 14:37:18,333 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-12-01 14:37:18,338 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:37:18,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:18,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:18,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:18,378 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:18,391 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-01 14:37:18,401 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-01 14:37:18,402 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-12-01 14:37:18,461 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 50 states and 71 transitions. Complement of second has 7 states. [2018-12-01 14:37:18,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 14:37:18,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 14:37:18,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-12-01 14:37:18,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2018-12-01 14:37:18,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:18,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2018-12-01 14:37:18,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:18,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2018-12-01 14:37:18,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:18,466 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2018-12-01 14:37:18,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 14:37:18,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 10 states and 12 transitions. [2018-12-01 14:37:18,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-12-01 14:37:18,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-12-01 14:37:18,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-12-01 14:37:18,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:37:18,472 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-01 14:37:18,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-12-01 14:37:18,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-01 14:37:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 14:37:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-12-01 14:37:18,488 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-01 14:37:18,488 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-12-01 14:37:18,488 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 14:37:18,489 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-12-01 14:37:18,489 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 14:37:18,489 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:37:18,489 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:37:18,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:18,489 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 14:37:18,490 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 184#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 191#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 189#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 190#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 192#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 187#L521 assume !(0 != strlcpy_~siz % 4294967296); 185#L523-2 [2018-12-01 14:37:18,490 INFO L796 eck$LassoCheckResult]: Loop: 185#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 186#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 185#L523-2 [2018-12-01 14:37:18,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,490 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-12-01 14:37:18,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:18,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:18,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:18,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:18,567 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-01 14:37:18,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 14:37:18,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 14:37:18,569 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-01 14:37:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2018-12-01 14:37:18,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:18,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:18,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:18,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 14:37:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 14:37:18,598 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 14:37:18,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 14:37:18,630 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-01 14:37:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 14:37:18,631 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-12-01 14:37:18,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-01 14:37:18,632 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-12-01 14:37:18,632 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-01 14:37:18,632 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-01 14:37:18,632 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-12-01 14:37:18,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:37:18,632 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-01 14:37:18,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-12-01 14:37:18,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-12-01 14:37:18,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-01 14:37:18,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-01 14:37:18,633 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 14:37:18,633 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-01 14:37:18,633 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 14:37:18,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-12-01 14:37:18,634 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 14:37:18,634 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:37:18,634 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:37:18,635 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:18,635 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 14:37:18,635 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 218#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 223#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 224#L514 assume !strlcpy_#t~short3; 225#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 229#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 228#L521 assume !(0 != strlcpy_~siz % 4294967296); 220#L523-2 [2018-12-01 14:37:18,635 INFO L796 eck$LassoCheckResult]: Loop: 220#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 221#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 220#L523-2 [2018-12-01 14:37:18,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,635 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-12-01 14:37:18,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:18,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:18,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2018-12-01 14:37:18,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:18,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:18,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:18,649 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2018-12-01 14:37:18,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:18,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:18,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:37:18,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:18,839 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2018-12-01 14:37:18,897 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:37:18,897 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:37:18,897 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:37:18,897 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:37:18,898 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:37:18,898 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:37:18,898 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:37:18,898 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:37:18,898 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-12-01 14:37:18,898 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:37:18,898 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:37:18,900 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-01 14:37:18,901 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-01 14:37:18,903 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-01 14:37:18,905 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-01 14:37:18,905 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-01 14:37:18,906 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-01 14:37:18,907 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-01 14:37:18,908 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-01 14:37:18,909 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-01 14:37:18,910 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-01 14:37:18,911 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-01 14:37:18,912 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-01 14:37:18,913 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-01 14:37:18,914 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-01 14:37:18,915 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-01 14:37:18,915 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-01 14:37:18,916 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-01 14:37:19,057 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-01 14:37:19,058 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-01 14:37:19,313 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:37:19,313 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:37:19,313 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-01 14:37:19,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,315 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-01 14:37:19,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,316 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,316 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,316 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,316 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,316 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-01 14:37:19,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,317 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,318 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,318 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,319 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-01 14:37:19,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,319 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,320 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-01 14:37:19,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,322 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-01 14:37:19,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,324 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-01 14:37:19,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,326 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-01 14:37:19,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,327 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,327 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,329 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-01 14:37:19,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,330 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,330 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,332 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-01 14:37:19,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,334 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-01 14:37:19,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,335 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,336 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-01 14:37:19,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,338 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-01 14:37:19,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,340 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-01 14:37:19,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:37:19,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,344 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-01 14:37:19,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:19,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,346 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-01 14:37:19,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,347 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,349 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-01 14:37:19,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,352 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,357 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-01 14:37:19,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:19,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,357 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 14:37:19,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,358 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 14:37:19,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:19,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,360 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-01 14:37:19,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,363 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-01 14:37:19,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,365 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:37:19,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,370 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-01 14:37:19,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,371 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,371 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:19,373 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-01 14:37:19,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:19,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:19,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:19,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:19,376 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:19,376 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:19,386 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:37:19,394 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-01 14:37:19,394 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-01 14:37:19,394 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:37:19,395 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:37:19,395 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:37:19,395 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-12-01 14:37:19,418 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-12-01 14:37:19,419 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:37:19,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:19,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:19,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:19,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:19,456 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-01 14:37:19,456 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-01 14:37:19,456 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-12-01 14:37:19,471 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 17 states and 19 transitions. Complement of second has 5 states. [2018-12-01 14:37:19,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 14:37:19,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 14:37:19,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-12-01 14:37:19,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-01 14:37:19,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:19,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-01 14:37:19,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:19,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 14:37:19,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:19,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-12-01 14:37:19,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 14:37:19,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 14 transitions. [2018-12-01 14:37:19,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-12-01 14:37:19,473 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-12-01 14:37:19,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-12-01 14:37:19,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:37:19,473 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-12-01 14:37:19,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-12-01 14:37:19,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-12-01 14:37:19,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-01 14:37:19,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-01 14:37:19,474 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-01 14:37:19,474 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-01 14:37:19,474 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 14:37:19,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-12-01 14:37:19,475 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-01 14:37:19,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 14:37:19,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 14:37:19,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 14:37:19,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-01 14:37:19,475 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 333#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 338#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 339#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 340#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~pre2;havoc strlcpy_#t~short3; 341#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 334#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 335#L523-2 [2018-12-01 14:37:19,475 INFO L796 eck$LassoCheckResult]: Loop: 335#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 336#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset;havoc strlcpy_#t~mem9; 335#L523-2 [2018-12-01 14:37:19,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:19,475 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-12-01 14:37:19,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:19,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:19,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:19,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2018-12-01 14:37:19,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:19,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 14:37:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2018-12-01 14:37:19,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 14:37:19,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 14:37:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 14:37:19,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 14:37:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 14:37:19,726 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2018-12-01 14:37:19,797 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 14:37:19,797 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 14:37:19,797 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 14:37:19,797 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 14:37:19,797 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 14:37:19,797 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 14:37:19,797 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 14:37:19,797 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 14:37:19,797 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-12-01 14:37:19,797 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 14:37:19,797 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 14:37:19,799 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-01 14:37:19,800 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-01 14:37:19,801 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-01 14:37:19,802 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-01 14:37:19,803 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-01 14:37:19,804 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-01 14:37:19,805 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-01 14:37:19,806 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-01 14:37:19,807 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-01 14:37:19,808 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-01 14:37:19,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:19,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 14:37:20,248 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 14:37:20,248 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 14:37:20,248 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-01 14:37:20,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,249 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,250 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-01 14:37:20,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,251 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,251 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-01 14:37:20,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,252 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-01 14:37:20,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,253 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-01 14:37:20,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,254 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-01 14:37:20,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,255 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-01 14:37:20,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,257 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-01 14:37:20,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,258 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:37:20,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 14:37:20,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,261 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-01 14:37:20,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 14:37:20,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,262 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 14:37:20,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 14:37:20,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 14:37:20,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,264 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-01 14:37:20,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,265 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,269 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-01 14:37:20,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,270 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,272 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-01 14:37:20,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,272 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 14:37:20,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,273 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 14:37:20,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:37:20,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,279 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,279 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,281 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-01 14:37:20,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,281 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-01 14:37:20,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 14:37:20,282 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 14:37:20,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-01 14:37:20,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 14:37:20,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 14:37:20,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 14:37:20,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 14:37:20,289 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 14:37:20,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-01 14:37:20,300 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-01 14:37:20,307 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-01 14:37:20,307 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-01 14:37:20,308 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-01 14:37:20,308 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-01 14:37:20,309 INFO L518 LassoAnalysis]: Proved termination. [2018-12-01 14:37:20,309 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3) = -1*ULTIMATE.start_strlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 Supporting invariants [] [2018-12-01 14:37:20,338 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-12-01 14:37:20,339 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-12-01 14:37:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 14:37:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:20,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 14:37:20,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-01 14:37:20,381 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-01 14:37:20,381 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-01 14:37:20,381 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-12-01 14:37:20,398 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 12 states and 13 transitions. Complement of second has 5 states. [2018-12-01 14:37:20,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-01 14:37:20,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-01 14:37:20,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-12-01 14:37:20,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2018-12-01 14:37:20,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:20,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2018-12-01 14:37:20,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:20,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2018-12-01 14:37:20,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-01 14:37:20,399 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-12-01 14:37:20,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 14:37:20,400 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-01 14:37:20,400 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-01 14:37:20,400 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 14:37:20,400 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 14:37:20,400 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-01 14:37:20,400 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-01 14:37:20,400 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-01 14:37:20,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 02:37:20 BoogieIcfgContainer [2018-12-01 14:37:20,405 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 14:37:20,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 14:37:20,405 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 14:37:20,405 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 14:37:20,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 02:37:16" (3/4) ... [2018-12-01 14:37:20,409 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-01 14:37:20,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 14:37:20,409 INFO L168 Benchmark]: Toolchain (without parser) took 4369.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 215.5 MB). Free memory was 951.7 MB in the beginning and 1.2 GB in the end (delta: -242.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:37:20,410 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:37:20,411 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:37:20,411 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.38 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:37:20,412 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:37:20,412 INFO L168 Benchmark]: RCFGBuilder took 157.67 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-01 14:37:20,412 INFO L168 Benchmark]: BuchiAutomizer took 3893.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:37:20,413 INFO L168 Benchmark]: Witness Printer took 3.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 14:37:20,416 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 264.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.38 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.22 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 157.67 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: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3893.24 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 107.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -121.4 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 3.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 53 SDslu, 33 SDs, 0 SdLazy, 35 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 5ms VariablesStem: 5 VariablesLoop: 2 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...