./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 0ed9222f 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/cstrncpy-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 a42c021ebd0de645918b065980a1f8d912cba85d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 04:57:16,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 04:57:16,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 04:57:16,633 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 04:57:16,633 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 04:57:16,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 04:57:16,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 04:57:16,639 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 04:57:16,642 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 04:57:16,643 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 04:57:16,644 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 04:57:16,644 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 04:57:16,645 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 04:57:16,646 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 04:57:16,647 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 04:57:16,647 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 04:57:16,648 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 04:57:16,650 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 04:57:16,652 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 04:57:16,654 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 04:57:16,655 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 04:57:16,656 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 04:57:16,659 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 04:57:16,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 04:57:16,660 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 04:57:16,663 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 04:57:16,667 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 04:57:16,668 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 04:57:16,669 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 04:57:16,671 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 04:57:16,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 04:57:16,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 04:57:16,674 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 04:57:16,675 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 04:57:16,676 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 04:57:16,677 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 04:57:16,677 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-01-14 04:57:16,716 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 04:57:16,718 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 04:57:16,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 04:57:16,719 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 04:57:16,719 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 04:57:16,720 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 04:57:16,720 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 04:57:16,720 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 04:57:16,720 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 04:57:16,720 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 04:57:16,721 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 04:57:16,725 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 04:57:16,725 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 04:57:16,725 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 04:57:16,726 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 04:57:16,727 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 04:57:16,727 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 04:57:16,727 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 04:57:16,727 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 04:57:16,727 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 04:57:16,728 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 04:57:16,729 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 04:57:16,729 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 04:57:16,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 04:57:16,729 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 04:57:16,730 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 04:57:16,731 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 04:57:16,732 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 -> a42c021ebd0de645918b065980a1f8d912cba85d [2019-01-14 04:57:16,793 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 04:57:16,805 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 04:57:16,808 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 04:57:16,810 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 04:57:16,810 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 04:57:16,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:16,868 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2fc4b7/8089de699dc74365ac3eafc79ba6e74c/FLAG470d5e5af [2019-01-14 04:57:17,401 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 04:57:17,402 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/array-memsafety/cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:17,415 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2fc4b7/8089de699dc74365ac3eafc79ba6e74c/FLAG470d5e5af [2019-01-14 04:57:17,705 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a2fc4b7/8089de699dc74365ac3eafc79ba6e74c [2019-01-14 04:57:17,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 04:57:17,711 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 04:57:17,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:17,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 04:57:17,715 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 04:57:17,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:17" (1/1) ... [2019-01-14 04:57:17,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d914924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:17, skipping insertion in model container [2019-01-14 04:57:17,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 04:57:17" (1/1) ... [2019-01-14 04:57:17,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 04:57:17,782 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 04:57:18,106 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:18,120 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 04:57:18,180 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 04:57:18,238 INFO L195 MainTranslator]: Completed translation [2019-01-14 04:57:18,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18 WrapperNode [2019-01-14 04:57:18,239 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 04:57:18,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:18,240 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 04:57:18,240 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 04:57:18,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,378 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 04:57:18,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 04:57:18,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 04:57:18,379 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 04:57:18,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,404 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,419 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (1/1) ... [2019-01-14 04:57:18,424 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 04:57:18,427 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 04:57:18,427 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 04:57:18,427 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 04:57:18,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (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-14 04:57:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 04:57:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 04:57:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 04:57:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 04:57:18,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 04:57:18,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 04:57:18,913 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 04:57:18,913 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 04:57:18,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:18 BoogieIcfgContainer [2019-01-14 04:57:18,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 04:57:18,915 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 04:57:18,915 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 04:57:18,919 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 04:57:18,920 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:18,920 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 04:57:17" (1/3) ... [2019-01-14 04:57:18,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bcf62e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:18, skipping insertion in model container [2019-01-14 04:57:18,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:18,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 04:57:18" (2/3) ... [2019-01-14 04:57:18,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2bcf62e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 04:57:18, skipping insertion in model container [2019-01-14 04:57:18,922 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 04:57:18,923 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:18" (3/3) ... [2019-01-14 04:57:18,924 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-valid-memsafety_true-termination.i [2019-01-14 04:57:18,988 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 04:57:18,989 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 04:57:18,989 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 04:57:18,989 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 04:57:18,989 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 04:57:18,990 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 04:57:18,990 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 04:57:18,990 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 04:57:18,990 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 04:57:19,007 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:57:19,028 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:57:19,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:19,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:19,034 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:19,034 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:19,035 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 04:57:19,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 04:57:19,036 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 04:57:19,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:19,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:19,037 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 04:57:19,037 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:19,046 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#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.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 12#L561true assume !(main_~length~0 < 1); 16#L561-2true assume !(main_~n~0 < 1); 10#L564-1true call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~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_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 6#L546-2true [2019-01-14 04:57:19,047 INFO L796 eck$LassoCheckResult]: Loop: 6#L546-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 3#L548true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset; 6#L546-2true [2019-01-14 04:57:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:19,054 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 04:57:19,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:19,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-14 04:57:19,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:19,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:19,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:19,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-14 04:57:19,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:19,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:19,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:19,643 WARN L181 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 04:57:19,795 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 04:57:20,683 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-14 04:57:20,832 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-14 04:57:20,845 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:20,847 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:20,847 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:20,847 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:20,848 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:20,848 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:20,848 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:20,848 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:20,848 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration1_Lasso [2019-01-14 04:57:20,848 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:20,849 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:20,882 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-14 04:57:20,915 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-14 04:57:20,932 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-14 04:57:20,939 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-14 04:57:20,945 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-14 04:57:20,949 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-14 04:57:20,953 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-14 04:57:20,960 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-14 04:57:20,964 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-14 04:57:21,500 WARN L181 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-14 04:57:21,780 WARN L181 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-14 04:57:21,781 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-14 04:57:21,819 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-14 04:57:21,821 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-14 04:57:21,824 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-14 04:57:21,828 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-14 04:57:21,831 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-14 04:57:21,845 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-14 04:57:21,848 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-14 04:57:21,850 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-14 04:57:21,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-14 04:57:21,854 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-14 04:57:21,858 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-14 04:57:21,875 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-14 04:57:22,187 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 04:57:22,574 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 04:57:22,683 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-01-14 04:57:23,233 WARN L181 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 04:57:23,285 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:23,290 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:23,292 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-14 04:57:23,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,311 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-14 04:57:23,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,314 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,317 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-14 04:57:23,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:23,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,325 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-14 04:57:23,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,327 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,328 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-14 04:57:23,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,332 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,333 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-14 04:57:23,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,345 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,353 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-14 04:57:23,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,356 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,358 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-14 04:57:23,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,361 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,375 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-14 04:57:23,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,426 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-14 04:57:23,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:23,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,467 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:23,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,470 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:23,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:23,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,472 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-14 04:57:23,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,475 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:23,478 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-14 04:57:23,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:23,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:23,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:23,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:23,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:23,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:23,605 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:23,692 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 04:57:23,697 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:57:23,700 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:23,702 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 04:57:23,705 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:23,706 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-14 04:57:23,891 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 04:57:23,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:23,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:23,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:23,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:24,042 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-14 04:57:24,056 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-14 04:57:24,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-14 04:57:24,100 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 30 states and 40 transitions. Complement of second has 5 states. [2019-01-14 04:57:24,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-01-14 04:57:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 04:57:24,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 04:57:24,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 04:57:24,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:24,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:57:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:24,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 04:57:24,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:24,114 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 04:57:24,119 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:24,123 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-14 04:57:24,125 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 04:57:24,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 04:57:24,126 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 04:57:24,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:24,127 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 04:57:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 04:57:24,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 04:57:24,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 04:57:24,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 04:57:24,153 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:57:24,153 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 04:57:24,153 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 04:57:24,153 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 04:57:24,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 04:57:24,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 04:57:24,154 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 04:57:24,155 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 04:57:24,155 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 04:57:24,155 INFO L794 eck$LassoCheckResult]: Stem: 147#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 144#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.base, main_#t~ret12.offset, main_~length~0, main_~n~0, main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset;main_~length~0 := main_#t~nondet8;havoc main_#t~nondet8;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9; 145#L561 assume !(main_~length~0 < 1); 150#L561-2 assume !(main_~n~0 < 1); 148#L564-1 call main_#t~malloc10.base, main_#t~malloc10.offset := #Ultimate.allocOnStack(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~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_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset, cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset, cstrncpy_#in~n := main_~nondetArea~0.base, main_~nondetArea~0.offset, main_~nondetString~0.base, main_~nondetString~0.offset, main_~n~0;havoc cstrncpy_#res.base, cstrncpy_#res.offset;havoc cstrncpy_#t~post2, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, cstrncpy_#t~mem5, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, cstrncpy_#t~post6, cstrncpy_~s1.base, cstrncpy_~s1.offset, cstrncpy_~s2.base, cstrncpy_~s2.offset, cstrncpy_~n, cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset, cstrncpy_~src~0.base, cstrncpy_~src~0.offset, cstrncpy_~us~0.base, cstrncpy_~us~0.offset, cstrncpy_~n2~0;cstrncpy_~s1.base, cstrncpy_~s1.offset := cstrncpy_#in~s1.base, cstrncpy_#in~s1.offset;cstrncpy_~s2.base, cstrncpy_~s2.offset := cstrncpy_#in~s2.base, cstrncpy_#in~s2.offset;cstrncpy_~n := cstrncpy_#in~n;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_~s1.base, cstrncpy_~s1.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_~s2.base, cstrncpy_~s2.offset;havoc cstrncpy_~us~0.base, cstrncpy_~us~0.offset;havoc cstrncpy_~n2~0; 149#L546-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post2 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post2 - 1;havoc cstrncpy_#t~post2;cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post3.base, 1 + cstrncpy_#t~post3.offset;cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post4.base, 1 + cstrncpy_#t~post4.offset;call cstrncpy_#t~mem5 := read~int(cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset, 1);call write~int(cstrncpy_#t~mem5, cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset, 1); 141#L548 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 143#L551-3 [2019-01-14 04:57:24,155 INFO L796 eck$LassoCheckResult]: Loop: 143#L551-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 146#L551-1 assume !!(0 != cstrncpy_#t~post6);havoc cstrncpy_#t~post6;cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post7.base, 1 + cstrncpy_#t~post7.offset;call write~int(0, cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset, 1);havoc cstrncpy_#t~post7.base, cstrncpy_#t~post7.offset; 143#L551-3 [2019-01-14 04:57:24,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-14 04:57:24,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-14 04:57:24,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:24,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:24,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-14 04:57:24,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 04:57:24,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 04:57:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 04:57:24,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 04:57:24,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 04:57:24,996 WARN L181 SmtUtils]: Spent 620.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-01-14 04:57:25,188 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-14 04:57:25,191 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 04:57:25,192 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 04:57:25,192 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 04:57:25,192 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 04:57:25,192 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 04:57:25,192 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 04:57:25,192 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 04:57:25,192 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 04:57:25,192 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-valid-memsafety_true-termination.i_Iteration2_Lasso [2019-01-14 04:57:25,192 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 04:57:25,193 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 04:57:25,199 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-14 04:57:25,204 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-14 04:57:25,207 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-14 04:57:25,208 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-14 04:57:25,211 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-14 04:57:25,213 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-14 04:57:25,216 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-14 04:57:25,218 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-14 04:57:25,222 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-14 04:57:25,224 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-14 04:57:25,228 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-14 04:57:25,230 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-14 04:57:25,233 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-14 04:57:25,235 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-14 04:57:25,237 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-14 04:57:25,239 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-14 04:57:25,242 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-14 04:57:25,244 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-14 04:57:25,246 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-14 04:57:25,745 WARN L181 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-14 04:57:25,989 WARN L181 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-14 04:57:26,317 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 04:57:27,302 WARN L181 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 04:57:27,325 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 04:57:27,325 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 04:57:27,325 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-14 04:57:27,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,333 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,340 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,343 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-14 04:57:27,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,350 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-14 04:57:27,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,356 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-14 04:57:27,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,357 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,362 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-14 04:57:27,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,368 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-14 04:57:27,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,375 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,381 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-14 04:57:27,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,388 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-14 04:57:27,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,393 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-14 04:57:27,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,394 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,394 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,394 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,394 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,397 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,401 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,403 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,412 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-14 04:57:27,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,415 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,416 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,419 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-14 04:57:27,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,424 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,425 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-14 04:57:27,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,430 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,431 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,431 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 04:57:27,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,446 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-14 04:57:27,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 04:57:27,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 04:57:27,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 04:57:27,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,452 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-14 04:57:27,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,464 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-14 04:57:27,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,472 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-14 04:57:27,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 04:57:27,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 04:57:27,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 04:57:27,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 04:57:27,480 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-14 04:57:27,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 04:57:27,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 04:57:27,483 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 04:57:27,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 04:57:27,496 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 04:57:27,497 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 04:57:27,690 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 04:57:27,777 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-01-14 04:57:27,778 INFO L444 ModelExtractionUtils]: 73 out of 81 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 04:57:27,779 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 04:57:27,781 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 04:57:27,782 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 04:57:27,782 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset, v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2) = -1*ULTIMATE.start_cstrncpy_~us~0.offset + 1*v_rep(select #length ULTIMATE.start_main_#t~malloc10.base)_2 Supporting invariants [] [2019-01-14 04:57:28,220 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 04:57:28,263 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 04:57:28,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 04:57:28,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:28,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 04:57:28,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 04:57:28,345 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-14 04:57:28,347 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 1 loop predicates [2019-01-14 04:57:28,348 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 04:57:28,687 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 4 states. Result 12 states and 16 transitions. Complement of second has 5 states. [2019-01-14 04:57:28,687 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-14 04:57:28,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 04:57:28,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 04:57:28,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 04:57:28,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:28,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 04:57:28,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:28,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 04:57:28,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 04:57:28,691 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-14 04:57:28,692 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:28,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-14 04:57:28,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 04:57:28,692 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 04:57:28,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 04:57:28,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 04:57:28,693 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:28,693 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:28,693 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 04:57:28,693 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 04:57:28,693 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 04:57:28,693 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 04:57:28,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 04:57:28,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 04:57:28 BoogieIcfgContainer [2019-01-14 04:57:28,700 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 04:57:28,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 04:57:28,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 04:57:28,700 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 04:57:28,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 04:57:18" (3/4) ... [2019-01-14 04:57:28,705 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 04:57:28,705 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 04:57:28,706 INFO L168 Benchmark]: Toolchain (without parser) took 10996.01 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -47.7 MB). Peak memory consumption was 261.1 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:28,707 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:28,707 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:28,710 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:28,711 INFO L168 Benchmark]: Boogie Preprocessor took 46.12 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-14 04:57:28,711 INFO L168 Benchmark]: RCFGBuilder took 487.43 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:28,713 INFO L168 Benchmark]: BuchiAutomizer took 9784.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.8 MB). Peak memory consumption was 271.5 MB. Max. memory is 11.5 GB. [2019-01-14 04:57:28,714 INFO L168 Benchmark]: Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 04:57:28,720 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 527.44 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 931.2 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 931.2 MB in the beginning and 1.1 GB in the end (delta: -192.5 MB). Peak memory consumption was 14.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.12 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 487.43 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: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9784.94 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 166.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 104.8 MB). Peak memory consumption was 271.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function n and consists of 4 locations. One deterministic module has affine ranking function -1 * us + unknown-#length-unknown[__builtin_alloca (n * sizeof(char))] and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.7s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 8.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 10 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 24 SDtfs, 24 SDslu, 14 SDs, 0 SdLazy, 9 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax100 hnf99 lsp97 ukn84 mio100 lsp48 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf174 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 301ms VariablesStem: 15 VariablesLoop: 10 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 16 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...