./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 77cd6aa75e9c7e5f4880befb873abc23862925a6 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:32:27,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 02:32:27,907 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 02:32:27,922 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 02:32:27,923 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 02:32:27,924 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 02:32:27,925 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 02:32:27,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 02:32:27,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 02:32:27,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 02:32:27,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 02:32:27,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 02:32:27,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 02:32:27,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 02:32:27,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 02:32:27,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 02:32:27,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 02:32:27,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 02:32:27,939 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 02:32:27,941 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 02:32:27,942 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 02:32:27,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 02:32:27,946 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 02:32:27,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 02:32:27,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 02:32:27,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 02:32:27,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 02:32:27,955 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 02:32:27,956 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 02:32:27,958 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 02:32:27,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 02:32:27,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 02:32:27,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 02:32:27,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 02:32:27,962 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 02:32:27,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 02:32:27,968 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-14 02:32:28,002 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 02:32:28,002 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 02:32:28,004 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 02:32:28,005 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 02:32:28,005 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 02:32:28,005 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-14 02:32:28,005 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-14 02:32:28,006 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-14 02:32:28,006 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-14 02:32:28,006 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-14 02:32:28,006 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-14 02:32:28,006 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-14 02:32:28,007 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-14 02:32:28,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 02:32:28,011 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-14 02:32:28,011 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 02:32:28,011 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-14 02:32:28,011 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 02:32:28,011 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 02:32:28,011 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-14 02:32:28,012 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 02:32:28,012 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 02:32:28,012 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-14 02:32:28,016 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-14 02:32:28,016 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 77cd6aa75e9c7e5f4880befb873abc23862925a6 [2019-01-14 02:32:28,081 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 02:32:28,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 02:32:28,103 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 02:32:28,104 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 02:32:28,105 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 02:32:28,106 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2019-01-14 02:32:28,168 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312c8dc4/0aba680258c74d1b96a4885f9470f7b0/FLAGce9cbc1f2 [2019-01-14 02:32:28,606 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 02:32:28,607 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2019-01-14 02:32:28,632 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312c8dc4/0aba680258c74d1b96a4885f9470f7b0/FLAGce9cbc1f2 [2019-01-14 02:32:28,944 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d312c8dc4/0aba680258c74d1b96a4885f9470f7b0 [2019-01-14 02:32:28,948 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 02:32:28,950 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 02:32:28,951 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:28,951 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 02:32:28,955 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 02:32:28,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:28" (1/1) ... [2019-01-14 02:32:28,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbbfb21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:28, skipping insertion in model container [2019-01-14 02:32:28,959 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 02:32:28" (1/1) ... [2019-01-14 02:32:28,966 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 02:32:29,013 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 02:32:29,418 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:29,433 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 02:32:29,594 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 02:32:29,647 INFO L195 MainTranslator]: Completed translation [2019-01-14 02:32:29,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29 WrapperNode [2019-01-14 02:32:29,648 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 02:32:29,649 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:29,649 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 02:32:29,649 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 02:32:29,659 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 02:32:29,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 02:32:29,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 02:32:29,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 02:32:29,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,743 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,758 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (1/1) ... [2019-01-14 02:32:29,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 02:32:29,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 02:32:29,765 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 02:32:29,765 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 02:32:29,766 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (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 02:32:29,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 02:32:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 02:32:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 02:32:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 02:32:29,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 02:32:29,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 02:32:30,340 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 02:32:30,340 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-14 02:32:30,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:30 BoogieIcfgContainer [2019-01-14 02:32:30,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 02:32:30,343 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-14 02:32:30,343 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-14 02:32:30,346 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-14 02:32:30,347 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:30,347 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 14.01 02:32:28" (1/3) ... [2019-01-14 02:32:30,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eefde6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:30, skipping insertion in model container [2019-01-14 02:32:30,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:30,349 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 02:32:29" (2/3) ... [2019-01-14 02:32:30,349 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5eefde6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 14.01 02:32:30, skipping insertion in model container [2019-01-14 02:32:30,349 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-14 02:32:30,350 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:30" (3/3) ... [2019-01-14 02:32:30,351 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-termination.c.i [2019-01-14 02:32:30,421 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 02:32:30,422 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-14 02:32:30,422 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-14 02:32:30,422 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-14 02:32:30,422 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 02:32:30,422 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 02:32:30,422 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-14 02:32:30,423 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 02:32:30,423 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-14 02:32:30,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:32:30,457 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:32:30,457 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:30,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:30,464 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:30,464 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:30,464 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-14 02:32:30,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-14 02:32:30,466 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-14 02:32:30,466 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:30,466 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:30,467 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-14 02:32:30,467 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:30,475 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#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; 3#L568true assume !(main_~length~0 < 1); 6#L568-2true assume !(main_~n~0 < 1); 16#L571-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; 12#L553-2true [2019-01-14 02:32:30,475 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-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); 7#L555true assume !(0 == cstrncpy_#t~mem5);havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset; 12#L553-2true [2019-01-14 02:32:30,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:30,481 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-14 02:32:30,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:30,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:30,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:30,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-14 02:32:30,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:30,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:30,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:30,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-14 02:32:30,667 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:30,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:30,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:30,985 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-14 02:32:31,190 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-14 02:32:31,998 WARN L181 SmtUtils]: Spent 799.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-14 02:32:32,409 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-14 02:32:32,426 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:32,427 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:32,428 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:32,428 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:32,428 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:32,428 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:32,428 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:32,429 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:32,429 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-14 02:32:32,429 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:32,429 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:32,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:32,485 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:32,492 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 02:32:32,496 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 02:32:32,502 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 02:32:32,509 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 02:32:32,514 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 02:32:32,522 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 02:32:32,526 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 02:32:33,061 WARN L181 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-14 02:32:33,370 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-14 02:32:33,371 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 02:32:33,373 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 02:32:33,382 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 02:32:33,392 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 02:32:33,394 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 02:32:33,395 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 02:32:33,399 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 02:32:33,402 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 02:32:33,404 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 02:32:33,408 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 02:32:33,410 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 02:32:33,414 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 02:32:33,417 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 02:32:33,419 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 02:32:33,424 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 02:32:33,427 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 02:32:33,777 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:32:34,191 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-14 02:32:34,767 WARN L181 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-14 02:32:34,830 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:34,835 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:34,838 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 02:32:34,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,840 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,846 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 02:32:34,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,847 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,847 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,848 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,850 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 02:32:34,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,853 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 02:32:34,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,854 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,854 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,856 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 02:32:34,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,859 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 02:32:34,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,860 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,862 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 02:32:34,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,865 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,865 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:34,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,869 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 02:32:34,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,870 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,870 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,871 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,872 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 02:32:34,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,873 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,875 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,876 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:34,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,882 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 02:32:34,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,886 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:34,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,903 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:34,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,904 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,904 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,904 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,907 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,908 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:34,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,923 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 02:32:34,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,923 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:34,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,924 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:34,924 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:34,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,926 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 02:32:34,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,927 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,929 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:34,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:34,932 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 02:32:34,933 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:34,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:34,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:34,933 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:34,946 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:34,947 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:35,055 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:35,131 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-14 02:32:35,131 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-14 02:32:35,133 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:35,134 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-14 02:32:35,135 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:35,135 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-14 02:32:35,315 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-14 02:32:35,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:35,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:35,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:35,460 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 02:32:35,475 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 02:32:35,477 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-14 02:32:35,550 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 02:32:35,554 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 02:32:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-14 02:32:35,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-14 02:32:35,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-14 02:32:35,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:35,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:32:35,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:35,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-14 02:32:35,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:35,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-14 02:32:35,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:35,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-14 02:32:35,573 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-14 02:32:35,574 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-14 02:32:35,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-14 02:32:35,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:35,576 INFO L706 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-14 02:32:35,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-14 02:32:35,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-14 02:32:35,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-14 02:32:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-14 02:32:35,600 INFO L729 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:32:35,600 INFO L609 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-14 02:32:35,600 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-14 02:32:35,601 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-14 02:32:35,601 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-14 02:32:35,601 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-14 02:32:35,601 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-14 02:32:35,602 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-14 02:32:35,602 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-14 02:32:35,602 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 141#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; 142#L568 assume !(main_~length~0 < 1); 144#L568-2 assume !(main_~n~0 < 1); 150#L571-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; 147#L553-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); 148#L555 assume 0 == cstrncpy_#t~mem5;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;havoc cstrncpy_#t~post3.base, cstrncpy_#t~post3.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 146#L558-3 [2019-01-14 02:32:35,603 INFO L796 eck$LassoCheckResult]: Loop: 146#L558-3 cstrncpy_#t~post6 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post6 - 1; 145#L558-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; 146#L558-3 [2019-01-14 02:32:35,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:35,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-14 02:32:35,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:35,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:35,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-14 02:32:35,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:35,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:35,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-14 02:32:35,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 02:32:35,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 02:32:35,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 02:32:35,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 02:32:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 02:32:35,891 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-14 02:32:36,505 WARN L181 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-01-14 02:32:36,691 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-14 02:32:36,693 INFO L216 LassoAnalysis]: Preferences: [2019-01-14 02:32:36,694 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-14 02:32:36,694 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-14 02:32:36,694 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-14 02:32:36,694 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-14 02:32:36,694 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-14 02:32:36,694 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-14 02:32:36,694 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-14 02:32:36,695 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-14 02:32:36,695 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-14 02:32:36,695 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-14 02:32:36,702 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 02:32:36,706 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 02:32:36,708 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 02:32:36,710 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 02:32:36,714 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 02:32:36,716 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 02:32:36,720 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 02:32:36,722 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 02:32:36,724 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 02:32:36,726 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 02:32:36,730 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 02:32:36,732 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 02:32:36,735 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 02:32:36,737 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 02:32:36,739 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 02:32:36,741 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:36,744 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 02:32:36,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-14 02:32:36,749 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 02:32:36,753 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 02:32:36,755 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 02:32:36,758 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 02:32:37,398 WARN L181 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-14 02:32:37,525 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-14 02:32:37,788 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-14 02:32:38,090 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-14 02:32:39,052 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-14 02:32:39,077 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-14 02:32:39,077 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-14 02:32:39,078 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 02:32:39,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,082 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,085 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 02:32:39,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,089 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,092 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 02:32:39,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,098 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 02:32:39,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,105 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,113 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 02:32:39,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,123 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 02:32:39,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,127 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,127 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,133 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,134 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,136 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 02:32:39,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,140 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,140 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,146 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,147 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,151 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,154 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,155 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,168 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 02:32:39,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,173 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 02:32:39,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,175 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,176 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,176 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,186 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,189 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 02:32:39,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,190 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,194 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,194 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,196 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 02:32:39,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,197 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,203 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 02:32:39,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,209 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 02:32:39,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,213 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,213 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,213 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,213 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,214 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 02:32:39,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,220 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,220 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,225 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 02:32:39,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,227 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,233 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 02:32:39,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,233 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,242 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,242 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,270 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 02:32:39,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-14 02:32:39,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-14 02:32:39,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-14 02:32:39,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,290 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,298 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 02:32:39,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,300 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,308 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 02:32:39,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,314 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,314 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-14 02:32:39,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,315 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-14 02:32:39,315 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-14 02:32:39,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-14 02:32:39,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-14 02:32:39,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-14 02:32:39,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-14 02:32:39,323 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-14 02:32:39,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-14 02:32:39,337 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-14 02:32:39,337 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-14 02:32:39,514 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-14 02:32:39,609 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-14 02:32:39,610 INFO L444 ModelExtractionUtils]: 72 out of 81 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-14 02:32:39,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-14 02:32:39,613 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-14 02:32:39,614 INFO L518 LassoAnalysis]: Proved termination. [2019-01-14 02:32:39,614 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 02:32:39,968 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-01-14 02:32:40,047 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-14 02:32:40,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 02:32:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:40,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 02:32:40,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 02:32:40,173 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 02:32:40,173 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 02:32:40,173 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-14 02:32:40,309 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 02:32:40,310 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 02:32:40,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-14 02:32:40,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-14 02:32:40,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-14 02:32:40,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-14 02:32:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-14 02:32:40,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-14 02:32:40,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-14 02:32:40,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:40,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-14 02:32:40,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-14 02:32:40,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-14 02:32:40,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-14 02:32:40,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-14 02:32:40,315 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:40,315 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:40,315 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 02:32:40,316 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-14 02:32:40,316 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-14 02:32:40,316 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-14 02:32:40,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-14 02:32:40,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 14.01 02:32:40 BoogieIcfgContainer [2019-01-14 02:32:40,322 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-14 02:32:40,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 02:32:40,323 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 02:32:40,323 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 02:32:40,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 02:32:30" (3/4) ... [2019-01-14 02:32:40,327 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-14 02:32:40,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 02:32:40,328 INFO L168 Benchmark]: Toolchain (without parser) took 11379.75 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 284.7 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -79.1 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:40,330 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 02:32:40,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 697.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:40,331 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:40,332 INFO L168 Benchmark]: Boogie Preprocessor took 53.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 02:32:40,332 INFO L168 Benchmark]: RCFGBuilder took 577.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:40,333 INFO L168 Benchmark]: BuchiAutomizer took 9979.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 211.3 MB. Max. memory is 11.5 GB. [2019-01-14 02:32:40,334 INFO L168 Benchmark]: Witness Printer took 4.79 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 02:32:40,339 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 697.85 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.00 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.39 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 577.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9979.31 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 39.9 MB). Peak memory consumption was 211.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.79 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.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 9.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital239 mio100 ax107 hnf99 lsp90 ukn84 mio100 lsp48 div100 bol100 ite100 ukn100 eq202 hnf88 smp100 dnf174 smp97 tf100 neg97 sie110 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 293ms 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...