./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-libowfat/strlcpy_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/strlcpy_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 fd4754e908bed6ae29d10e34d903201d1cfa0296 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02,468 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 23:18:02,470 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 23:18:02,484 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 23:18:02,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 23:18:02,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 23:18:02,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 23:18:02,489 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 23:18:02,491 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 23:18:02,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 23:18:02,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 23:18:02,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 23:18:02,498 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 23:18:02,502 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 23:18:02,503 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 23:18:02,504 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 23:18:02,508 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 23:18:02,510 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 23:18:02,514 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 23:18:02,516 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 23:18:02,517 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 23:18:02,518 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 23:18:02,520 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 23:18:02,521 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 23:18:02,521 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 23:18:02,522 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 23:18:02,523 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 23:18:02,524 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 23:18:02,524 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 23:18:02,525 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 23:18:02,526 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 23:18:02,526 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 23:18:02,527 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 23:18:02,527 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 23:18:02,528 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 23:18:02,529 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 23:18:02,529 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:02,558 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 23:18:02,559 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 23:18:02,561 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 23:18:02,562 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 23:18:02,562 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 23:18:02,563 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-28 23:18:02,563 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-28 23:18:02,564 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-28 23:18:02,564 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-28 23:18:02,564 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-28 23:18:02,565 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-28 23:18:02,565 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 23:18:02,565 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-28 23:18:02,566 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 23:18:02,567 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-28 23:18:02,567 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 23:18:02,567 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-28 23:18:02,567 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 23:18:02,567 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 23:18:02,568 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-28 23:18:02,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 23:18:02,571 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 23:18:02,571 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-28 23:18:02,572 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-28 23:18:02,573 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 -> fd4754e908bed6ae29d10e34d903201d1cfa0296 [2018-11-28 23:18:02,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 23:18:02,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 23:18:02,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 23:18:02,669 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 23:18:02,669 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 23:18:02,670 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-28 23:18:02,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f61a19b/58f21fc96ae7408788224ab9c7e8a07a/FLAG86180fefe [2018-11-28 23:18:03,257 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 23:18:03,259 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-libowfat/strlcpy_true-termination.c.i [2018-11-28 23:18:03,272 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f61a19b/58f21fc96ae7408788224ab9c7e8a07a/FLAG86180fefe [2018-11-28 23:18:03,526 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f61a19b/58f21fc96ae7408788224ab9c7e8a07a [2018-11-28 23:18:03,530 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 23:18:03,532 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 23:18:03,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:03,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 23:18:03,538 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 23:18:03,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,544 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e68a996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:03, skipping insertion in model container [2018-11-28 23:18:03,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:18:03" (1/1) ... [2018-11-28 23:18:03,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 23:18:03,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 23:18:04,026 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:04,047 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 23:18:04,124 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 23:18:04,294 INFO L195 MainTranslator]: Completed translation [2018-11-28 23:18:04,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:04 WrapperNode [2018-11-28 23:18:04,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 23:18:04,296 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:04,296 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 23:18:04,296 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 23:18:04,307 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:04" (1/1) ... [2018-11-28 23:18:04,330 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:04" (1/1) ... [2018-11-28 23:18:04,367 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 23:18:04,369 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 23:18:04,369 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 23:18:04,369 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 23:18:04,381 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:04" (1/1) ... [2018-11-28 23:18:04,381 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:04" (1/1) ... [2018-11-28 23:18:04,391 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:04" (1/1) ... [2018-11-28 23:18:04,391 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:04" (1/1) ... [2018-11-28 23:18:04,407 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:04" (1/1) ... [2018-11-28 23:18:04,413 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:04" (1/1) ... [2018-11-28 23:18:04,415 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:04" (1/1) ... [2018-11-28 23:18:04,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 23:18:04,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 23:18:04,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 23:18:04,419 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 23:18:04,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:04" (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:04,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 23:18:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 23:18:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 23:18:04,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 23:18:04,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 23:18:04,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 23:18:04,960 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 23:18:04,960 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-11-28 23:18:04,961 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,961 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 23:18:04,962 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-28 23:18:04,962 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-28 23:18:04,966 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-28 23:18:04,967 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,968 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 11:18:03" (1/3) ... [2018-11-28 23:18:04,969 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3af96f81 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,969 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:18:04" (2/3) ... [2018-11-28 23:18:04,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3af96f81 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,970 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-28 23:18:04,970 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,972 INFO L375 chiAutomizerObserver]: Analyzing ICFG strlcpy_true-termination.c.i [2018-11-28 23:18:05,040 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 23:18:05,040 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-28 23:18:05,041 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-28 23:18:05,041 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-28 23:18:05,041 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 23:18:05,041 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 23:18:05,041 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-28 23:18:05,041 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 23:18:05,041 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-28 23:18:05,055 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:18:05,078 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:18:05,079 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:05,079 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:05,085 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:05,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:05,086 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-28 23:18:05,086 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states. [2018-11-28 23:18:05,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-28 23:18:05,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:05,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:05,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-28 23:18:05,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-28 23:18:05,098 INFO L794 eck$LassoCheckResult]: Stem: 17#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 14#L-1true havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 19#L530true assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 9#L534true assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 6#L514true assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 11#L514-2true assume strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 12#L515-4true [2018-11-28 23:18:05,098 INFO L796 eck$LassoCheckResult]: Loop: 12#L515-4true strlcpy_#t~post5.base, strlcpy_#t~post5.offset := strlcpy_~d~0.base, strlcpy_~d~0.offset;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_#t~post5.base, 1 + strlcpy_#t~post5.offset;strlcpy_#t~post6.base, strlcpy_#t~post6.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post6.base, 1 + strlcpy_#t~post6.offset;call strlcpy_#t~mem7 := read~int(strlcpy_#t~post6.base, strlcpy_#t~post6.offset, 1);call write~int(strlcpy_#t~mem7, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, 1); 3#L516true assume !(0 == strlcpy_#t~mem7);havoc strlcpy_#t~post5.base, strlcpy_#t~post5.offset;havoc strlcpy_#t~post6.base, strlcpy_#t~post6.offset;havoc strlcpy_#t~mem7; 7#L515-1true strlcpy_#t~pre4 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1; 8#L515-2true assume !!(0 != strlcpy_#t~pre4 % 4294967296);havoc strlcpy_#t~pre4; 12#L515-4true [2018-11-28 23:18:05,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,105 INFO L82 PathProgramCache]: Analyzing trace with hash 889571278, now seen corresponding path program 1 times [2018-11-28 23:18:05,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1698155, now seen corresponding path program 1 times [2018-11-28 23:18:05,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:05,373 INFO L82 PathProgramCache]: Analyzing trace with hash 707592888, now seen corresponding path program 1 times [2018-11-28 23:18:05,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:05,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:05,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:05,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:05,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:05,833 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2018-11-28 23:18:06,009 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-11-28 23:18:07,098 WARN L180 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 122 DAG size of output: 108 [2018-11-28 23:18:07,327 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-11-28 23:18:07,347 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:07,348 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:07,348 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:07,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:07,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:07,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:07,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:07,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:07,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration1_Lasso [2018-11-28 23:18:07,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:07,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:07,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,403 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,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,412 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,415 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,423 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,429 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,440 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,445 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,449 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,452 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,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:07,519 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,526 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,529 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,030 WARN L180 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-28 23:18:08,331 WARN L180 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-11-28 23:18:08,332 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,334 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:09,164 WARN L180 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2018-11-28 23:18:09,315 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-28 23:18:09,620 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2018-11-28 23:18:09,854 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:09,860 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:09,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:09,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,865 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,866 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:09,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,876 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:09,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,879 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:09,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,883 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:09,883 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:09,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,887 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:09,887 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,888 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,889 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,890 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:09,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,892 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,894 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:09,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,895 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:09,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,898 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,900 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:09,900 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:09,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,903 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:09,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,906 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:09,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,908 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,908 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,910 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:09,910 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,911 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,913 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:09,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,914 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,916 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,916 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:09,917 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,918 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,918 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,919 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:09,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,921 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,921 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,922 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:09,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,927 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:09,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:09,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,930 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:09,930 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:09,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,931 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:09,931 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,932 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:09,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:09,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:09,936 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:09,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:09,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:09,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:09,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:09,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:09,955 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:10,105 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:10,230 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-28 23:18:10,233 INFO L444 ModelExtractionUtils]: 54 out of 61 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-28 23:18:10,235 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:10,237 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:10,239 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:10,240 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_1 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-28 23:18:10,487 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2018-11-28 23:18:10,497 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:10,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:10,575 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:10,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:10,775 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:10,790 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:10,792 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states. Second operand 4 states. [2018-11-28 23:18:10,943 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states.. Second operand 4 states. Result 50 states and 71 transitions. Complement of second has 7 states. [2018-11-28 23:18:10,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2018-11-28 23:18:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:10,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2018-11-28 23:18:10,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-28 23:18:10,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:10,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 10 letters. Loop has 4 letters. [2018-11-28 23:18:10,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:10,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 52 transitions. Stem has 6 letters. Loop has 8 letters. [2018-11-28 23:18:10,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:10,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 71 transitions. [2018-11-28 23:18:10,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:10,964 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 10 states and 12 transitions. [2018-11-28 23:18:10,965 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-28 23:18:10,966 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-28 23:18:10,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 12 transitions. [2018-11-28 23:18:10,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:10,967 INFO L705 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:18:10,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 12 transitions. [2018-11-28 23:18:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-11-28 23:18:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:18:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 12 transitions. [2018-11-28 23:18:10,992 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:18:10,992 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 12 transitions. [2018-11-28 23:18:10,992 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-28 23:18:10,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 12 transitions. [2018-11-28 23:18:10,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:10,993 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:10,994 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:10,994 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:10,994 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:10,994 INFO L794 eck$LassoCheckResult]: Stem: 188#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 183#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 184#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 191#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 189#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 190#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 192#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 187#L521 assume !(0 != strlcpy_~siz % 4294967296); 185#L523-2 [2018-11-28 23:18:10,995 INFO L796 eck$LassoCheckResult]: Loop: 185#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 186#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 185#L523-2 [2018-11-28 23:18:10,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 179527912, now seen corresponding path program 1 times [2018-11-28 23:18:10,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:10,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:10,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:10,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:11,199 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:11,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 23:18:11,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 23:18:11,204 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-28 23:18:11,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:11,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 1 times [2018-11-28 23:18:11,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:11,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:11,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:11,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 23:18:11,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 23:18:11,303 INFO L87 Difference]: Start difference. First operand 10 states and 12 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:18:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 23:18:11,399 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-11-28 23:18:11,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 23:18:11,400 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 17 transitions. [2018-11-28 23:18:11,401 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-11-28 23:18:11,402 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 17 transitions. [2018-11-28 23:18:11,402 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-28 23:18:11,402 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-28 23:18:11,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 17 transitions. [2018-11-28 23:18:11,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:11,402 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-11-28 23:18:11,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 17 transitions. [2018-11-28 23:18:11,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2018-11-28 23:18:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-28 23:18:11,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-11-28 23:18:11,405 INFO L728 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:18:11,405 INFO L608 BuchiCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-11-28 23:18:11,405 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-28 23:18:11,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 15 transitions. [2018-11-28 23:18:11,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:11,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:11,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:11,408 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:11,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:11,408 INFO L794 eck$LassoCheckResult]: Stem: 222#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 218#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 223#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 224#L514 assume !strlcpy_#t~short3; 225#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 229#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 228#L521 assume !(0 != strlcpy_~siz % 4294967296); 220#L523-2 [2018-11-28 23:18:11,408 INFO L796 eck$LassoCheckResult]: Loop: 220#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 221#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 220#L523-2 [2018-11-28 23:18:11,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:11,409 INFO L82 PathProgramCache]: Analyzing trace with hash 179587494, now seen corresponding path program 1 times [2018-11-28 23:18:11,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:11,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:11,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:11,431 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 2 times [2018-11-28 23:18:11,431 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:11,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:11,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:11,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash 784891691, now seen corresponding path program 1 times [2018-11-28 23:18:11,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:11,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:11,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:11,597 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:18:11,981 WARN L180 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2018-11-28 23:18:12,171 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2018-11-28 23:18:12,174 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:12,174 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:12,174 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:12,174 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:12,175 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:12,175 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:12,175 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:12,175 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:12,175 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration3_Lasso [2018-11-28 23:18:12,176 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:12,176 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:12,181 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:12,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:12,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:12,203 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:12,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:12,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:12,211 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:12,216 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:12,218 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:12,221 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:12,223 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:12,225 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:12,229 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:12,230 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:12,233 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:12,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:12,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-28 23:18:12,533 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 74 [2018-11-28 23:18:12,590 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:12,593 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:13,042 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2018-11-28 23:18:13,395 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:13,395 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:13,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:13,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,398 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:13,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,404 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:13,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,406 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,406 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,409 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:13,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,411 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:13,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,412 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,412 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,413 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:13,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:13,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,416 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,417 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:13,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,419 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,420 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:13,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,424 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:13,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,426 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,427 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:13,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,428 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,429 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:13,429 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,430 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,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:13,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,432 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,434 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:13,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,436 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:13,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,439 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:13,439 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,439 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,440 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:13,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,441 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:13,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,443 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,443 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,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:13,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,446 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,448 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,448 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,454 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:13,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:13,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,455 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:13,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:13,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:13,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,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:13,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,460 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,460 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,463 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:13,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,466 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,469 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:13,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,470 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,471 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,471 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,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:13,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:13,485 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:13,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:13,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:13,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:13,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:13,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:13,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:13,522 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:13,532 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-28 23:18:13,532 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-28 23:18:13,533 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:13,534 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:13,534 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:13,535 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_2 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-28 23:18:13,725 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2018-11-28 23:18:13,747 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:13,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:13,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:14,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:14,130 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:14,131 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:14,131 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3 Second operand 4 states. [2018-11-28 23:18:14,158 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states and 15 transitions. cyclomatic complexity: 3. Second operand 4 states. Result 17 states and 19 transitions. Complement of second has 5 states. [2018-11-28 23:18:14,160 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:14,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:14,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2018-11-28 23:18:14,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:18:14,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:18:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:18:14,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:14,162 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 19 transitions. [2018-11-28 23:18:14,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:14,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 13 states and 14 transitions. [2018-11-28 23:18:14,164 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-28 23:18:14,164 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-28 23:18:14,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 14 transitions. [2018-11-28 23:18:14,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:14,164 INFO L705 BuchiCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-28 23:18:14,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 14 transitions. [2018-11-28 23:18:14,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2018-11-28 23:18:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-28 23:18:14,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-11-28 23:18:14,166 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-28 23:18:14,166 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-11-28 23:18:14,166 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-28 23:18:14,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 11 transitions. [2018-11-28 23:18:14,170 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-11-28 23:18:14,170 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-28 23:18:14,170 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-28 23:18:14,170 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 23:18:14,170 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-28 23:18:14,171 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 332#L-1 havoc main_#res;havoc main_#t~nondet10, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~nondet12, main_#t~malloc13.base, main_#t~malloc13.offset, main_#t~ret14, main_~in_len~0, main_~in~0.base, main_~in~0.offset, main_~out_len~0, main_~out~0.base, main_~out~0.offset;main_~in_len~0 := main_#t~nondet10;havoc main_#t~nondet10; 333#L530 assume !(main_~in_len~0 < 1);call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(main_~in_len~0);main_~in~0.base, main_~in~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~in~0.base, main_~in~0.offset + (main_~in_len~0 - 1), 1);main_~out_len~0 := main_#t~nondet12;havoc main_#t~nondet12; 338#L534 assume !(main_~out_len~0 < 1);call main_#t~malloc13.base, main_#t~malloc13.offset := #Ultimate.alloc(main_~out_len~0);main_~out~0.base, main_~out~0.offset := main_#t~malloc13.base, main_#t~malloc13.offset;strlcpy_#in~dst.base, strlcpy_#in~dst.offset, strlcpy_#in~src.base, strlcpy_#in~src.offset, strlcpy_#in~siz := main_~in~0.base, main_~in~0.offset, main_~out~0.base, main_~out~0.offset, main_~out_len~0;havoc strlcpy_#res;havoc strlcpy_#t~pre2, strlcpy_#t~short3, strlcpy_#t~post5.base, strlcpy_#t~post5.offset, strlcpy_#t~post6.base, strlcpy_#t~post6.offset, strlcpy_#t~mem7, strlcpy_#t~pre4, strlcpy_#t~post8.base, strlcpy_#t~post8.offset, strlcpy_#t~mem9, strlcpy_~dst.base, strlcpy_~dst.offset, strlcpy_~src.base, strlcpy_~src.offset, strlcpy_~siz, strlcpy_~d~0.base, strlcpy_~d~0.offset, strlcpy_~s~0.base, strlcpy_~s~0.offset, strlcpy_~n~0;strlcpy_~dst.base, strlcpy_~dst.offset := strlcpy_#in~dst.base, strlcpy_#in~dst.offset;strlcpy_~src.base, strlcpy_~src.offset := strlcpy_#in~src.base, strlcpy_#in~src.offset;strlcpy_~siz := strlcpy_#in~siz;strlcpy_~d~0.base, strlcpy_~d~0.offset := strlcpy_~dst.base, strlcpy_~dst.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_~src.base, strlcpy_~src.offset;strlcpy_~n~0 := strlcpy_~siz;strlcpy_#t~short3 := 0 != strlcpy_~n~0 % 4294967296; 339#L514 assume strlcpy_#t~short3;strlcpy_#t~pre2 := strlcpy_~n~0 - 1;strlcpy_~n~0 := strlcpy_~n~0 - 1;strlcpy_#t~short3 := 0 != strlcpy_#t~pre2 % 4294967296; 340#L514-2 assume !strlcpy_#t~short3;havoc strlcpy_#t~short3;havoc strlcpy_#t~pre2; 341#L514-3 assume 0 == strlcpy_~n~0 % 4294967296; 334#L521 assume 0 != strlcpy_~siz % 4294967296;call write~int(0, strlcpy_~d~0.base, strlcpy_~d~0.offset, 1); 335#L523-2 [2018-11-28 23:18:14,171 INFO L796 eck$LassoCheckResult]: Loop: 335#L523-2 strlcpy_#t~post8.base, strlcpy_#t~post8.offset := strlcpy_~s~0.base, strlcpy_~s~0.offset;strlcpy_~s~0.base, strlcpy_~s~0.offset := strlcpy_#t~post8.base, 1 + strlcpy_#t~post8.offset;call strlcpy_#t~mem9 := read~int(strlcpy_#t~post8.base, strlcpy_#t~post8.offset, 1); 336#L523 assume !!(0 != strlcpy_#t~mem9);havoc strlcpy_#t~mem9;havoc strlcpy_#t~post8.base, strlcpy_#t~post8.offset; 335#L523-2 [2018-11-28 23:18:14,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash 179527910, now seen corresponding path program 1 times [2018-11-28 23:18:14,172 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:14,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,219 INFO L82 PathProgramCache]: Analyzing trace with hash 2758, now seen corresponding path program 3 times [2018-11-28 23:18:14,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 23:18:14,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:14,231 INFO L82 PathProgramCache]: Analyzing trace with hash 727631467, now seen corresponding path program 1 times [2018-11-28 23:18:14,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 23:18:14,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 23:18:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 23:18:14,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 23:18:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 23:18:14,526 WARN L180 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-28 23:18:14,688 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-28 23:18:15,388 WARN L180 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 110 [2018-11-28 23:18:15,532 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 23:18:15,538 INFO L216 LassoAnalysis]: Preferences: [2018-11-28 23:18:15,538 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-28 23:18:15,538 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-28 23:18:15,538 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-28 23:18:15,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-28 23:18:15,539 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-28 23:18:15,539 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-28 23:18:15,539 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-28 23:18:15,539 INFO L131 ssoRankerPreferences]: Filename of dumped script: strlcpy_true-termination.c.i_Iteration4_Lasso [2018-11-28 23:18:15,539 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-28 23:18:15,539 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-28 23:18:15,543 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,551 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,552 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,554 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,574 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,597 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,646 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,708 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,095 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 77 [2018-11-28 23:18:16,146 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,149 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,151 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,153 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,155 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,157 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,158 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,159 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,160 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,465 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 56 [2018-11-28 23:18:16,789 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-28 23:18:16,789 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-28 23:18:16,790 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:16,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,792 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,795 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:16,795 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,796 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,796 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,796 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,797 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:16,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,797 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,798 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,798 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,799 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:16,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,799 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,800 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,800 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,801 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:16,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,802 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,802 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,803 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,803 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,804 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:16,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,805 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,806 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:16,807 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,808 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,808 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,809 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:16,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,810 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,811 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,811 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,813 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:16,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,814 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,815 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-28 23:18:16,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,815 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,816 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:16,816 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,816 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-28 23:18:16,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,817 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-28 23:18:16,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-28 23:18:16,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-28 23:18:16,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,820 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:16,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,828 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:16,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,830 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,833 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:16,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,834 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:16,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,836 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:16,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:16,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,845 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,845 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-28 23:18:16,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,848 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-28 23:18:16,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,850 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-28 23:18:16,850 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,857 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-28 23:18:16,858 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:16,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-28 23:18:16,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-28 23:18:16,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-28 23:18:16,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-28 23:18:16,862 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-28 23:18:16,862 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-28 23:18:16,884 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-28 23:18:16,910 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-28 23:18:16,910 INFO L444 ModelExtractionUtils]: 42 out of 46 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-28 23:18:16,910 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-28 23:18:16,911 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-28 23:18:16,915 INFO L518 LassoAnalysis]: Proved termination. [2018-11-28 23:18:16,915 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3, ULTIMATE.start_strlcpy_~s~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc13.base)_3 - 1*ULTIMATE.start_strlcpy_~s~0.offset Supporting invariants [] [2018-11-28 23:18:17,012 INFO L297 tatePredicateManager]: 8 out of 9 supporting invariants were superfluous and have been removed [2018-11-28 23:18:17,016 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2018-11-28 23:18:17,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 23:18:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:17,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 23:18:17,111 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 23:18:17,152 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,153 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:17,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2 Second operand 4 states. [2018-11-28 23:18:17,179 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 11 transitions. cyclomatic complexity: 2. Second operand 4 states. Result 12 states and 13 transitions. Complement of second has 5 states. [2018-11-28 23:18:17,180 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:17,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-28 23:18:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2018-11-28 23:18:17,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 2 letters. [2018-11-28 23:18:17,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 10 letters. Loop has 2 letters. [2018-11-28 23:18:17,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 8 letters. Loop has 4 letters. [2018-11-28 23:18:17,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-28 23:18:17,183 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 13 transitions. [2018-11-28 23:18:17,184 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:17,184 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-11-28 23:18:17,185 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-28 23:18:17,185 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-28 23:18:17,185 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-28 23:18:17,185 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-28 23:18:17,185 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,185 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,185 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 23:18:17,185 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-28 23:18:17,185 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-28 23:18:17,186 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-28 23:18:17,186 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-28 23:18:17,193 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,193 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-28 23:18:17,194 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 23:18:17,194 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 23:18:17,194 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 23:18:17,195 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,199 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 23:18:17,199 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 23:18:17,200 INFO L168 Benchmark]: Toolchain (without parser) took 13669.07 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.0 MB). Free memory was 951.4 MB in the beginning and 864.9 MB in the end (delta: 86.4 MB). Peak memory consumption was 410.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,202 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,202 INFO L168 Benchmark]: CACSL2BoogieTranslator took 761.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.87 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,204 INFO L168 Benchmark]: Boogie Preprocessor took 49.74 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,204 INFO L168 Benchmark]: RCFGBuilder took 542.68 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,205 INFO L168 Benchmark]: BuchiAutomizer took 12231.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 231.0 MB). Peak memory consumption was 413.4 MB. Max. memory is 11.5 GB. [2018-11-28 23:18:17,206 INFO L168 Benchmark]: Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 864.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 23:18:17,212 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 761.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.87 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.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.74 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 542.68 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: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 12231.38 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 864.9 MB in the end (delta: 231.0 MB). Peak memory consumption was 413.4 MB. Max. memory is 11.5 GB. * Witness Printer took 5.48 ms. Allocated memory is still 1.4 GB. Free memory is still 864.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca (out_len)] + -1 * s and consists of 4 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 10.8s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 13 states and ocurred in iteration 2. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 53 SDslu, 33 SDs, 0 SdLazy, 35 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital205 mio100 ax100 hnf99 lsp97 ukn85 mio100 lsp48 div173 bol100 ite100 ukn100 eq175 hnf68 smp95 dnf100 smp100 tf100 neg99 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...