./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/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 7c56c09a74d2fc3893706afbe8a4ee36044dd617 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-09 22:31:41,837 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-09 22:31:41,838 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-09 22:31:41,846 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-09 22:31:41,847 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-09 22:31:41,847 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-09 22:31:41,848 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-09 22:31:41,849 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-09 22:31:41,850 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-09 22:31:41,851 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-09 22:31:41,852 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-09 22:31:41,852 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-09 22:31:41,853 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-09 22:31:41,853 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-09 22:31:41,854 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-09 22:31:41,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-09 22:31:41,855 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-09 22:31:41,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-09 22:31:41,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-09 22:31:41,858 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-09 22:31:41,859 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-09 22:31:41,860 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-09 22:31:41,861 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-09 22:31:41,861 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-09 22:31:41,861 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-09 22:31:41,862 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-09 22:31:41,862 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-09 22:31:41,863 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-09 22:31:41,863 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-09 22:31:41,864 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-09 22:31:41,864 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-09 22:31:41,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-09 22:31:41,865 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-09 22:31:41,865 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-09 22:31:41,865 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-09 22:31:41,866 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-09 22:31:41,866 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-09 22:31:41,876 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-09 22:31:41,876 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-09 22:31:41,877 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-09 22:31:41,877 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-09 22:31:41,877 INFO L133 SettingsManager]: * Use SBE=true [2018-11-09 22:31:41,877 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-09 22:31:41,877 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-09 22:31:41,878 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-09 22:31:41,878 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-09 22:31:41,879 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-09 22:31:41,879 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-09 22:31:41,880 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-09 22:31:41,880 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-09 22:31:41,880 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-09 22:31:41,880 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-09 22:31:41,881 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-09 22:31:41,881 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_cc87d093-d51c-4f38-aa4b-8d4af4e814db/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 -> 7c56c09a74d2fc3893706afbe8a4ee36044dd617 [2018-11-09 22:31:41,903 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-09 22:31:41,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-09 22:31:41,915 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-09 22:31:41,916 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-09 22:31:41,916 INFO L276 PluginConnector]: CDTParser initialized [2018-11-09 22:31:41,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/../../sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-11-09 22:31:41,950 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/data/6e67ddb7b/560ace5a2e3c4ce89bc89e8fbe423fe4/FLAG51175e426 [2018-11-09 22:31:42,388 INFO L298 CDTParser]: Found 1 translation units. [2018-11-09 22:31:42,388 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/sv-benchmarks/c/termination-15/cstrncpy_malloc_true-termination.c.i [2018-11-09 22:31:42,395 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/data/6e67ddb7b/560ace5a2e3c4ce89bc89e8fbe423fe4/FLAG51175e426 [2018-11-09 22:31:42,403 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/bin-2019/uautomizer/data/6e67ddb7b/560ace5a2e3c4ce89bc89e8fbe423fe4 [2018-11-09 22:31:42,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-09 22:31:42,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-09 22:31:42,406 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-09 22:31:42,406 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-09 22:31:42,409 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-09 22:31:42,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66cdfcaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42, skipping insertion in model container [2018-11-09 22:31:42,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-09 22:31:42,441 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-09 22:31:42,626 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:31:42,632 INFO L189 MainTranslator]: Completed pre-run [2018-11-09 22:31:42,659 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-09 22:31:42,690 INFO L193 MainTranslator]: Completed translation [2018-11-09 22:31:42,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42 WrapperNode [2018-11-09 22:31:42,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-09 22:31:42,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-09 22:31:42,691 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-09 22:31:42,691 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-09 22:31:42,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,758 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-09 22:31:42,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-09 22:31:42,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-09 22:31:42,759 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-09 22:31:42,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,766 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,766 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... [2018-11-09 22:31:42,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-09 22:31:42,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-09 22:31:42,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-09 22:31:42,778 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-09 22:31:42,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_cc87d093-d51c-4f38-aa4b-8d4af4e814db/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-11-09 22:31:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-09 22:31:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-09 22:31:42,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-09 22:31:42,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-09 22:31:43,007 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-09 22:31:43,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:43 BoogieIcfgContainer [2018-11-09 22:31:43,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-09 22:31:43,008 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-09 22:31:43,008 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-09 22:31:43,010 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-09 22:31:43,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:31:43,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 10:31:42" (1/3) ... [2018-11-09 22:31:43,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ed89f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:31:43, skipping insertion in model container [2018-11-09 22:31:43,011 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:31:43,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:31:42" (2/3) ... [2018-11-09 22:31:43,012 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ed89f62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 10:31:43, skipping insertion in model container [2018-11-09 22:31:43,012 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-09 22:31:43,012 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:43" (3/3) ... [2018-11-09 22:31:43,013 INFO L375 chiAutomizerObserver]: Analyzing ICFG cstrncpy_malloc_true-termination.c.i [2018-11-09 22:31:43,043 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-09 22:31:43,044 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-09 22:31:43,044 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-09 22:31:43,044 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-09 22:31:43,044 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-09 22:31:43,044 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-09 22:31:43,044 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-09 22:31:43,044 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-09 22:31:43,044 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-09 22:31:43,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-09 22:31:43,067 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:31:43,068 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:31:43,068 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:31:43,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:31:43,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 22:31:43,072 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-09 22:31:43,073 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-11-09 22:31:43,074 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2018-11-09 22:31:43,074 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:31:43,074 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:31:43,075 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:31:43,075 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 22:31:43,082 INFO L793 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 8#L385true assume !(main_~length~0 < 1); 11#L385-2true assume !(main_~n~0 < 1); 4#L388-1true #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 14#L393true SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 18#L393-1true assume { :begin_inline_cstrncpy } true;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; 24#L370-3true [2018-11-09 22:31:43,082 INFO L795 eck$LassoCheckResult]: Loop: 24#L370-3true assume true; 22#L370-1true 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, cstrncpy_#t~post207.offset + 1; 13#L372true SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 16#L372-1true SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 19#L372-2true assume !(cstrncpy_#t~mem208 == 0);havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset; 24#L370-3true [2018-11-09 22:31:43,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1806935495, now seen corresponding path program 1 times [2018-11-09 22:31:43,088 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:43,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:43,174 INFO L82 PathProgramCache]: Analyzing trace with hash 48855306, now seen corresponding path program 1 times [2018-11-09 22:31:43,174 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:43,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:43,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:43,192 INFO L82 PathProgramCache]: Analyzing trace with hash -795574524, now seen corresponding path program 1 times [2018-11-09 22:31:43,192 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:43,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:43,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:43,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:43,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:43,354 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-09 22:31:43,589 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-09 22:31:43,679 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:31:43,680 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:31:43,680 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:31:43,681 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:31:43,681 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:31:43,681 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:31:43,681 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:31:43,681 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:31:43,681 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration1_Lasso [2018-11-09 22:31:43,681 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:31:43,682 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:31:43,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-11-09 22:31:43,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-11-09 22:31:43,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-11-09 22:31:43,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:43,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-11-09 22:31:44,013 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2018-11-09 22:31:44,139 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2018-11-09 22:31:44,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:44,603 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:31:44,607 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:31:44,608 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-11-09 22:31:44,609 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:44,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,610 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,612 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:44,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:44,614 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,614 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-11-09 22:31:44,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,615 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,617 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,621 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,621 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-11-09 22:31:44,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:44,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:44,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:44,624 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,624 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-11-09 22:31:44,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,625 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:44,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,625 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,626 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:44,626 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:44,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,627 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-11-09 22:31:44,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,631 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,647 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,647 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-11-09 22:31:44,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,648 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,649 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,652 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-11-09 22:31:44,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,654 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,654 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,656 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,657 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-11-09 22:31:44,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:44,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,658 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:44,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:44,659 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,659 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-11-09 22:31:44,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,661 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,661 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,665 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,666 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-11-09 22:31:44,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,670 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,674 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,675 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-11-09 22:31:44,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,679 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,679 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,694 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-11-09 22:31:44,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,695 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:31:44,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:31:44,699 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,712 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-11-09 22:31:44,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,713 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-09 22:31:44,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,715 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-09 22:31:44,715 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,727 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,727 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-11-09 22:31:44,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:44,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,728 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:31:44,728 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-09 22:31:44,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:44,730 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:44,731 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-11-09 22:31:44,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:44,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:44,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:44,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:44,739 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:44,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:44,810 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:31:44,857 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-09 22:31:44,857 INFO L444 ModelExtractionUtils]: 64 out of 70 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-09 22:31:44,859 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:31:44,860 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-09 22:31:44,860 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:31:44,861 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrncpy_~dst~0.offset, v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1) = -1*ULTIMATE.start_cstrncpy_~dst~0.offset + 1*v_rep(select #length ULTIMATE.start_#Ultimate.alloc_#res.base)_1 Supporting invariants [] [2018-11-09 22:31:44,898 INFO L297 tatePredicateManager]: 11 out of 13 supporting invariants were superfluous and have been removed [2018-11-09 22:31:44,906 WARN L387 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled [2018-11-09 22:31:44,909 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 22:31:44,909 WARN L1239 BoogieBacktranslator]: unknown boogie variable #Ultimate.alloc_#res [2018-11-09 22:31:44,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:44,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:31:44,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:31:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:31:45,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:31:45,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:31:45,078 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-09 22:31:45,079 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states. Second operand 6 states. [2018-11-09 22:31:45,137 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states.. Second operand 6 states. Result 43 states and 53 transitions. Complement of second has 8 states. [2018-11-09 22:31:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 22:31:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-09 22:31:45,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2018-11-09 22:31:45,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-09 22:31:45,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:45,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-09 22:31:45,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:45,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 34 transitions. Stem has 7 letters. Loop has 10 letters. [2018-11-09 22:31:45,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:45,142 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 53 transitions. [2018-11-09 22:31:45,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 22:31:45,145 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 19 states and 22 transitions. [2018-11-09 22:31:45,146 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-09 22:31:45,146 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-09 22:31:45,147 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-09 22:31:45,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-09 22:31:45,147 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-09 22:31:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-09 22:31:45,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-09 22:31:45,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-09 22:31:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-09 22:31:45,165 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-09 22:31:45,165 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-09 22:31:45,165 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-09 22:31:45,165 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-09 22:31:45,166 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-09 22:31:45,166 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-09 22:31:45,166 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-09 22:31:45,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-09 22:31:45,167 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-09 22:31:45,167 INFO L793 eck$LassoCheckResult]: Stem: 202#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 198#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;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; 194#L385 assume !(main_~length~0 < 1); 195#L385-2 assume !(main_~n~0 < 1); 189#L388-1 #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~n~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc213.base, main_#t~malloc213.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetArea~0.base, main_~nondetArea~0.offset := main_#t~malloc213.base, main_#t~malloc213.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := main_~length~0 * 1;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc214.base, main_#t~malloc214.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~nondetString~0.base, main_~nondetString~0.offset := main_#t~malloc214.base, main_#t~malloc214.offset; 190#L393 SUMMARY for call write~int(0, main_~nondetString~0.base, main_~nondetString~0.offset + (main_~length~0 - 1) * 1, 1); srcloc: L393 201#L393-1 assume { :begin_inline_cstrncpy } true;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; 205#L370-3 assume true; 207#L370-1 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, cstrncpy_#t~post207.offset + 1; 199#L372 SUMMARY for call cstrncpy_#t~mem208 := read~int(cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset, 1); srcloc: L372 200#L372-1 SUMMARY for call write~int(cstrncpy_#t~mem208, cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset, 1); srcloc: L372-1 204#L372-2 assume cstrncpy_#t~mem208 == 0;havoc cstrncpy_#t~mem208;havoc cstrncpy_#t~post206.base, cstrncpy_#t~post206.offset;havoc cstrncpy_#t~post207.base, cstrncpy_#t~post207.offset;cstrncpy_~us~0.base, cstrncpy_~us~0.offset := cstrncpy_~dst~0.base, cstrncpy_~dst~0.offset;cstrncpy_~n2~0 := cstrncpy_~n; 193#L375-4 [2018-11-09 22:31:45,167 INFO L795 eck$LassoCheckResult]: Loop: 193#L375-4 assume true; 196#L375-1 cstrncpy_#t~post209 := cstrncpy_~n2~0;cstrncpy_~n2~0 := cstrncpy_#t~post209 - 1; 197#L375-2 assume !!(cstrncpy_#t~post209 != 0);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; 191#L376 SUMMARY for call write~int(0, cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset, 1); srcloc: L376 192#L376-1 havoc cstrncpy_#t~post210.base, cstrncpy_#t~post210.offset; 193#L375-4 [2018-11-09 22:31:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -795574542, now seen corresponding path program 1 times [2018-11-09 22:31:45,167 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:45,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:45,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:45,188 INFO L82 PathProgramCache]: Analyzing trace with hash 63050697, now seen corresponding path program 1 times [2018-11-09 22:31:45,188 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:45,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:45,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 227296120, now seen corresponding path program 1 times [2018-11-09 22:31:45,196 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-09 22:31:45,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-09 22:31:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-09 22:31:45,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-09 22:31:45,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-09 22:31:45,595 WARN L179 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 133 [2018-11-09 22:31:45,706 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-11-09 22:31:45,707 INFO L214 LassoAnalysis]: Preferences: [2018-11-09 22:31:45,708 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-09 22:31:45,708 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-09 22:31:45,708 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-09 22:31:45,708 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-09 22:31:45,708 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-09 22:31:45,708 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-09 22:31:45,708 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-09 22:31:45,708 INFO L131 ssoRankerPreferences]: Filename of dumped script: cstrncpy_malloc_true-termination.c.i_Iteration2_Lasso [2018-11-09 22:31:45,708 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-09 22:31:45,708 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-09 22:31:45,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-11-09 22:31:45,714 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,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-11-09 22:31:45,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-11-09 22:31:45,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-11-09 22:31:45,719 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,721 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,723 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:45,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-11-09 22:31:46,010 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 105 [2018-11-09 22:31:46,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-09 22:31:46,538 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-09 22:31:46,538 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-09 22:31:46,539 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-11-09 22:31:46,539 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,540 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,543 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-11-09 22:31:46,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,544 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,544 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-11-09 22:31:46,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,544 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,545 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,545 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,545 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-11-09 22:31:46,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,546 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,546 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,546 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,546 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-11-09 22:31:46,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:46,547 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:46,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,548 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-11-09 22:31:46,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,548 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,548 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,549 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,549 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,549 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-11-09 22:31:46,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,550 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,550 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,550 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-11-09 22:31:46,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,551 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,551 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-11-09 22:31:46,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,552 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,552 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,552 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,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 [2018-11-09 22:31:46,552 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,552 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,553 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,553 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,553 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:46,553 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:46,557 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,558 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-11-09 22:31:46,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,559 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,559 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,560 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-11-09 22:31:46,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,560 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,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 [2018-11-09 22:31:46,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-09 22:31:46,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-09 22:31:46,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-09 22:31:46,562 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,562 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-11-09 22:31:46,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-09 22:31:46,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-09 22:31:46,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-09 22:31:46,565 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-09 22:31:46,565 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-11-09 22:31:46,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-09 22:31:46,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-09 22:31:46,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-09 22:31:46,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-09 22:31:46,577 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-09 22:31:46,577 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-09 22:31:46,736 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-09 22:31:46,839 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-09 22:31:46,839 INFO L444 ModelExtractionUtils]: 111 out of 126 variables were initially zero. Simplification set additionally 12 variables to zero. [2018-11-09 22:31:46,840 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-09 22:31:46,842 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-09 22:31:46,842 INFO L517 LassoAnalysis]: Proved termination. [2018-11-09 22:31:46,842 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1, ULTIMATE.start_cstrncpy_~us~0.offset) = 1*v_rep(select #length ULTIMATE.start_cstrncpy_~us~0.base)_1 - 1*ULTIMATE.start_cstrncpy_~us~0.offset Supporting invariants [] [2018-11-09 22:31:46,924 INFO L297 tatePredicateManager]: 17 out of 17 supporting invariants were superfluous and have been removed [2018-11-09 22:31:46,925 WARN L1239 BoogieBacktranslator]: unknown boogie variable #length [2018-11-09 22:31:46,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-09 22:31:46,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:31:46,961 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:31:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-09 22:31:46,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-09 22:31:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-09 22:31:47,001 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-09 22:31:47,001 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-09 22:31:47,018 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 25 states and 29 transitions. Complement of second has 6 states. [2018-11-09 22:31:47,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-09 22:31:47,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-09 22:31:47,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2018-11-09 22:31:47,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 5 letters. [2018-11-09 22:31:47,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 17 letters. Loop has 5 letters. [2018-11-09 22:31:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:47,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 21 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-09 22:31:47,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-09 22:31:47,020 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 29 transitions. [2018-11-09 22:31:47,021 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:31:47,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 0 states and 0 transitions. [2018-11-09 22:31:47,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-09 22:31:47,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-09 22:31:47,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-09 22:31:47,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-09 22:31:47,022 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:31:47,022 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:31:47,022 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-09 22:31:47,022 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-09 22:31:47,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-09 22:31:47,022 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-09 22:31:47,022 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-09 22:31:47,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 10:31:47 BoogieIcfgContainer [2018-11-09 22:31:47,026 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-09 22:31:47,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-09 22:31:47,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-09 22:31:47,026 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-09 22:31:47,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:31:43" (3/4) ... [2018-11-09 22:31:47,029 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-09 22:31:47,029 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-09 22:31:47,030 INFO L168 Benchmark]: Toolchain (without parser) took 4624.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 957.5 MB in the beginning and 885.6 MB in the end (delta: 71.9 MB). Peak memory consumption was 380.7 MB. Max. memory is 11.5 GB. [2018-11-09 22:31:47,031 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:31:47,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.35 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 930.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2018-11-09 22:31:47,032 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. [2018-11-09 22:31:47,032 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:31:47,033 INFO L168 Benchmark]: RCFGBuilder took 229.81 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2018-11-09 22:31:47,033 INFO L168 Benchmark]: BuchiAutomizer took 4018.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 228.2 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. [2018-11-09 22:31:47,034 INFO L168 Benchmark]: Witness Printer took 2.71 ms. Allocated memory is still 1.3 GB. Free memory is still 885.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-09 22:31:47,037 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 284.35 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 930.7 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 930.7 MB in the beginning and 1.1 GB in the end (delta: -207.3 MB). Peak memory consumption was 15.9 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 229.81 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: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4018.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 165.2 MB). Free memory was 1.1 GB in the beginning and 885.6 MB in the end (delta: 228.2 MB). Peak memory consumption was 393.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.71 ms. Allocated memory is still 1.3 GB. Free memory is still 885.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.alloc_#res : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #Ultimate.alloc_#res - 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 -1 * dst + unknown-#length-unknown[#Ultimate.alloc_#res] and consists of 6 locations. One deterministic module has affine ranking function unknown-#length-unknown[us] + -1 * us and consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 37 SDtfs, 42 SDslu, 33 SDs, 0 SdLazy, 20 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax100 hnf99 lsp96 ukn104 mio100 lsp50 div100 bol100 ite100 ukn100 eq205 hnf88 smp100 dnf115 smp100 tf100 neg99 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 277ms VariablesStem: 24 VariablesLoop: 15 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...