./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer --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 493d4075183da22c41b393b09f987b5f1b55266e .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 18:13:15,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 18:13:15,892 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 18:13:15,898 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 18:13:15,898 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 18:13:15,899 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 18:13:15,899 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 18:13:15,900 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 18:13:15,901 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 18:13:15,901 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 18:13:15,902 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 18:13:15,902 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 18:13:15,902 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 18:13:15,903 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 18:13:15,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 18:13:15,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 18:13:15,904 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 18:13:15,905 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 18:13:15,906 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 18:13:15,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 18:13:15,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 18:13:15,908 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 18:13:15,909 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 18:13:15,909 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 18:13:15,909 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 18:13:15,909 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 18:13:15,910 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 18:13:15,910 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 18:13:15,911 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 18:13:15,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 18:13:15,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 18:13:15,912 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 18:13:15,912 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 18:13:15,912 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 18:13:15,912 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 18:13:15,913 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 18:13:15,913 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-02 18:13:15,920 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 18:13:15,920 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 18:13:15,921 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 18:13:15,921 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 18:13:15,921 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 18:13:15,921 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 18:13:15,921 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 18:13:15,921 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 18:13:15,922 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 18:13:15,922 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 18:13:15,923 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 18:13:15,923 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 18:13:15,923 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 18:13:15,923 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 18:13:15,923 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 18:13:15,923 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 18:13:15,923 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 18:13:15,923 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 18:13:15,924 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer 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 -> 493d4075183da22c41b393b09f987b5f1b55266e [2018-12-02 18:13:15,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 18:13:15,950 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 18:13:15,952 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 18:13:15,953 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 18:13:15,953 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 18:13:15,954 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2018-12-02 18:13:15,990 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/data/3a80ae294/b17b97cd7103422e8a03992ca913489d/FLAGc4be7578e [2018-12-02 18:13:16,391 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 18:13:16,392 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/sv-benchmarks/c/termination-15/cstrncpy_mixed_alloca_true-termination.c.i [2018-12-02 18:13:16,397 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/data/3a80ae294/b17b97cd7103422e8a03992ca913489d/FLAGc4be7578e [2018-12-02 18:13:16,405 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/data/3a80ae294/b17b97cd7103422e8a03992ca913489d [2018-12-02 18:13:16,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 18:13:16,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 18:13:16,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 18:13:16,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 18:13:16,410 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 18:13:16,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@115e7fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16, skipping insertion in model container [2018-12-02 18:13:16,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 18:13:16,438 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 18:13:16,606 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:13:16,613 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 18:13:16,675 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:13:16,700 INFO L195 MainTranslator]: Completed translation [2018-12-02 18:13:16,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16 WrapperNode [2018-12-02 18:13:16,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 18:13:16,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 18:13:16,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 18:13:16,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 18:13:16,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,714 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,726 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 18:13:16,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 18:13:16,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 18:13:16,727 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 18:13:16,732 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,734 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,737 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... [2018-12-02 18:13:16,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 18:13:16,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 18:13:16,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 18:13:16,742 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 18:13:16,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f963ffe-1b78-4a3f-ba5f-2a972f6ca932/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 18:13:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 18:13:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 18:13:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 18:13:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 18:13:16,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 18:13:16,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 18:13:16,896 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 18:13:16,896 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 18:13:16,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:13:16 BoogieIcfgContainer [2018-12-02 18:13:16,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 18:13:16,897 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 18:13:16,897 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 18:13:16,899 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 18:13:16,900 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 18:13:16,900 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 06:13:16" (1/3) ... [2018-12-02 18:13:16,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4a0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:13:16, skipping insertion in model container [2018-12-02 18:13:16,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 18:13:16,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:13:16" (2/3) ... [2018-12-02 18:13:16,901 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4c4a0d5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 06:13:16, skipping insertion in model container [2018-12-02 18:13:16,901 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 18:13:16,901 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:13:16" (3/3) ... [2018-12-02 18:13:16,902 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_mixed_alloca_true-termination.c.i [2018-12-02 18:13:16,936 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 18:13:16,937 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 18:13:16,937 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 18:13:16,937 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 18:13:16,937 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 18:13:16,937 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 18:13:16,937 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 18:13:16,937 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 18:13:16,937 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 18:13:16,946 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 18:13:16,958 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 18:13:16,959 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 18:13:16,959 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 18:13:16,963 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 18:13:16,963 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 18:13:16,963 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 18:13:16,963 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-02 18:13:16,964 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2018-12-02 18:13:16,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 18:13:16,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 18:13:16,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-02 18:13:16,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 18:13:16,970 INFO L794 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 5#L385true assume !(main_~length~0 < 1); 7#L385-2true assume !(main_~n~0 < 1); 3#L388-1true call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 14#L370-2true [2018-12-02 18:13:16,970 INFO L796 eck$LassoCheckResult]: Loop: 14#L370-2true assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 9#L372true assume !(0 == cstrncpy_#t~mem208);havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset; 14#L370-2true [2018-12-02 18:13:16,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash 28695878, now seen corresponding path program 1 times [2018-12-02 18:13:16,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:17,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:17,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:17,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1747, now seen corresponding path program 1 times [2018-12-02 18:13:17,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:17,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:17,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:17,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935768, now seen corresponding path program 1 times [2018-12-02 18:13:17,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:17,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:17,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:17,354 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 90 [2018-12-02 18:13:17,415 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 18:13:17,416 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 18:13:17,416 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 18:13:17,416 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 18:13:17,416 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 18:13:17,416 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 18:13:17,417 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 18:13:17,417 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 18:13:17,417 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration1_Lasso [2018-12-02 18:13:17,417 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 18:13:17,417 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 18:13:17,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,441 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,442 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,445 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,621 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2018-12-02 18:13:17,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,705 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,717 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:17,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,038 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 18:13:18,041 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 18:13:18,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:18,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:18,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:18,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:18,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:18,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:18,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:18,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:18,050 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:18,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,052 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:18,052 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:18,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,056 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:18,056 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:18,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:18,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:18,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:18,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,061 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:18,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:18,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:18,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:18,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:18,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:18,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:18,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:18,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:18,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:18,077 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:18,077 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:18,099 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 18:13:18,109 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-02 18:13:18,109 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-02 18:13:18,110 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 18:13:18,111 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-02 18:13:18,112 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 18:13:18,112 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset) = 2*ULTIMATE.start_cstrncpy_~dst~0.offset + 1 Supporting invariants [] [2018-12-02 18:13:18,144 INFO L297 tatePredicateManager]: 12 out of 12 supporting invariants were superfluous and have been removed [2018-12-02 18:13:18,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:13:18,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:13:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:13:18,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:13:18,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:13:18,206 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 [2018-12-02 18:13:18,207 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-12-02 18:13:18,231 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. [2018-12-02 18:13:18,231 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 [2018-12-02 18:13:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 18:13:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2018-12-02 18:13:18,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 2 letters. [2018-12-02 18:13:18,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:18,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 18:13:18,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:18,235 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 27 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-02 18:13:18,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:18,236 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 40 transitions. [2018-12-02 18:13:18,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 18:13:18,239 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 11 states and 14 transitions. [2018-12-02 18:13:18,240 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-12-02 18:13:18,240 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-02 18:13:18,241 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 14 transitions. [2018-12-02 18:13:18,241 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 18:13:18,241 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-02 18:13:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 14 transitions. [2018-12-02 18:13:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-02 18:13:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-02 18:13:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2018-12-02 18:13:18,257 INFO L728 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 18:13:18,257 INFO L608 BuchiCegarLoop]: Abstraction has 10 states and 13 transitions. [2018-12-02 18:13:18,257 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 18:13:18,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 13 transitions. [2018-12-02 18:13:18,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2018-12-02 18:13:18,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 18:13:18,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 18:13:18,258 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:13:18,258 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-12-02 18:13:18,258 INFO L794 eck$LassoCheckResult]: Stem: 143#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 140#L-1 havoc main_#res;havoc main_#t~nondet211, main_#t~nondet212, main_#t~malloc213.base, main_#t~malloc213.offset, main_#t~malloc214.base, main_#t~malloc214.offset, main_#t~ret215.base, main_#t~ret215.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~nondet211;havoc main_#t~nondet211;main_~n~0 := main_#t~nondet212;havoc main_#t~nondet212; 141#L385 assume !(main_~length~0 < 1); 146#L385-2 assume !(main_~n~0 < 1); 144#L388-1 call main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc(main_~n~0);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;call main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc(main_~length~0);main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset;call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1), 1);main_~nondetArea~0.base, main_~nondetArea~0.offset := main_~nondetArea~0.base, main_~nondetArea~0.offset + (main_~n~0 - 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~post205, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, cstrncpy_#t~mem208, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, cstrncpy_#t~post209, 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; 145#L370-2 assume !!(cstrncpy_~n > 0);cstrncpy_#t~post205 := cstrncpy_~n;cstrncpy_~n := cstrncpy_#t~post205 - 1;havoc cstrncpy_#t~post205;cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset := cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset - 1;cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset := cstrncpy_~src~0.base, cstrncpy_~src~0.offset;cstrncpy_~src~0.base, cstrncpy_~src~0.offset := cstrncpy_#t~post207.base, 1 + cstrncpy_#t~post207.offset;call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1);call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); 137#L372 assume 0 == cstrncpy_#t~mem208;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 139#L375-3 [2018-12-02 18:13:18,258 INFO L796 eck$LassoCheckResult]: Loop: 139#L375-3 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 142#L375-1 assume !!(0 != cstrncpy_#t~post209);havoc cstrncpy_#t~post209;cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset := cstrncpy_~us~0.base, cstrncpy_~us~0.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset - 1;call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1);havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 139#L375-3 [2018-12-02 18:13:18,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:18,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935753, now seen corresponding path program 1 times [2018-12-02 18:13:18,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:18,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:18,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:18,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:18,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1990, now seen corresponding path program 1 times [2018-12-02 18:13:18,276 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:18,276 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:18,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:18,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:18,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1298472078, now seen corresponding path program 1 times [2018-12-02 18:13:18,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 18:13:18,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 18:13:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:13:18,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:13:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:13:18,616 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 129 [2018-12-02 18:13:18,726 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2018-12-02 18:13:18,727 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 18:13:18,728 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 18:13:18,728 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 18:13:18,728 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 18:13:18,728 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 18:13:18,728 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 18:13:18,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 18:13:18,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 18:13:18,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_mixed_alloca_true-termination.c.i_Iteration2_Lasso [2018-12-02 18:13:18,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 18:13:18,729 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 18:13:18,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,941 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 86 [2018-12-02 18:13:18,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:18,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 18:13:19,297 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 18:13:19,297 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 18:13:19,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:19,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,299 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:19,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:19,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:19,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:19,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:19,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:19,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,301 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:19,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:19,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:19,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,303 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,303 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,303 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:19,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:19,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:19,304 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:19,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,306 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 18:13:19,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 18:13:19,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 18:13:19,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 18:13:19,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,309 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 18:13:19,309 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-02 18:13:19,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 18:13:19,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 18:13:19,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 18:13:19,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 18:13:19,312 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 18:13:19,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 18:13:19,319 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-02 18:13:19,320 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-02 18:13:19,415 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-02 18:13:19,461 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2018-12-02 18:13:19,461 INFO L444 ModelExtractionUtils]: 55 out of 66 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-02 18:13:19,462 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-02 18:13:19,463 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-02 18:13:19,463 INFO L518 LassoAnalysis]: Proved termination. [2018-12-02 18:13:19,463 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~us~0.offset) = 2*ULTIMATE.start_cstrncpy_~us~0.offset + 1 Supporting invariants [] [2018-12-02 18:13:19,497 INFO L297 tatePredicateManager]: 16 out of 16 supporting invariants were superfluous and have been removed [2018-12-02 18:13:19,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:13:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:13:19,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:13:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:13:19,521 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 18:13:19,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:13:19,522 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2018-12-02 18:13:19,522 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5 Second operand 3 states. [2018-12-02 18:13:19,526 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states and 13 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 12 states and 16 transitions. Complement of second has 4 states. [2018-12-02 18:13:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2018-12-02 18:13:19,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-12-02 18:13:19,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 12 transitions. [2018-12-02 18:13:19,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 2 letters. [2018-12-02 18:13:19,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:19,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 9 letters. Loop has 2 letters. [2018-12-02 18:13:19,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:19,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 12 transitions. Stem has 7 letters. Loop has 4 letters. [2018-12-02 18:13:19,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-02 18:13:19,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 12 states and 16 transitions. [2018-12-02 18:13:19,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 18:13:19,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 12 states to 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-02 18:13:19,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-02 18:13:19,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 18:13:19,528 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 18:13:19,528 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-02 18:13:19,528 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-02 18:13:19,528 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-02 18:13:19,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 06:13:19 BoogieIcfgContainer [2018-12-02 18:13:19,532 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 18:13:19,533 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 18:13:19,533 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 18:13:19,533 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 18:13:19,533 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:13:16" (3/4) ... [2018-12-02 18:13:19,535 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 18:13:19,535 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 18:13:19,536 INFO L168 Benchmark]: Toolchain (without parser) took 3129.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 174.1 MB). Free memory was 950.6 MB in the beginning and 919.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 205.6 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,536 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:13:19,537 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,537 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,537 INFO L168 Benchmark]: Boogie Preprocessor took 14.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,538 INFO L168 Benchmark]: RCFGBuilder took 155.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,538 INFO L168 Benchmark]: BuchiAutomizer took 2635.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 919.1 MB in the end (delta: 163.1 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. [2018-12-02 18:13:19,539 INFO L168 Benchmark]: Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 919.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 18:13:19,541 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.67 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2635.54 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 919.1 MB in the end (delta: 163.1 MB). Peak memory consumption was 216.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.74 ms. Allocated memory is still 1.2 GB. Free memory is still 919.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * 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 2 * dst + 1 and consists of 4 locations. One deterministic module has affine ranking function 2 * us + 1 and consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.6s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 2.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. 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: 27 SDtfs, 26 SDslu, 10 SDs, 0 SdLazy, 4 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital234 mio100 ax100 hnf99 lsp96 ukn87 mio100 lsp35 div100 bol100 ite100 ukn100 eq197 hnf89 smp100 dnf115 smp100 tf100 neg99 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 151ms VariablesStem: 12 VariablesLoop: 7 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...