./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 31c220d29d6dec1ef33d2c1aa086e47a745ff101 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 23:18:01,392 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:01,394 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:01,407 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:01,408 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:01,409 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:01,410 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:01,412 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:01,414 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:01,415 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:01,417 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:01,417 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:01,418 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:01,419 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:01,420 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:01,421 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:01,422 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:01,424 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:01,430 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:01,434 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:01,435 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:01,440 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:01,447 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:01,447 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:01,448 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:01,449 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:01,453 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:01,454 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:01,455 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:01,459 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:01,460 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:01,461 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:01,462 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:01,464 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:01,465 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:01,466 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:01,466 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-28 23:18:01,502 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:01,505 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:01,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:01,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:01,510 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:01,510 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:01,510 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:01,510 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:01,510 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:01,511 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:01,511 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:01,511 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:01,511 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:01,511 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:01,512 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:01,514 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:01,514 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:01,514 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:01,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:01,515 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:01,517 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:01,517 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:01,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:01,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:01,518 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:01,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:01,520 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:01,521 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:01,522 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:01,522 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 31c220d29d6dec1ef33d2c1aa086e47a745ff101 [2018-11-28 23:18:01,600 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:01,623 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:01,628 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:01,630 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:01,631 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:01,632 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-28 23:18:01,695 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f7d1444/16cdc412f0874715af172519be47ebc8/FLAG12159f11a [2018-11-28 23:18:02,313 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:02,314 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strlcat_true-termination.c.i [2018-11-28 23:18:02,332 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f7d1444/16cdc412f0874715af172519be47ebc8/FLAG12159f11a [2018-11-28 23:18:02,581 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20f7d1444/16cdc412f0874715af172519be47ebc8 [2018-11-28 23:18:02,586 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:02,588 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:02,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:02,590 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:02,595 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:02,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@460492eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:02, skipping insertion in model container [2018-11-28 23:18:02,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:02" (1/1) ... [2018-11-28 23:18:02,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:02,661 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:03,186 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:03,207 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:03,293 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:03,451 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:03,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03 WrapperNode [2018-11-28 23:18:03,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:03,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:03,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:03,453 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:03,465 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,486 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,515 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:03,516 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:03,516 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:03,516 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:03,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,533 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,533 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,543 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,552 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:03,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:03,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:03,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:03,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:03,626 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:03,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:03,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:04,148 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:04,149 INFO L280 CfgBuilder]: Removed 11 assue(true) statements. [2018-11-28 23:18:04,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:04 BoogieIcfgContainer [2018-11-28 23:18:04,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:04,152 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:04,153 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:04,158 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:04,159 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,161 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:02" (1/3) ... [2018-11-28 23:18:04,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e18e5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:04, skipping insertion in model container [2018-11-28 23:18:04,164 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,164 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03" (2/3) ... [2018-11-28 23:18:04,165 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@e18e5e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 11:18:04, skipping insertion in model container [2018-11-28 23:18:04,165 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,165 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:04" (3/3) ... [2018-11-28 23:18:04,168 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcat_true-termination.c.i [2018-11-28 23:18:04,237 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:04,238 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:04,238 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:04,239 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:04,239 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:04,239 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:04,239 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:04,239 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:04,239 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:04,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 23:18:04,284 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-28 23:18:04,285 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:04,285 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:04,294 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:04,294 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:04,294 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:04,295 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2018-11-28 23:18:04,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 10 [2018-11-28 23:18:04,297 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:04,297 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:04,298 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-11-28 23:18:04,298 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:04,308 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 15#L-1true havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 23#L539true assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 14#L543true assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 3#L521-5true [2018-11-28 23:18:04,308 INFO L796 eck$LassoCheckResult]: Loop: 3#L521-5true call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 18#L521-1true assume strlcat_#t~short7;strlcat_#t~post6 := strlcat_~n~0;strlcat_~n~0 := strlcat_#t~post6 - 1;strlcat_#t~short7 := 0 != strlcat_#t~post6 % 4294967296; 22#L521-3true assume !!strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5;strlcat_#t~post8.base, strlcat_#t~post8.offset := strlcat_~d~0.base, strlcat_~d~0.offset;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_#t~post8.base, 1 + strlcat_#t~post8.offset;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset; 3#L521-5true [2018-11-28 23:18:04,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:04,316 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-11-28 23:18:04,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:04,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:04,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:04,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash 46776, now seen corresponding path program 1 times [2018-11-28 23:18:04,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:04,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:04,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1806907761, now seen corresponding path program 1 times [2018-11-28 23:18:04,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:04,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:04,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:04,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:04,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,086 WARN L180 SmtUtils]: Spent 424.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2018-11-28 23:18:06,210 WARN L180 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 112 DAG size of output: 100 [2018-11-28 23:18:06,421 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2018-11-28 23:18:06,436 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:06,438 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:06,438 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:06,438 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:06,438 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:06,439 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:06,439 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:06,439 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:06,439 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:06,439 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:06,440 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:06,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:06,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,178 WARN L180 SmtUtils]: Spent 384.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2018-11-28 23:18:07,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:08,088 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:08,094 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:08,097 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-11-28 23:18:08,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,106 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-11-28 23:18:08,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,111 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:08,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:08,116 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,116 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-11-28 23:18:08,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,120 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-11-28 23:18:08,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,123 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,123 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,125 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,126 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-11-28 23:18:08,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,130 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-11-28 23:18:08,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,134 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,135 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,137 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-11-28 23:18:08,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,140 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,141 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,143 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-11-28 23:18:08,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,146 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,150 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-11-28 23:18:08,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,152 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,153 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,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-11-28 23:18:08,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,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-11-28 23:18:08,163 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:08,167 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:08,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,171 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-11-28 23:18:08,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,178 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-11-28 23:18:08,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,182 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,182 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,184 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-11-28 23:18:08,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,187 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,188 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:08,192 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,192 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:08,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,203 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,205 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-11-28 23:18:08,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,208 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,212 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-11-28 23:18:08,213 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,213 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:08,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,216 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:08,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:08,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:08,217 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-11-28 23:18:08,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:08,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:08,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:08,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:08,227 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:08,227 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:08,302 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:08,345 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:18:08,345 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-28 23:18:08,348 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:08,351 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:08,351 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:08,352 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~d~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1) = -1*ULTIMATE.start_strlcat_~d~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc16.base)_1 Supporting invariants [] [2018-11-28 23:18:08,408 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:18:08,420 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:08,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:08,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:08,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:08,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:08,597 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-11-28 23:18:08,599 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 4 states. [2018-11-28 23:18:08,784 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 4 states. Result 73 states and 101 transitions. Complement of second has 9 states. [2018-11-28 23:18:08,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:08,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 66 transitions. [2018-11-28 23:18:08,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 3 letters. [2018-11-28 23:18:08,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 7 letters. Loop has 3 letters. [2018-11-28 23:18:08,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 66 transitions. Stem has 4 letters. Loop has 6 letters. [2018-11-28 23:18:08,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:08,794 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 101 transitions. [2018-11-28 23:18:08,799 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-11-28 23:18:08,803 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 36 states and 45 transitions. [2018-11-28 23:18:08,804 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-11-28 23:18:08,805 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-28 23:18:08,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 45 transitions. [2018-11-28 23:18:08,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:08,806 INFO L705 BuchiCegarLoop]: Abstraction has 36 states and 45 transitions. [2018-11-28 23:18:08,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 45 transitions. [2018-11-28 23:18:08,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-28 23:18:08,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-28 23:18:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-11-28 23:18:08,831 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:18:08,831 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-11-28 23:18:08,831 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:08,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 35 transitions. [2018-11-28 23:18:08,833 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-11-28 23:18:08,833 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:08,833 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:08,834 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:08,834 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:08,834 INFO L794 eck$LassoCheckResult]: Stem: 212#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 210#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 211#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 209#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 190#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 192#L521-1 assume !strlcat_#t~short7; 213#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5; 204#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 205#L525 assume !(0 == strlcat_~n~0 % 4294967296); 201#L527-3 [2018-11-28 23:18:08,834 INFO L796 eck$LassoCheckResult]: Loop: 201#L527-3 call strlcat_#t~mem10 := read~int(strlcat_~s~0.base, strlcat_~s~0.offset, 1); 196#L527-1 assume !!(0 != strlcat_#t~mem10);havoc strlcat_#t~mem10; 197#L528 assume !(1 != strlcat_~n~0 % 4294967296); 200#L528-2 strlcat_#t~post14.base, strlcat_#t~post14.offset := strlcat_~s~0.base, strlcat_~s~0.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_#t~post14.base, 1 + strlcat_#t~post14.offset;havoc strlcat_#t~post14.base, strlcat_#t~post14.offset; 201#L527-3 [2018-11-28 23:18:08,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629448, now seen corresponding path program 1 times [2018-11-28 23:18:08,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:08,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,873 INFO L82 PathProgramCache]: Analyzing trace with hash 2898824, now seen corresponding path program 1 times [2018-11-28 23:18:08,873 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:08,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:08,883 INFO L82 PathProgramCache]: Analyzing trace with hash -701290865, now seen corresponding path program 1 times [2018-11-28 23:18:08,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:08,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:08,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:08,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:09,084 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:18:09,772 WARN L180 SmtUtils]: Spent 667.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 129 [2018-11-28 23:18:10,389 WARN L180 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 104 [2018-11-28 23:18:10,391 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:10,392 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:10,392 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:10,392 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:10,392 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:10,392 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:10,392 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:10,392 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:10,392 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration2_Lasso [2018-11-28 23:18:10,393 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:10,393 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:10,399 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:10,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,066 WARN L180 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2018-11-28 23:18:11,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,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-11-28 23:18:11,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,197 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:11,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-11-28 23:18:11,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-11-28 23:18:11,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-11-28 23:18:11,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-11-28 23:18:11,633 WARN L180 SmtUtils]: Spent 308.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2018-11-28 23:18:12,329 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:18:12,393 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:12,394 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:12,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:12,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,401 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:12,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,401 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,407 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:12,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:12,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,426 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,431 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-11-28 23:18:12,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,437 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-11-28 23:18:12,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,442 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,442 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,445 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-11-28 23:18:12,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,450 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,458 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-11-28 23:18:12,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,466 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-11-28 23:18:12,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:12,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,469 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:12,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,469 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:12,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:12,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,473 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-11-28 23:18:12,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,474 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:12,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,479 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:12,479 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,490 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-11-28 23:18:12,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:12,497 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-11-28 23:18:12,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:12,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:12,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:12,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:12,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:12,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:12,546 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:12,595 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:18:12,596 INFO L444 ModelExtractionUtils]: 53 out of 61 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-28 23:18:12,596 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:12,598 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:12,598 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:12,599 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlcat_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2) = -1*ULTIMATE.start_strlcat_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_2 Supporting invariants [] [2018-11-28 23:18:12,848 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2018-11-28 23:18:12,851 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:12,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:12,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:12,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:13,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:13,023 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-11-28 23:18:13,023 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-11-28 23:18:13,071 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 35 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 35 states and 44 transitions. Complement of second has 5 states. [2018-11-28 23:18:13,073 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-11-28 23:18:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:13,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-28 23:18:13,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 4 letters. [2018-11-28 23:18:13,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:13,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 13 letters. Loop has 4 letters. [2018-11-28 23:18:13,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:13,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-28 23:18:13,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:13,077 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 44 transitions. [2018-11-28 23:18:13,079 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:13,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 16 states and 20 transitions. [2018-11-28 23:18:13,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:18:13,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:18:13,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2018-11-28 23:18:13,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-28 23:18:13,080 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:18:13,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2018-11-28 23:18:13,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 23:18:13,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 23:18:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2018-11-28 23:18:13,085 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:18:13,085 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2018-11-28 23:18:13,085 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:13,085 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2018-11-28 23:18:13,086 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-28 23:18:13,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:13,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:13,087 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:13,087 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-28 23:18:13,087 INFO L794 eck$LassoCheckResult]: Stem: 386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 384#L-1 havoc main_#res;havoc main_#t~nondet15, main_#t~malloc16.base, main_#t~malloc16.offset, main_#t~nondet17, main_#t~malloc18.base, main_#t~malloc18.offset, main_#t~ret19, 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~nondet15;havoc main_#t~nondet15; 385#L539 assume !(main_~in_len~0 < 1);call main_#t~malloc16.base, main_#t~malloc16.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc16.base, main_#t~malloc16.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~nondet17;havoc main_#t~nondet17; 383#L543 assume !(main_~out_len~0 < 1);call main_#t~malloc18.base, main_#t~malloc18.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc18.base, main_#t~malloc18.offset;call write~int(0, main_~out~0.base, main_~out~0.offset + (main_~out_len~0 - 1), 1);strlcat_#in~dst.base, strlcat_#in~dst.offset, strlcat_#in~src.base, strlcat_#in~src.offset, strlcat_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcat_#res;havoc strlcat_#t~post8.base, strlcat_#t~post8.offset, strlcat_#t~mem5, strlcat_#t~post6, strlcat_#t~short7, strlcat_#t~ret9, strlcat_#t~post11.base, strlcat_#t~post11.offset, strlcat_#t~mem12, strlcat_#t~post13, strlcat_#t~post14.base, strlcat_#t~post14.offset, strlcat_#t~mem10, strlcat_~dst.base, strlcat_~dst.offset, strlcat_~src.base, strlcat_~src.offset, strlcat_~siz, strlcat_~d~0.base, strlcat_~d~0.offset, strlcat_~s~0.base, strlcat_~s~0.offset, strlcat_~n~0, strlcat_~dlen~0;strlcat_~dst.base, strlcat_~dst.offset := strlcat_#in~dst.base, strlcat_#in~dst.offset;strlcat_~src.base, strlcat_~src.offset := strlcat_#in~src.base, strlcat_#in~src.offset;strlcat_~siz := strlcat_#in~siz;strlcat_~d~0.base, strlcat_~d~0.offset := strlcat_~dst.base, strlcat_~dst.offset;strlcat_~s~0.base, strlcat_~s~0.offset := strlcat_~src.base, strlcat_~src.offset;strlcat_~n~0 := strlcat_~siz;havoc strlcat_~dlen~0; 374#L521-5 call strlcat_#t~mem5 := read~int(strlcat_~d~0.base, strlcat_~d~0.offset, 1);strlcat_#t~short7 := 0 != strlcat_#t~mem5; 375#L521-1 assume !strlcat_#t~short7; 387#L521-3 assume !strlcat_#t~short7;havoc strlcat_#t~post6;havoc strlcat_#t~short7;havoc strlcat_#t~mem5; 380#L521-6 assume strlcat_~d~0.base == strlcat_~dst.base;strlcat_~dlen~0 := (if strlcat_~d~0.offset - strlcat_~dst.offset < 0 && 0 != (strlcat_~d~0.offset - strlcat_~dst.offset) % 1 then 1 + (strlcat_~d~0.offset - strlcat_~dst.offset) / 1 else (strlcat_~d~0.offset - strlcat_~dst.offset) / 1);strlcat_~n~0 := strlcat_~siz - strlcat_~dlen~0; 381#L525 assume 0 == strlcat_~n~0 % 4294967296;strlen_#in~s.base, strlen_#in~s.offset := strlcat_~s~0.base, strlcat_~s~0.offset;havoc strlen_#res;havoc strlen_#t~pre3, strlen_#t~pre2.base, strlen_#t~pre2.offset, strlen_#t~mem4, strlen_~s.base, strlen_~s.offset, strlen_~i~0;strlen_~s.base, strlen_~s.offset := strlen_#in~s.base, strlen_#in~s.offset;havoc strlen_~i~0; 382#L508 assume !(strlen_~s.base == 0 && strlen_~s.offset == 0);strlen_~i~0 := 0; 378#L509-4 [2018-11-28 23:18:13,087 INFO L796 eck$LassoCheckResult]: Loop: 378#L509-4 call strlen_#t~mem4 := read~int(strlen_~s.base, strlen_~s.offset, 1); 379#L509-1 assume !!(0 != strlen_#t~mem4);havoc strlen_#t~mem4;strlen_#t~pre3 := 1 + strlen_~i~0;strlen_~i~0 := 1 + strlen_~i~0;havoc strlen_#t~pre3; 389#L509-3 strlen_#t~pre2.base, strlen_#t~pre2.offset := strlen_~s.base, 1 + strlen_~s.offset;strlen_~s.base, strlen_~s.offset := strlen_~s.base, 1 + strlen_~s.offset;havoc strlen_#t~pre2.base, strlen_#t~pre2.offset; 378#L509-4 [2018-11-28 23:18:13,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:13,088 INFO L82 PathProgramCache]: Analyzing trace with hash 765806520, now seen corresponding path program 1 times [2018-11-28 23:18:13,088 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:13,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:13,124 INFO L82 PathProgramCache]: Analyzing trace with hash 73645, now seen corresponding path program 1 times [2018-11-28 23:18:13,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:13,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:13,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash -724195178, now seen corresponding path program 1 times [2018-11-28 23:18:13,131 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:13,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:13,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:13,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:13,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:13,374 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:18:13,553 WARN L180 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-28 23:18:14,449 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 137 [2018-11-28 23:18:14,970 WARN L180 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2018-11-28 23:18:14,973 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:14,973 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:14,973 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:14,973 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:14,973 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:14,973 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:14,973 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:14,973 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:14,973 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcat_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:14,973 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:14,974 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:14,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,464 WARN L180 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 96 [2018-11-28 23:18:15,611 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-28 23:18:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,728 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:15,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:16,268 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-28 23:18:16,705 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 23:18:16,876 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-28 23:18:17,196 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:17,197 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:17,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:17,198 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:17,198 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:17,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:17,201 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:17,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:17,203 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:17,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:17,207 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-11-28 23:18:17,208 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:17,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:17,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:17,208 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:17,212 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:17,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:17,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:17,216 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-11-28 23:18:17,216 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:17,218 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:17,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:17,219 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:17,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:17,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:17,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:17,228 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-11-28 23:18:17,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:17,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:17,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:17,231 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:17,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:17,233 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:17,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:17,236 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-11-28 23:18:17,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:17,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:17,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:17,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:17,245 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:17,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:17,294 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:17,328 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:17,332 INFO L444 ModelExtractionUtils]: 56 out of 61 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:18:17,333 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:17,335 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:17,337 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:17,337 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_strlen_~s.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3) = -1*ULTIMATE.start_strlen_~s.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc18.base)_3 Supporting invariants [] [2018-11-28 23:18:17,562 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2018-11-28 23:18:17,566 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:17,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:17,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:17,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:17,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 23:18:17,688 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-28 23:18:17,689 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-28 23:18:17,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 19 states and 24 transitions. Complement of second has 6 states. [2018-11-28 23:18:17,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:17,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-28 23:18:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2018-11-28 23:18:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 3 letters. [2018-11-28 23:18:17,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 13 letters. Loop has 3 letters. [2018-11-28 23:18:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 15 transitions. Stem has 10 letters. Loop has 6 letters. [2018-11-28 23:18:17,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 24 transitions. [2018-11-28 23:18:17,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:17,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-28 23:18:17,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:17,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:17,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:17,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:17,758 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,758 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,758 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,758 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:17,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:17,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:17,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:17,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 11:18:17 BoogieIcfgContainer [2018-11-28 23:18:17,767 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:17,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:17,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:17,767 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:17,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:18:04" (3/4) ... [2018-11-28 23:18:17,772 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:17,772 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:17,773 INFO L168 Benchmark]: Toolchain (without parser) took 15185.72 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 321.9 MB). Free memory was 952.7 MB in the beginning and 1.2 GB in the end (delta: -270.8 MB). Peak memory consumption was 51.1 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,774 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:17,774 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,775 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,778 INFO L168 Benchmark]: Boogie Preprocessor took 39.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:17,778 INFO L168 Benchmark]: RCFGBuilder took 593.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,779 INFO L168 Benchmark]: BuchiAutomizer took 13614.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.6 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,781 INFO L168 Benchmark]: Witness Printer took 4.84 ms. Allocated memory is still 1.4 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:17,787 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 863.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -171.6 MB). Peak memory consumption was 32.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 593.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13614.37 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 185.1 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -131.6 MB). Peak memory consumption was 53.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.84 ms. Allocated memory is still 1.4 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 3 terminating modules (0 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * d + unknown-#length-unknown[__builtin_alloca (in_len)] and consists of 6 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 4 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (out_len)] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 12.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 27 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 51 SDtfs, 75 SDslu, 40 SDs, 0 SdLazy, 36 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital228 mio100 ax100 hnf99 lsp95 ukn82 mio100 lsp45 div198 bol100 ite100 ukn100 eq162 hnf64 smp93 dnf100 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 21ms VariablesStem: 5 VariablesLoop: 4 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...