./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 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/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-2e94e6a [2019-01-01 21:49:23,840 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:49:23,842 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:49:23,862 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:49:23,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:49:23,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:49:23,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:49:23,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:49:23,872 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:49:23,874 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:49:23,876 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:49:23,876 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:49:23,877 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:49:23,880 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:49:23,883 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:49:23,884 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:49:23,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:49:23,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:49:23,899 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:49:23,901 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:49:23,904 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:49:23,905 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:49:23,910 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:49:23,911 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:49:23,911 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:49:23,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:49:23,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:49:23,914 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:49:23,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:49:23,916 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:49:23,916 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:49:23,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:49:23,917 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:49:23,917 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:49:23,918 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:49:23,918 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:49:23,919 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:49:23,935 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:49:23,936 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:49:23,937 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:49:23,937 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:49:23,937 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:49:23,938 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:49:23,938 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:49:23,938 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:49:23,938 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:49:23,938 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:49:23,938 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:49:23,939 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:49:23,939 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:49:23,939 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:49:23,939 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:49:23,939 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:49:23,939 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:49:23,940 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:49:23,940 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:49:23,940 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:49:23,940 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:49:23,940 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:49:23,941 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:49:23,941 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:49:23,941 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:49:23,941 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:49:23,941 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:49:23,941 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:49:23,942 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:49:23,943 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-01 21:49:23,978 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:49:24,001 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:49:24,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:49:24,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:49:24,005 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:49:24,006 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2019-01-01 21:49:24,070 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db31b549f/1e722400685046d7989e189ba8f75494/FLAGdc20e0680 [2019-01-01 21:49:24,617 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:49:24,618 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/cstrncpy-alloca_true-termination.c.i [2019-01-01 21:49:24,641 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db31b549f/1e722400685046d7989e189ba8f75494/FLAGdc20e0680 [2019-01-01 21:49:24,929 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db31b549f/1e722400685046d7989e189ba8f75494 [2019-01-01 21:49:24,933 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:49:24,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:49:24,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:24,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:49:24,940 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:49:24,942 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:24" (1/1) ... [2019-01-01 21:49:24,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d11486e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:24, skipping insertion in model container [2019-01-01 21:49:24,947 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:24" (1/1) ... [2019-01-01 21:49:24,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:49:25,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:49:25,371 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:25,384 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:49:25,538 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:25,601 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:49:25,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25 WrapperNode [2019-01-01 21:49:25,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:25,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:25,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:49:25,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:49:25,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:25,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:49:25,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:49:25,666 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:49:25,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,694 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (1/1) ... [2019-01-01 21:49:25,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:49:25,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:49:25,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:49:25,705 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:49:25,707 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (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-01 21:49:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:49:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:49:25,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:49:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:49:25,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:49:25,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:49:26,201 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:49:26,201 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2019-01-01 21:49:26,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:26 BoogieIcfgContainer [2019-01-01 21:49:26,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:49:26,204 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:49:26,204 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:49:26,208 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:49:26,209 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:26,210 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:49:24" (1/3) ... [2019-01-01 21:49:26,213 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b8082f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:26, skipping insertion in model container [2019-01-01 21:49:26,213 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:26,213 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:25" (2/3) ... [2019-01-01 21:49:26,214 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7b8082f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:26, skipping insertion in model container [2019-01-01 21:49:26,214 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:26,214 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:26" (3/3) ... [2019-01-01 21:49:26,217 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy-alloca_true-termination.c.i [2019-01-01 21:49:26,280 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:49:26,281 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:49:26,281 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:49:26,281 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:49:26,281 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:49:26,282 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:49:26,282 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:49:26,282 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:49:26,282 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:49:26,297 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:49:26,320 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:49:26,320 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:26,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:26,327 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:26,327 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:26,327 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:49:26,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2019-01-01 21:49:26,329 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-01-01 21:49:26,329 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:26,329 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:26,330 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-01-01 21:49:26,330 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:26,337 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-01 21:49:26,338 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~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5; 12#L553-2true [2019-01-01 21:49:26,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:26,344 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2019-01-01 21:49:26,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:26,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:26,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:26,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:26,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2019-01-01 21:49:26,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:26,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:26,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:26,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2019-01-01 21:49:26,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:26,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:26,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:26,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:26,957 WARN L181 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:49:27,115 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-01-01 21:49:28,040 WARN L181 SmtUtils]: Spent 921.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2019-01-01 21:49:28,228 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-01-01 21:49:28,241 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:28,243 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:28,244 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:28,244 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:28,244 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:28,245 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:28,245 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:28,245 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:28,245 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:49:28,245 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:28,247 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:28,279 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-01 21:49:28,285 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-01 21:49:28,294 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-01 21:49:28,301 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-01 21:49:28,305 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-01 21:49:28,309 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-01 21:49:28,317 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-01 21:49:28,324 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-01 21:49:28,329 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-01 21:49:28,875 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 76 [2019-01-01 21:49:29,107 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-01-01 21:49:29,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:29,134 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-01 21:49:29,156 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-01 21:49:29,165 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-01 21:49:29,170 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-01 21:49:29,172 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-01 21:49:29,176 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-01 21:49:29,179 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-01 21:49:29,183 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-01 21:49:29,186 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-01 21:49:29,202 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-01 21:49:29,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:49:29,209 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-01 21:49:29,214 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-01 21:49:29,217 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-01 21:49:29,219 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-01 21:49:29,529 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:49:29,925 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-01 21:49:30,480 WARN L181 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 43 [2019-01-01 21:49:30,544 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:30,550 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:30,552 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-01 21:49:30,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,558 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,558 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,561 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-01 21:49:30,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,563 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,564 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-01 21:49:30,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,566 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,567 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-01 21:49:30,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,569 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,571 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-01 21:49:30,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,572 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,574 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-01 21:49:30,575 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,575 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,576 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,577 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-01 21:49:30,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,578 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,586 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-01 21:49:30,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,587 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,587 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:30,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,590 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,593 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,593 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,601 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-01 21:49:30,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,602 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,605 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,606 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,626 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-01 21:49:30,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:30,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:30,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,652 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,653 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:30,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:30,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,655 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-01 21:49:30,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:30,662 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-01 21:49:30,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:30,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:30,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:30,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:30,680 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:30,680 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:30,824 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:30,949 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-01-01 21:49:30,950 INFO L444 ModelExtractionUtils]: 48 out of 55 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-01-01 21:49:30,954 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:30,955 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:30,956 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:30,956 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~n) = 1*ULTIMATE.start_cstrncpy_~n Supporting invariants [] [2019-01-01 21:49:31,183 INFO L297 tatePredicateManager]: 13 out of 13 supporting invariants were superfluous and have been removed [2019-01-01 21:49:31,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:31,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:31,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:31,350 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-01 21:49:31,366 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-01 21:49:31,367 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2019-01-01 21:49:31,443 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-01 21:49:31,447 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-01 21:49:31,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-01 21:49:31,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2019-01-01 21:49:31,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2019-01-01 21:49:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:49:31,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:31,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2019-01-01 21:49:31,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:31,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2019-01-01 21:49:31,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:31,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2019-01-01 21:49:31,472 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2019-01-01 21:49:31,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2019-01-01 21:49:31,473 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2019-01-01 21:49:31,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:31,474 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2019-01-01 21:49:31,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2019-01-01 21:49:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-01-01 21:49:31,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-01 21:49:31,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2019-01-01 21:49:31,503 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:49:31,503 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2019-01-01 21:49:31,503 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:31,503 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2019-01-01 21:49:31,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-01-01 21:49:31,504 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:31,504 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:31,506 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-01-01 21:49:31,506 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-01-01 21:49:31,506 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~post3.base, cstrncpy_#t~post3.offset;havoc cstrncpy_#t~post4.base, cstrncpy_#t~post4.offset;havoc cstrncpy_#t~mem5;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-01 21:49:31,507 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-01 21:49:31,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:31,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2019-01-01 21:49:31,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:31,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:31,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:31,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2019-01-01 21:49:31,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:31,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:31,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:31,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:31,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2019-01-01 21:49:31,589 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:31,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:31,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:31,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:31,757 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-01-01 21:49:32,402 WARN L181 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 128 [2019-01-01 21:49:32,594 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2019-01-01 21:49:32,598 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:32,598 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:32,598 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:32,598 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:32,598 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:32,599 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:32,599 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:32,599 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:32,599 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy-alloca_true-termination.c.i_Iteration2_Lasso [2019-01-01 21:49:32,599 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:32,599 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:32,605 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-01 21:49:32,609 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-01 21:49:32,610 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-01 21:49:32,612 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-01 21:49:32,616 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-01 21:49:32,620 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-01 21:49:32,622 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-01 21:49:32,624 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-01 21:49:32,626 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-01 21:49:32,628 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-01 21:49:32,631 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-01 21:49:32,633 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-01 21:49:32,635 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-01 21:49:32,637 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-01 21:49:32,640 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-01 21:49:32,642 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-01 21:49:32,644 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-01 21:49:32,646 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-01 21:49:32,649 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-01 21:49:32,653 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-01 21:49:32,656 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-01 21:49:32,659 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-01 21:49:33,157 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2019-01-01 21:49:33,427 WARN L181 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-01-01 21:49:33,671 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-01 21:49:33,781 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-01-01 21:49:33,958 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-01-01 21:49:34,827 WARN L181 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-01-01 21:49:34,856 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:34,857 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:34,857 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-01 21:49:34,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,861 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,864 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,864 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,868 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-01 21:49:34,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,869 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,878 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,881 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-01 21:49:34,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,885 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,886 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-01 21:49:34,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,889 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,890 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,893 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-01 21:49:34,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,894 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,897 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,898 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-01 21:49:34,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,902 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,903 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,904 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-01 21:49:34,904 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,905 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,905 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,909 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-01 21:49:34,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,910 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,913 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,913 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,915 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-01 21:49:34,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,917 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,917 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,917 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,917 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,917 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,921 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-01 21:49:34,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,922 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,922 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,922 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:49:34,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,928 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,928 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,928 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,928 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,929 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,929 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-01 21:49:34,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,936 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,936 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,937 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-01 21:49:34,937 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,941 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,941 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,941 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,941 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,942 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,945 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-01 21:49:34,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,948 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,949 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,949 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,951 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-01 21:49:34,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,952 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,952 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,952 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,952 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,952 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,953 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-01 21:49:34,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,958 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,959 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,959 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,959 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,959 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,962 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-01 21:49:34,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,965 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,965 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,965 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,968 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,969 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,971 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-01 21:49:34,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:34,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:34,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,977 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-01 21:49:34,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,978 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,981 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,981 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,985 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-01 21:49:34,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:34,989 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:34,989 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:34,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:34,996 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-01 21:49:34,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:34,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:34,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:34,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:34,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:35,000 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:35,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:35,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:35,001 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-01 21:49:35,004 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:35,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:35,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:35,005 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:35,006 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:35,006 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:35,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:35,012 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-01 21:49:35,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:35,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:35,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:35,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:35,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:35,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:35,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:35,019 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-01 21:49:35,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:35,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:35,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:35,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:35,023 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:35,024 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:35,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:35,026 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-01 21:49:35,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:35,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:35,027 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:49:35,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:35,044 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2019-01-01 21:49:35,045 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-01-01 21:49:35,219 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:35,349 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2019-01-01 21:49:35,349 INFO L444 ModelExtractionUtils]: 72 out of 81 variables were initially zero. Simplification set additionally 6 variables to zero. [2019-01-01 21:49:35,349 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:35,352 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2019-01-01 21:49:35,352 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:35,353 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-01 21:49:35,646 INFO L297 tatePredicateManager]: 13 out of 15 supporting invariants were superfluous and have been removed [2019-01-01 21:49:35,655 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2019-01-01 21:49:35,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:35,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:35,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:35,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:35,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:35,973 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-01 21:49:35,973 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-01 21:49:35,973 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 4 states. [2019-01-01 21:49:36,115 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-01 21:49:36,116 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-01 21:49:36,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 12 transitions. [2019-01-01 21:49:36,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2019-01-01 21:49:36,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:36,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2019-01-01 21:49:36,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:36,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2019-01-01 21:49:36,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:36,119 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2019-01-01 21:49:36,121 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:36,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2019-01-01 21:49:36,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:36,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:36,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:36,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:36,122 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:36,122 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:36,122 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:36,122 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2019-01-01 21:49:36,122 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:36,123 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:36,123 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:36,129 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:36 BoogieIcfgContainer [2019-01-01 21:49:36,129 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:36,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:36,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:36,130 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:36,130 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:26" (3/4) ... [2019-01-01 21:49:36,136 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:36,136 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:36,137 INFO L168 Benchmark]: Toolchain (without parser) took 11203.70 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 315.6 MB). Free memory was 952.7 MB in the beginning and 1.0 GB in the end (delta: -72.4 MB). Peak memory consumption was 243.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:36,138 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-01 21:49:36,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 666.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:36,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:36,142 INFO L168 Benchmark]: Boogie Preprocessor took 38.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:36,142 INFO L168 Benchmark]: RCFGBuilder took 498.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:36,143 INFO L168 Benchmark]: BuchiAutomizer took 9925.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:36,145 INFO L168 Benchmark]: Witness Printer took 6.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-01 21:49:36,151 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 666.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -157.6 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.43 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 498.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9925.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 184.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 11.5 GB. * Witness Printer took 6.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.8s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 9.0s. Construction of modules took 0.0s. Büchi inclusion checks took 0.6s. 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: 326ms 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...