./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa 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/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-02 00:20:19,448 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-02 00:20:19,450 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-02 00:20:19,462 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-02 00:20:19,462 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-02 00:20:19,464 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-02 00:20:19,465 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-02 00:20:19,467 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-02 00:20:19,469 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-02 00:20:19,470 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-02 00:20:19,471 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-02 00:20:19,471 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-02 00:20:19,472 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-02 00:20:19,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-02 00:20:19,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-02 00:20:19,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-02 00:20:19,476 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-02 00:20:19,478 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-02 00:20:19,480 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-02 00:20:19,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-02 00:20:19,483 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-02 00:20:19,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-02 00:20:19,487 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-02 00:20:19,488 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-02 00:20:19,488 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-02 00:20:19,489 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-02 00:20:19,490 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-02 00:20:19,491 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-02 00:20:19,492 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-02 00:20:19,494 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-02 00:20:19,494 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-02 00:20:19,495 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-02 00:20:19,495 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-02 00:20:19,495 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-02 00:20:19,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-02 00:20:19,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-02 00:20:19,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-02 00:20:19,515 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-02 00:20:19,516 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-02 00:20:19,517 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-02 00:20:19,517 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-02 00:20:19,518 INFO L133 SettingsManager]: * Use SBE=true [2019-01-02 00:20:19,518 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-02 00:20:19,518 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-02 00:20:19,519 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-02 00:20:19,519 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-02 00:20:19,519 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-02 00:20:19,519 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-02 00:20:19,520 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-02 00:20:19,520 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-02 00:20:19,520 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-02 00:20:19,521 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-02 00:20:19,521 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-02 00:20:19,521 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-02 00:20:19,521 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-02 00:20:19,522 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-02 00:20:19,522 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-02 00:20:19,522 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-02 00:20:19,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-02 00:20:19,523 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-02 00:20:19,523 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-02 00:20:19,523 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-02 00:20:19,524 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-02 00:20:19,524 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-02 00:20:19,524 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-02 00:20:19,524 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-02 00:20:19,525 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-02 00:20:19,525 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-02 00:20:19,526 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-02 00:20:19,526 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7d00aad8dfdafc20547a229a92ab2c2bdb101f8c [2019-01-02 00:20:19,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-02 00:20:19,574 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-02 00:20:19,578 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-02 00:20:19,580 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-02 00:20:19,580 INFO L276 PluginConnector]: CDTParser initialized [2019-01-02 00:20:19,581 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:19,650 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed59f92/41a076eefbbc428cb0a3951fd35d1894/FLAGe0d2e479d [2019-01-02 00:20:20,243 INFO L307 CDTParser]: Found 1 translation units. [2019-01-02 00:20:20,243 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:20,257 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed59f92/41a076eefbbc428cb0a3951fd35d1894/FLAGe0d2e479d [2019-01-02 00:20:20,477 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8ed59f92/41a076eefbbc428cb0a3951fd35d1894 [2019-01-02 00:20:20,481 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-02 00:20:20,483 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-02 00:20:20,484 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:20,484 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-02 00:20:20,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-02 00:20:20,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:20" (1/1) ... [2019-01-02 00:20:20,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576c7cb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:20, skipping insertion in model container [2019-01-02 00:20:20,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.01 12:20:20" (1/1) ... [2019-01-02 00:20:20,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-02 00:20:20,561 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-02 00:20:20,965 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:20,979 INFO L191 MainTranslator]: Completed pre-run [2019-01-02 00:20:21,049 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-02 00:20:21,180 INFO L195 MainTranslator]: Completed translation [2019-01-02 00:20:21,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21 WrapperNode [2019-01-02 00:20:21,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-02 00:20:21,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:21,182 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-02 00:20:21,182 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-02 00:20:21,192 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,213 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-02 00:20:21,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-02 00:20:21,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-02 00:20:21,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-02 00:20:21,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,247 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,263 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (1/1) ... [2019-01-02 00:20:21,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-02 00:20:21,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-02 00:20:21,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-02 00:20:21,287 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-02 00:20:21,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (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 [2019-01-02 00:20:21,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-02 00:20:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-02 00:20:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-02 00:20:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-02 00:20:21,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-02 00:20:21,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-02 00:20:21,779 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-02 00:20:21,779 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-02 00:20:21,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:21 BoogieIcfgContainer [2019-01-02 00:20:21,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-02 00:20:21,781 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-02 00:20:21,782 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-02 00:20:21,786 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-02 00:20:21,787 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:21,787 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.01 12:20:20" (1/3) ... [2019-01-02 00:20:21,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7164c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:21, skipping insertion in model container [2019-01-02 00:20:21,789 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:21,789 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.01 12:20:21" (2/3) ... [2019-01-02 00:20:21,789 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7164c302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.01 12:20:21, skipping insertion in model container [2019-01-02 00:20:21,790 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-02 00:20:21,790 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:21" (3/3) ... [2019-01-02 00:20:21,793 INFO L375 chiAutomizerObserver]: Analyzing ICFG openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i [2019-01-02 00:20:21,855 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-02 00:20:21,856 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-02 00:20:21,856 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-02 00:20:21,857 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-02 00:20:21,857 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-02 00:20:21,858 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-02 00:20:21,858 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-02 00:20:21,858 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-02 00:20:21,858 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-02 00:20:21,874 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:20:21,899 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:20:21,899 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:21,899 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:21,908 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:20:21,908 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:21,908 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-02 00:20:21,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-01-02 00:20:21,911 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2019-01-02 00:20:21,911 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:21,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:21,912 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-01-02 00:20:21,912 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-02 00:20:21,922 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 16#L563true assume !(main_~length~0 < 1); 19#L563-2true assume !(main_~n~1 < 1); 10#L566-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 5#L546true assume 0 != cstrlcpy_~n~0 % 4294967296; 9#L547-3true [2019-01-02 00:20:21,923 INFO L796 eck$LassoCheckResult]: Loop: 9#L547-3true cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 6#L547-1true assume !!(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2;cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset := cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_#t~post3.base, 1 + cstrlcpy_#t~post3.offset;cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post4.base, 1 + cstrlcpy_#t~post4.offset;call cstrlcpy_#t~mem5 := read~int(cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, 1);call write~int(cstrlcpy_#t~mem5, cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrlcpy_#t~mem5);havoc cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset;havoc cstrlcpy_#t~mem5; 9#L547-3true [2019-01-02 00:20:21,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:21,932 INFO L82 PathProgramCache]: Analyzing trace with hash 889572236, now seen corresponding path program 1 times [2019-01-02 00:20:21,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:21,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:21,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:21,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:21,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash 52795, now seen corresponding path program 1 times [2019-01-02 00:20:22,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:22,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:22,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:22,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:22,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1298289360, now seen corresponding path program 1 times [2019-01-02 00:20:22,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:22,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:22,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:22,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:22,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:22,516 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-02 00:20:22,672 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-02 00:20:23,755 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 113 DAG size of output: 101 [2019-01-02 00:20:23,971 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-01-02 00:20:24,001 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:24,002 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:24,007 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:24,007 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:24,007 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:24,007 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:24,008 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:24,008 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:24,008 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-02 00:20:24,008 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:24,008 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:24,053 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:24,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:24,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:24,804 WARN L181 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-02 00:20:25,097 WARN L181 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 67 [2019-01-02 00:20:25,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:25,730 WARN L181 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-01-02 00:20:26,199 WARN L181 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-01-02 00:20:26,824 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:20:26,983 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-01-02 00:20:27,092 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:27,097 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:27,100 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 [2019-01-02 00:20:27,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:27,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:27,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:27,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,111 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 [2019-01-02 00:20:27,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:27,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,113 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:27,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:27,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:27,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:27,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,118 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:20:27,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:20:27,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:27,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,131 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 [2019-01-02 00:20:27,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:27,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,133 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:27,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:27,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,138 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 [2019-01-02 00:20:27,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,144 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,145 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:27,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,171 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,173 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,176 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 [2019-01-02 00:20:27,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,187 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,189 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,198 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 [2019-01-02 00:20:27,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,205 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,206 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:27,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,215 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:27,216 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,216 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,239 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:27,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,321 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 [2019-01-02 00:20:27,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,328 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,328 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:27,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:27,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:27,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:27,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:27,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:27,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:27,366 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:27,465 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:27,538 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-01-02 00:20:27,539 INFO L444 ModelExtractionUtils]: 52 out of 58 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-01-02 00:20:27,543 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:27,548 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:27,548 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:27,552 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_1 Supporting invariants [] [2019-01-02 00:20:27,842 INFO L297 tatePredicateManager]: 14 out of 16 supporting invariants were superfluous and have been removed [2019-01-02 00:20:27,853 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:27,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:27,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:27,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:28,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:28,057 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 [2019-01-02 00:20:28,059 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 5 states. [2019-01-02 00:20:28,194 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 5 states. Result 53 states and 75 transitions. Complement of second has 7 states. [2019-01-02 00:20:28,194 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 [2019-01-02 00:20:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-02 00:20:28,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2019-01-02 00:20:28,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 3 letters. [2019-01-02 00:20:28,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 9 letters. Loop has 3 letters. [2019-01-02 00:20:28,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:28,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 51 transitions. Stem has 6 letters. Loop has 6 letters. [2019-01-02 00:20:28,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:28,202 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 75 transitions. [2019-01-02 00:20:28,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-02 00:20:28,212 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 24 states and 32 transitions. [2019-01-02 00:20:28,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-01-02 00:20:28,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-01-02 00:20:28,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 32 transitions. [2019-01-02 00:20:28,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:28,215 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 32 transitions. [2019-01-02 00:20:28,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 32 transitions. [2019-01-02 00:20:28,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2019-01-02 00:20:28,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-02 00:20:28,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2019-01-02 00:20:28,240 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-02 00:20:28,240 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 23 transitions. [2019-01-02 00:20:28,240 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-02 00:20:28,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 23 transitions. [2019-01-02 00:20:28,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:20:28,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:28,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:28,242 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:28,242 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:20:28,242 INFO L794 eck$LassoCheckResult]: Stem: 209#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 207#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 208#L563 assume !(main_~length~0 < 1); 210#L563-2 assume !(main_~n~1 < 1); 206#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 199#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 198#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 203#L553 assume !(0 != cstrlcpy_~siz % 4294967296); 205#L555-2 [2019-01-02 00:20:28,242 INFO L796 eck$LassoCheckResult]: Loop: 205#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 204#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 205#L555-2 [2019-01-02 00:20:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 180447461, now seen corresponding path program 1 times [2019-01-02 00:20:28,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,277 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 1 times [2019-01-02 00:20:28,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:28,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1611319850, now seen corresponding path program 1 times [2019-01-02 00:20:28,286 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:28,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:28,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:28,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:28,580 WARN L181 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-02 00:20:28,759 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-02 00:20:29,678 WARN L181 SmtUtils]: Spent 916.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 100 [2019-01-02 00:20:29,826 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-01-02 00:20:29,845 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:29,845 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:29,846 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:29,846 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:29,846 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:29,846 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:29,846 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:29,846 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:29,846 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-02 00:20:29,847 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:29,847 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:29,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,879 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:29,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,305 WARN L181 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 80 [2019-01-02 00:20:30,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:30,719 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-01-02 00:20:31,463 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:20:31,587 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:31,587 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:31,587 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 [2019-01-02 00:20:31,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,589 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,594 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 [2019-01-02 00:20:31,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,599 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 [2019-01-02 00:20:31,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,606 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 [2019-01-02 00:20:31,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,608 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,608 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,611 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 [2019-01-02 00:20:31,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,614 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,617 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 [2019-01-02 00:20:31,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,620 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,620 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,623 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 [2019-01-02 00:20:31,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,625 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,628 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 [2019-01-02 00:20:31,628 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,633 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 [2019-01-02 00:20:31,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,638 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,640 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 [2019-01-02 00:20:31,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,644 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,645 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 [2019-01-02 00:20:31,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,647 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:31,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,651 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 [2019-01-02 00:20:31,653 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,658 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 [2019-01-02 00:20:31,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,673 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 [2019-01-02 00:20:31,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,677 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,677 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-02 00:20:31,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,684 INFO L205 nArgumentSynthesizer]: 4 stem disjuncts [2019-01-02 00:20:31,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,691 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-01-02 00:20:31,691 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,711 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 [2019-01-02 00:20:31,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,718 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 [2019-01-02 00:20:31,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,722 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,725 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 [2019-01-02 00:20:31,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,728 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,732 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 [2019-01-02 00:20:31,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:31,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,734 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-02 00:20:31,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-02 00:20:31,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:31,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:31,738 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 [2019-01-02 00:20:31,739 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:31,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:31,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:31,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:31,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:31,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:31,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:31,772 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:20:31,772 INFO L444 ModelExtractionUtils]: 23 out of 28 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-01-02 00:20:31,772 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:31,773 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:31,774 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:31,774 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0.base)_2) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_cstrlcpy_~s~0.base)_2 Supporting invariants [] [2019-01-02 00:20:32,014 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-01-02 00:20:32,028 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:32,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:32,208 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:32,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:32,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:32,354 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-01-02 00:20:32,354 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9 Second operand 3 states. [2019-01-02 00:20:32,366 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 23 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 20 states and 27 transitions. Complement of second has 4 states. [2019-01-02 00:20:32,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-02 00:20:32,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-02 00:20:32,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions. [2019-01-02 00:20:32,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-01-02 00:20:32,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:32,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-02 00:20:32,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:32,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 22 transitions. Stem has 8 letters. Loop has 4 letters. [2019-01-02 00:20:32,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:32,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 27 transitions. [2019-01-02 00:20:32,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:20:32,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 22 transitions. [2019-01-02 00:20:32,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:20:32,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:20:32,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2019-01-02 00:20:32,375 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:32,375 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-02 00:20:32,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2019-01-02 00:20:32,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-02 00:20:32,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-02 00:20:32,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2019-01-02 00:20:32,382 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-02 00:20:32,382 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2019-01-02 00:20:32,382 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-02 00:20:32,382 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2019-01-02 00:20:32,384 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:20:32,384 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:32,384 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:32,385 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:32,385 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:20:32,385 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 330#L563 assume !(main_~length~0 < 1); 332#L563-2 assume !(main_~n~1 < 1); 328#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 321#L546 assume !(0 != cstrlcpy_~n~0 % 4294967296); 320#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 325#L553 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 327#L555-2 [2019-01-02 00:20:32,386 INFO L796 eck$LassoCheckResult]: Loop: 327#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 326#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 327#L555-2 [2019-01-02 00:20:32,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:32,386 INFO L82 PathProgramCache]: Analyzing trace with hash 180447459, now seen corresponding path program 1 times [2019-01-02 00:20:32,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:32,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:32,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:32,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:32,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:32,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-02 00:20:32,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-02 00:20:32,619 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-01-02 00:20:32,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 2 times [2019-01-02 00:20:32,621 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:32,621 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:32,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:32,887 WARN L181 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-02 00:20:33,065 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-02 00:20:33,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-02 00:20:33,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-02 00:20:33,072 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 8 Second operand 4 states. [2019-01-02 00:20:33,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-02 00:20:33,188 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2019-01-02 00:20:33,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-02 00:20:33,190 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-02 00:20:33,191 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:20:33,192 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 21 transitions. [2019-01-02 00:20:33,192 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-01-02 00:20:33,192 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-01-02 00:20:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2019-01-02 00:20:33,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-01-02 00:20:33,193 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-02 00:20:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2019-01-02 00:20:33,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-02 00:20:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-02 00:20:33,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2019-01-02 00:20:33,197 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-02 00:20:33,197 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2019-01-02 00:20:33,197 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2019-01-02 00:20:33,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2019-01-02 00:20:33,198 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-02 00:20:33,198 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-02 00:20:33,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-02 00:20:33,201 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-02 00:20:33,201 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-02 00:20:33,201 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 370#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~nondet9, main_#t~malloc10.base, main_#t~malloc10.offset, main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~ret12, main_~length~0, main_~n~1, main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~1 := main_#t~nondet9;havoc main_#t~nondet9; 371#L563 assume !(main_~length~0 < 1); 373#L563-2 assume !(main_~n~1 < 1); 369#L566-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~1);main_~nondetString1~0.base, main_~nondetString1~0.offset := main_#t~malloc10.base, main_#t~malloc10.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.allocOnStack(main_~length~0);main_~nondetString2~0.base, main_~nondetString2~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString1~0.base, main_~nondetString1~0.offset + (main_~n~1 - 1), 1);call write~int(0, main_~nondetString2~0.base, main_~nondetString2~0.offset + (main_~length~0 - 1), 1);cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset, cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset, cstrlcpy_#in~siz := main_~nondetString1~0.base, main_~nondetString1~0.offset, main_~nondetString2~0.base, main_~nondetString2~0.offset, main_~n~1;havoc cstrlcpy_#res;havoc cstrlcpy_#t~post3.base, cstrlcpy_#t~post3.offset, cstrlcpy_#t~post4.base, cstrlcpy_#t~post4.offset, cstrlcpy_#t~mem5, cstrlcpy_#t~pre2, cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, cstrlcpy_#t~mem7, cstrlcpy_~dst.base, cstrlcpy_~dst.offset, cstrlcpy_~src.base, cstrlcpy_~src.offset, cstrlcpy_~siz, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset, cstrlcpy_~n~0;cstrlcpy_~dst.base, cstrlcpy_~dst.offset := cstrlcpy_#in~dst.base, cstrlcpy_#in~dst.offset;cstrlcpy_~src.base, cstrlcpy_~src.offset := cstrlcpy_#in~src.base, cstrlcpy_#in~src.offset;cstrlcpy_~siz := cstrlcpy_#in~siz;cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset := cstrlcpy_~dst.base, cstrlcpy_~dst.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_~src.base, cstrlcpy_~src.offset;cstrlcpy_~n~0 := cstrlcpy_~siz; 362#L546 assume 0 != cstrlcpy_~n~0 % 4294967296; 363#L547-3 cstrlcpy_#t~pre2 := cstrlcpy_~n~0 - 1;cstrlcpy_~n~0 := cstrlcpy_~n~0 - 1; 364#L547-1 assume !(0 != cstrlcpy_#t~pre2 % 4294967296);havoc cstrlcpy_#t~pre2; 361#L546-1 assume 0 == cstrlcpy_~n~0 % 4294967296; 366#L553 assume 0 != cstrlcpy_~siz % 4294967296;call write~int(0, cstrlcpy_~d~0.base, cstrlcpy_~d~0.offset, 1); 368#L555-2 [2019-01-02 00:20:33,202 INFO L796 eck$LassoCheckResult]: Loop: 368#L555-2 cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset := cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset;cstrlcpy_~s~0.base, cstrlcpy_~s~0.offset := cstrlcpy_#t~post6.base, 1 + cstrlcpy_#t~post6.offset;call cstrlcpy_#t~mem7 := read~int(cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset, 1); 367#L555 assume !!(0 != cstrlcpy_#t~mem7);havoc cstrlcpy_#t~post6.base, cstrlcpy_#t~post6.offset;havoc cstrlcpy_#t~mem7; 368#L555-2 [2019-01-02 00:20:33,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:33,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1592262898, now seen corresponding path program 1 times [2019-01-02 00:20:33,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:33,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:33,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:33,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2630, now seen corresponding path program 3 times [2019-01-02 00:20:33,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:33,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:33,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-02 00:20:33,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:33,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1156289271, now seen corresponding path program 1 times [2019-01-02 00:20:33,241 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-02 00:20:33,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-02 00:20:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-02 00:20:33,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-02 00:20:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-02 00:20:33,523 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-02 00:20:33,690 WARN L181 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2019-01-02 00:20:34,375 WARN L181 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 112 [2019-01-02 00:20:34,704 WARN L181 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-02 00:20:34,707 INFO L216 LassoAnalysis]: Preferences: [2019-01-02 00:20:34,707 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-02 00:20:34,707 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-02 00:20:34,707 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-02 00:20:34,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-02 00:20:34,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-02 00:20:34,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-02 00:20:34,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-02 00:20:34,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: openbsd_cstrlcpy-alloca_true-valid-memsafety_true-termination.i_Iteration4_Lasso [2019-01-02 00:20:34,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-02 00:20:34,708 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-02 00:20:34,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:34,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:34,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:34,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:34,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,376 WARN L181 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 82 [2019-01-02 00:20:35,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,488 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,490 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,493 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-02 00:20:35,798 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-02 00:20:36,536 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-02 00:20:36,575 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-02 00:20:36,576 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-02 00:20:36,576 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 [2019-01-02 00:20:36,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:36,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,580 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:36,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:36,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,581 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 [2019-01-02 00:20:36,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,582 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,582 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,582 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,587 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 [2019-01-02 00:20:36,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:36,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,588 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:36,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:36,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,589 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 [2019-01-02 00:20:36,589 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:36,589 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,589 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,590 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:36,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:36,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,593 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 [2019-01-02 00:20:36,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,595 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,595 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,598 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 [2019-01-02 00:20:36,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,601 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,601 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,605 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 [2019-01-02 00:20:36,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-02 00:20:36,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,606 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-02 00:20:36,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-02 00:20:36,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,616 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 [2019-01-02 00:20:36,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,623 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,623 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,625 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 [2019-01-02 00:20:36,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,632 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,635 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 [2019-01-02 00:20:36,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,636 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-02 00:20:36,641 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 [2019-01-02 00:20:36,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-02 00:20:36,644 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-02 00:20:36,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-02 00:20:36,644 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-02 00:20:36,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-02 00:20:36,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-02 00:20:36,669 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-02 00:20:36,687 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-02 00:20:36,690 INFO L444 ModelExtractionUtils]: 48 out of 52 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-02 00:20:36,690 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-02 00:20:36,691 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-02 00:20:36,692 INFO L518 LassoAnalysis]: Proved termination. [2019-01-02 00:20:36,693 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlcpy_~s~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3) = -1*ULTIMATE.start_cstrlcpy_~s~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc11.base)_3 Supporting invariants [] [2019-01-02 00:20:37,053 INFO L297 tatePredicateManager]: 13 out of 14 supporting invariants were superfluous and have been removed [2019-01-02 00:20:37,075 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-02 00:20:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-02 00:20:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:37,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-02 00:20:37,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-02 00:20:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-02 00:20:37,371 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 [2019-01-02 00:20:37,371 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-01-02 00:20:37,441 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 21 transitions. cyclomatic complexity: 7. Second operand 4 states. Result 18 states and 23 transitions. Complement of second has 5 states. [2019-01-02 00:20:37,442 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 [2019-01-02 00:20:37,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-02 00:20:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-01-02 00:20:37,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 2 letters. [2019-01-02 00:20:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 12 letters. Loop has 2 letters. [2019-01-02 00:20:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:37,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 10 letters. Loop has 4 letters. [2019-01-02 00:20:37,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-02 00:20:37,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 23 transitions. [2019-01-02 00:20:37,446 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:37,447 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2019-01-02 00:20:37,447 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-02 00:20:37,447 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-02 00:20:37,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-02 00:20:37,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-02 00:20:37,447 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:37,447 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:37,447 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-02 00:20:37,447 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2019-01-02 00:20:37,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-02 00:20:37,449 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-02 00:20:37,449 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-02 00:20:37,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.01 12:20:37 BoogieIcfgContainer [2019-01-02 00:20:37,456 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-02 00:20:37,457 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-02 00:20:37,457 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-02 00:20:37,457 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-02 00:20:37,458 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.01 12:20:21" (3/4) ... [2019-01-02 00:20:37,461 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-02 00:20:37,461 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-02 00:20:37,462 INFO L168 Benchmark]: Toolchain (without parser) took 16980.40 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 316.7 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -169.3 MB). Peak memory consumption was 147.4 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,464 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-02 00:20:37,465 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,466 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,467 INFO L168 Benchmark]: Boogie Preprocessor took 50.15 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. [2019-01-02 00:20:37,467 INFO L168 Benchmark]: RCFGBuilder took 493.34 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,468 INFO L168 Benchmark]: BuchiAutomizer took 15675.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,468 INFO L168 Benchmark]: Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. [2019-01-02 00:20:37,474 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 697.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -186.0 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.15 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 493.34 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: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15675.05 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 178.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -17.2 MB). Peak memory consumption was 161.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.45 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (1 trivial, 3 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 5 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[s] and consists of 3 locations. One deterministic module has affine ranking function -1 * s + unknown-#length-unknown[__builtin_alloca (length * sizeof(char))] 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 15.6s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 14.2s. Construction of modules took 0.1s. Büchi inclusion checks took 1.0s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 16 states and ocurred in iteration 1. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 73 SDtfs, 65 SDslu, 35 SDs, 0 SdLazy, 31 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital240 mio100 ax100 hnf99 lsp97 ukn79 mio100 lsp43 div158 bol100 ite100 ukn100 eq173 hnf70 smp94 dnf209 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 106ms VariablesStem: 11 VariablesLoop: 8 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...